A class of linear complementarity problems solvable in polynomial time
From MaRDI portal
Publication:1174838
DOI10.1016/0024-3795(91)90264-WzbMath0742.65054MaRDI QIDQ1174838
Publication date: 25 June 1992
Published in: Linear Algebra and its Applications (Search for Journal in Brave)
quadratic programminglinear complementarity problemspolynomial complexitypotential reduction algorithm
Numerical mathematical programming methods (65K05) Quadratic programming (90C20) Complementarity and equilibrium problems and variational inequalities (finite dimensions) (aspects of mathematical programming) (90C33)
Related Items
On the solution and complexity of a generalized linear complementarity problem, An extension of interior point potential reduction algorithm to solve general lcps, A quadratically convergent \(\text{O}((\kappa +1)\sqrt n L)\)-iteration algorithm for the \(P_ *(\kappa)\)-matrix linear complementarity problem, Polynomiality of primal-dual affine scaling algorithms for nonlinear complementarity problems, An investigation of interior-point and block pivoting algorithms for large-scale symmetric monotone linear complementarity problems, Solution of finite-dimensional variational inequalities using smooth optimization with simple bounds, On solving linear complementarity problems by DC programming and DCA, Minimum norm solution of the absolute value equations via simulated annealing algorithm, A note on quadratic convergence of a smoothing Newton algorithm for the LCP, A new interior-point algorithm based on modified Nesterov-Todd direction for symmetric cone linear complementarity problem, Some techniques for solving absolute value equations, A long-step barrier method for convex quadratic programming, An infeasible interior-point algorithm based on modified Nesterov and Todd directions for symmetric linear complementarity problem, The linear complementarity problem, sufficient matrices, and the criss- cross method, Two interior-point methods for nonlinear \(P_*(\tau)\)-complementarity problems., An interior point potential reduction method for constrained equations, Enumeration approach for linear complementarity problems based on a reformulation-linearization technique, Enhanced intersection cutting-plane approach for linear complementarity problems, Interior-point algorithms for global optimization, Iteration complexity of an interior-point algorithm for nonlinear p∗-complementarity problems
Cites Work
- Unnamed Item
- Error bounds for the linear complementarity problem with a P-matrix
- An extension of Karmarkar's projective algorithm for convex quadratic programming
- Sufficient matrices and the linear complementarity problem
- Interior path following primal-dual algorithms. I: Linear programming
- A polynomial-time algorithm for a class of linear complementarity problems
- An \(O(\sqrt n L)\) iteration potential reduction algorithm for linear complementarity problems
- An interior point potential reduction algorithm for the linear complementarity problem
- On the number of solutions to the complementarity problem and spanning properties of complementary cones
- A Centered Projective Algorithm for Linear Programming
- Linear complementarity problems solvable by a polynomially bounded pivoting algorithm
- Linear complementarity problems solvable by A single linear program
- Some classes of matrices in linear complementarity theory
- A Characterization of the Constant Parity Property of the Number of Solutions to the Linear Complementarity Problem
- The Linear Complementarity Problem
- Polyhedral sets having a least element
