On a Class of Superlinearly Convergent Polynomial Time Interior Point Methods for Sufficient LCP

DOI10.1137/080716979zbMath1213.90245OpenAlexW2009376524MaRDI QIDQ3586138

Florian A. Potra, Josef Stoer

Publication date: 6 September 2010

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

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

zbMATH Keywords

linear complementaritysuperlinear convergenceinterior pointaffine scalinglarge neighborhood

Mathematics Subject Classification ID

Numerical mathematical programming methods (65K05) Quadratic programming (90C20) Newton-type methods (49M15) Linear programming (90C05) Complementarity and equilibrium problems and variational inequalities (finite dimensions) (aspects of mathematical programming) (90C33) Interior-point methods (90C51)

Related Items (15)

Infeasible interior-point methods for linear optimization based on large neighborhood ⋮ An arc-search infeasible interior-point algorithm for horizontal linear complementarity problem in the N∞− neighbourhood of the central path ⋮ Full Nesterov–Todd step feasible interior-point method for the CartesianP_*(κ)-SCLCP ⋮ Trajectory-following methods for large-scale degenerate convex quadratic programming ⋮ A polynomial interior-point algorithm for monotone linear complementarity problems ⋮ A new complexity analysis for full-Newton step infeasible interior-point algorithm for horizontal linear complementarity problems ⋮ A class of polynomial interior point algorithms for the Cartesian P-matrix linear complementarity problem over symmetric cones ⋮ Asymptotic behavior of underlying NT paths in interior point methods for monotone semidefinite linear complementarity problems ⋮ An infeasible full-NT step IPM for horizontal linear complementarity problem over Cartesian product of symmetric cones ⋮ Large-neighborhood infeasible predictor-corrector algorithm for horizontal linear complementarity problems over Cartesian product of symmetric cones ⋮ A full-Newton step feasible interior-point algorithm for \(P_\ast(\kappa)\)-linear complementarity problems ⋮ Corrector-predictor methods for sufficient linear complementarity problems ⋮ A full Nesterov–Todd step infeasible-interior-point algorithm for CartesianP_*(κ) horizontal linear complementarity problems over symmetric cones ⋮ Polynomial convergence of two higher order interior-point methods for \(P_*(\kappa)\)-LCP in a wide neighborhood of the central path ⋮ An improved full-Newton step \(O(n)\) infeasible interior-point method for horizontal linear complementarity problem

This page was built for publication: On a Class of Superlinearly Convergent Polynomial Time Interior Point Methods for Sufficient LCP