A superlinearly convergent predictor-corrector method for degenerate LCP in a wide neighborhood of the central path with $O(\sqrt nL)$-iteration complexity

DOI10.1007/s10107-003-0472-9zbMath1116.90101OpenAlexW2911789798MaRDI QIDQ1881563

Publication date: 5 October 2004

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

Full work available at URL: https://doi.org/10.1007/s10107-003-0472-9

Mathematics Subject Classification ID

Numerical optimization and variational techniques (65K10) Methods of quasi-Newton type (90C53) Complementarity and equilibrium problems and variational inequalities (finite dimensions) (aspects of mathematical programming) (90C33) Interior-point methods (90C51)

Related Items (23)

A superlinearly convergent predictor-corrector method for degenerate LCP in a wide neighborhood of the central path with $O(\sqrt nL)$-iteration complexity ⋮ Infeasible interior-point methods for linear optimization based on large neighborhood ⋮ A new wide-neighborhood predictor-corrector interior-point method for semidefinite optimization ⋮ Predictor–corrector methods for sufficient linear complementarity problems in a wide neighborhood of the central path ⋮ Trajectory-following methods for large-scale degenerate convex quadratic programming ⋮ A full-Newton step $O(n)$ infeasible-interior-point algorithm for linear complementarity problems ⋮ An improved predictor-corrector interior-point algorithm for linear complementarity problems with $O(\sqrt{n}L)$-iteration complexity ⋮ Unnamed Item ⋮ A new long-step interior point algorithm for linear programming based on the algebraic equivalent transformation ⋮ 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 ⋮ Kernel-based interior-point methods for monotone linear complementarity problems over symmetric cones ⋮ A long-step feasible predictor–corrector interior-point algorithm for symmetric cone optimization ⋮ A Corrector-Predictor Interior-Point Algorithm for P_∗(κ)-HLCPs Over Cartesian Product of Symmetric Cones ⋮ A new wide neighborhood primal-dual second-order corrector algorithm for linear optimization ⋮ Corrector-predictor methods for monotone linear complementarity problems in a wide neighborhood of the central path ⋮ A long-step interior-point algorithm for symmetric cone Cartesian P_*(κ)-HLCP ⋮ New method for determining search directions for interior-point algorithms in linear optimization ⋮ Large-step interior-point algorithm for linear optimization based on a new wide neighbourhood ⋮ Adaptive large-neighborhood self-regular predictor-corrector interior-point methods for linear optimization ⋮ Interior-point methods for CartesianP_*(κ)-linear complementarity problems over symmetric cones based on the eligible kernel functions ⋮ Enlarging neighborhoods of interior-point algorithms for linear programming via least values of proximity measure functions ⋮ Feasible Corrector-Predictor Interior-Point Algorithm for $P_{*} (\kappa)$-Linear Complementarity Problems Based on a New Search Direction

Cites Work

A superlinearly convergent predictor-corrector method for degenerate LCP in a wide neighborhood of the central path with $O(\sqrt nL)$-iteration complexity

This page was built for publication: A superlinearly convergent predictor-corrector method for degenerate LCP in a wide neighborhood of the central path with $O(\sqrt nL)$-iteration complexity

A superlinearly convergent predictor-corrector method for degenerate LCP in a wide neighborhood of the central path with \(O(\sqrt nL)\)-iteration complexity