Complexity analysis of a linear complementarity algorithm based on a Lyapunov function
From MaRDI portal
Publication:1184351
DOI10.1007/BF01585708zbMath0787.90100MaRDI QIDQ1184351
Publication date: 28 June 1992
Published in: Mathematical Programming. Series A. Series B (Search for Journal in Brave)
rate of convergencelinear complementaritypath followingcomplexity analysispositive semi-definite matricesKarmarkar's method
Abstract computational complexity for mathematical programming problems (90C60) Complementarity and equilibrium problems and variational inequalities (finite dimensions) (aspects of mathematical programming) (90C33) Computational methods for problems pertaining to operations research and mathematical programming (90-08)
Related Items
On the symmetry function of a convex set, On the convergence of the affine-scaling algorithm, Convergence behavior of interior-point algorithms, Search directions and convergence analysis of some infeasibnle path-following methods for the monoton semi-definite lcp∗, Global linear convergence of a path-following algorithm for some monotone variational inequality problems
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- A new polynomial-time algorithm for linear programming
- Interior path following primal-dual algorithms. II: Convex quadratic 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
- Necessary and sufficient conditions for the convergence of iterative methods for the linear complementarity problem
- An \(O(n^ 3L)\) primal interior point algorithm for convex quadratic programming
- On projected newton barrier methods for linear programming and an equivalence to Karmarkar’s projective method
- An Algorithm for Convex Quadratic Programming That Requires O(n3.5L) Arithmetic Operations
- Simple computable bounds for solutions of linear complementarity problems and linear programs
- Convex Analysis
