On the Superlinear Convergence of an O(n^3 L) Interior-Point Algorithm for the Monotone LCP

DOI10.1137/S1052623494277299MaRDI QIDQ4717552zbMATH OpenOpenAlexFDO

Authors Kevin A. McShane

Publication date 1 December 1996

Published in SIAM Journal on Optimization (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1137/s1052623494277299

zbMATH Keywords

monotone linear complementarity problem\(\varepsilon\)-optimalitypartial updatingpolynomial superlinearly convergent algorithm

Mathematics Subject Classification ID

Quadratic programming (90C20) Linear programming (90C05) Complementarity and equilibrium problems and variational inequalities (finite dimensions) (aspects of mathematical programming) (90C33)

Recommendations

• Superlinearly Convergent $O ( \sqrt{n} L )$-Iteration Interior-Point Algorithms for Linear Programming and the Monotone Linear Complementarity Problem
• A Superlinear Infeasible-Interior-Point Affine Scaling Algorithm for LCP
• Superlinear primal-dual affine scaling algorithms for LCP
• On quadratic and \(O(\sqrt{n}L)\) convergence of a predictor-corrector algorithm for LCP

Cited in

(3)

• A Superlinearly Convergent Infeasible-Interior-Point Algorithm for Geometrical LCPs Without a Strictly Complementary Condition
• Superlinear convergence of an algorithm for monotone linear complementarity problems, when no strictly complementary solution exists
• Superlinearly Convergent $O ( \sqrt{n} L )$-Iteration Interior-Point Algorithms for Linear Programming and the Monotone Linear Complementarity Problem

This page was built for publication: On the Superlinear Convergence of an $O(n^3 L)$ Interior-Point Algorithm for the Monotone LCP

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4717552)