Subscribe to the gold package and get unlimited access to Shamra Academy
Register a new userOn Column Competent Matrices and Linear Complementarity Problem
104
0
0.0
(
0
)
Ask ChatGPT about the research
No Arabic abstract
We revisit the class of column competent matrices and study some matrix theoretic properties of this class. The local $w$-uniqueness of the solutions to the linear complementarity problem can be identified by the column competent matrices. We establish some new results on $w$-uniqueness properties in connection with column competent matrices. These results are significant in the context of matrix theory as well as algorithms in operations research. We prove some results in connection with locally $w$-uniqueness property of column competent matrices. Finally we establish a connection between column competent matrices and column adequate matrices with the help of degree theory.
rate research
Read More
The paper continues the authors study of the linearizability problem for nonlinear control systems. In the recent work [K. Sklyar, Systems Control Lett. 134 (2019), 104572], conditions on mappability of a nonlinear control system to a preassigned linear system with analytic matrices were obtained. In the present paper we solve more general problem on linearizability conditions without indicating a target linear system. To this end, we give a description of invariants for linear non-autonomous single-input controllable systems with analytic matrices, which allow classifying such systems up to transformations of coordinates. This study leads to one problem from the theory of linear ordinary differential equations with meromorphic coefficients. As a result, we obtain a criterion for mappability of nonlinear control systems to linear control systems with analytic matrices.
We develop a novel variant of the classical Frank-Wolfe algorithm, which we call spectral Frank-Wolfe, for convex optimization over a spectrahedron. The spectral Frank-Wolfe algorithm has a novel ingredient: it computes a few eigenvectors of the gradient and solves a small-scale SDP in each iteration. Such procedure overcomes slow convergence of the classical Frank-Wolfe algorithm due to ignoring eigenvalue coalescence. We demonstrate that strict complementarity of the optimization problem is key to proving linear convergence of various algorithms, such as the spectral Frank-Wolfe algorithm as well as the projected gradient method and its accelerated version.
In this paper, we propose a discretization scheme for the two-stage stochastic linear complementarity problem (LCP) where the underlying random data are continuously distributed. Under some moderate conditions, we derive qualitative and quantitative convergence for the solutions obtained from solving the discretized two-stage stochastic LCP (SLCP). We explain how the discretized two-stage SLCP may be solved by the well-known progressive hedging method (PHM). Moreover, we extend the discussion by considering a two-stage distributionally robust LCP (DRLCP) with moment constraints and proposing a discretization scheme for the DRLCP. As an application, we show how the SLCP and DRLCP models can be used to study equilibrium arising from two-stage duopoly game where each player plans to set up its optimal capacity at present with anticipated competition for production in future.
In this article, we introduce a new homotopy function to trace the trajectory by applying modified homotopy continuation method for finding the solution of the Linear Complementarity Problem. Earlier several authors attempted to propose homotopy functions based on original problems. We propose the homotopy function based on the Karush-Kuhn-Tucker condition of the corresponding quadratic programming problem of the original problem. The proposed approach extends the processability of the larger class of linear complementarity problems and overcomes the limitations of other existing homotopy approaches. We show that the homotopy path approaching the solution is smooth and bounded. We find the positive tangent direction of the homotopy path. The difficulty of finding a strictly feasible initial point for the interior point algorithm can be replaced appropriately by combining the interior point with the homotopy method. Various classes of numerical examples are illustrated to show the effectiveness of the proposed algorithm.
This paper discusses the odds problem, proposed by Bruss in 2000, and its variants. A recurrence relation called a dynamic programming (DP) equation is used to find an optimal stopping policy of the odds problem and its variants. In 2013, Buchbinder, Jain, and Singh proposed a linear programming (LP) formulation for finding an optimal stopping policy of the classical secretary problem, which is a special case of the odds problem. The proposed linear programming problem, which maximizes the probability of a win, differs from the DP equations known for long time periods. This paper shows that an ordinary DP equation is a modification of the dual problem of linear programming including the LP formulation proposed by Buchbinder, Jain, and Singh.
Log in to be able to interact and post comments
comments
Fetching comments
Sign in to be able to follow your search criteria
