On solving linear complementarity problems as linear programs
From MaRDI portal
Cited in
(34)- Hidden Z-matrices with positive principal minors
- Newton's method for linear complementarity problems
- On the number of pivots of Dantzig's simplex methods for linear and convex quadratic programs
- New methods for linear inequalities
- Convergence of the cyclical relaxation method for linear inequalities
- The vector complementary problem and its equivalences with the weak minimal element in ordered spaces
- Unified approaches for solvable and unsolvable linear complementarity problems
- On the equivalence of nonlinear complementarity problems and least-element problems
- Necessary and sufficient conditions for the existence of complementary solutions and characterizations of the matrix classes \(Q\) and \(Q_ 0\)
- On hidden \(\mathbf{Z}\)-matrices and the linear complementarity problem
- On the effectiveness of projection methods for convex feasibility problems with linear inequality constraints
- On characterizing linear complementarity problems as linear programs
- Linear complementarity problems and multiple objective programming
- Some equivalences among nonlinear complementarity problems, least-element problems, and variational inequality problems in ordered spaces
- Reformulation of mathematical programming problems as linear complementarity problems and investigation of their solution methods
- A finite improvement algorithm for the linear complementarity problem
- Sufficient matrices and the linear complementarity problem
- Matrices and the linear complementarity problem
- The equivalence of an LCP to a parametric linear program with a scalar parameter
- A new concave minimization algorithm for the absolute value equation solution
- A note on sufficient conditions for \(Q_ 0\) and \(Q_ 0\cap P_ 0\) matrices
- Continuous Selections of Solutions to Parametric Variational Inequalities
- New contraction methods for linear inequalities
- On a class of least-element complementarity problems
- On the equivalence of extended generalized complementarity and generalized least-element problems
- Equivalence of vertical block linear complementarity problems and multi-objective programming problems
- A characterization of an \(n\) by \(2n\) ``\(Q_0\)-matrix
- On some classes of matrices related to solving linear complementarity problems as linear programs
- Linear-step solvability of some folded concave and singly-parametric sparse optimization problems
- Generalized linear complementarity problems treated without fixed-point theory
- Iterative methods for variational and complementarity problems
- A simultaneous projections method for linear inequalities
- Linear, quadratic, and bilinear programming approaches to the linear complementarity problem
- An algebra-based approach for linearly constrained concave minimization
This page was built for publication: On solving linear complementarity problems as linear programs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4161082)