A quadratically convergent \(\text{O}((\kappa +1)\sqrt n L)\)-iteration algorithm for the \(P_ *(\kappa)\)-matrix linear complementarity problem

DOI10.1007/BF01585565zbMath0844.90097MaRDI QIDQ1906276

Jian-Ming Miao

Publication date: 2 September 1996

Published in: Mathematical Programming. Series A. Series B (Search for Journal in Brave)

zbMATH Keywords

linear complementarity; quadratic convergence; polynomial-time algorithm; interior-point predictor-corrector algorithm

Mathematics Subject Classification ID

90C33: Complementarity and equilibrium problems and variational inequalities (finite dimensions) (aspects of mathematical programming)

Related Items

A new large-update interior point algorithm for \(P_{*}(\kappa)\) LCPs based on kernel functions, A Mizuno-Todd-Ye type predictor-corrector algorithm for sufficient linear complementarity problems, Predictor-corrector algorithm for solving \(P_ *(\kappa)\)-matrix LCP from arbitrary positive starting points, \(d\)-orientation sequences for continuous functions and nonlinear complementarity problems, A new large-update interior point algorithm for \(P_*(\kappa )\) linear complementarity problems

Cites Work

• Unnamed Item
• Unnamed Item
• Interior path following primal-dual algorithms. II: Convex quadratic programming
• A polynomial-time algorithm for a class of linear complementarity problems
• A class of linear complementarity problems solvable in polynomial time
• An \(O(\sqrt n L)\) iteration potential reduction algorithm for linear complementarity problems
• A unified approach to interior point algorithms for linear complementarity problems: A summary
• An interior point potential reduction algorithm for the linear complementarity problem
• A new polynomial time method for a linear complementarity problem
• On quadratic and \(O(\sqrt{n}L)\) convergence of a predictor-corrector algorithm for LCP
• Local convergence of interior-point algorithms for degenerate monotone LCP
• Predictor-corrector method for linear complementarity problems with polynomial complexity and superlinear convergence
• A quadratically convergent \(O(\sqrt n\;L)\)-iteration algorithm for linear programming
• A Polynomial-Time Predictor-Corrector Algorithm for a Class of Linear Complementarity Problems
• On Adaptive-Step Primal-Dual Interior-Point Algorithms for Linear Programming
• A Partition Theorem for Euclidean n-Space