A Superlinearly Convergent Infeasible-Interior-Point Algorithm for Geometrical LCPs Without a Strictly Complementary Condition

DOI10.1287/MOOR.21.2.382MaRDI QIDQ4895564zbMATH OpenOpenAlexFDO

Authors Shinji Mizuno

Publication date 11 March 1997

Published in Mathematics of Operations Research (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1287/moor.21.2.382

zbMATH Keywords

superlinear convergencelinear complementarityinterior-point algorithms

Mathematics Subject Classification ID

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

Recommendations

• A Superlinear Infeasible-Interior-Point Affine Scaling Algorithm for LCP
• On a class of superlinearly convergent polynomial time interior point methods for sufficient LCP
• Superlinear convergence of an algorithm for monotone linear complementarity problems, when no strictly complementary solution exists
• On the Superlinear Convergence of an $O(n^3 L)$ Interior-Point Algorithm for the Monotone LCP
• Superlinearly Convergent $O ( \sqrt{n} L )$-Iteration Interior-Point Algorithms for Linear Programming and the Monotone Linear Complementarity Problem

Cited in

(12)

• Superlinear convergence of an interior-point method despite dependent constraints
• Predictor–corrector methods for sufficient linear complementarity problems in a wide neighborhood of the central path
• Superlinear convergence of an algorithm for monotone linear complementarity problems, when no strictly complementary solution exists
• On the convergence rate of Newton interior-point methods in the absence of strict complementarity
• A smoothing Newton-type algorithm of stronger convergence for the quadratically constrained convex quadratic programming
• A Superlinear Infeasible-Interior-Point Algorithm for Monotone Complementarity Problems
• Trajectory-following methods for large-scale degenerate convex quadratic programming
• A predictor-corrector method for extended linear-quadratic programming
• Predictor-corrector algorithm for solving \(P_ *(\kappa)\)-matrix LCP from arbitrary positive starting points
• Local convergence of predictor-corrector infeasible-interior-point algorithms for SDPs and SDLCPs
• Superlinearly convergent infeasible-interior-point algorithm for degenerate LCP
• Corrector-predictor methods for monotone linear complementarity problems in a wide neighborhood of the central path

This page was built for publication: A Superlinearly Convergent Infeasible-Interior-Point Algorithm for Geometrical LCPs Without a Strictly Complementary Condition

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