On the Convergence of the Iteration Sequence of Infeasible Path Following Algorithms for Linear Complementarity Problems
From MaRDI portal
Publication:4346228
DOI10.1287/moor.22.2.378zbMath0883.90117OpenAlexW2148841783MaRDI QIDQ4346228
Florian A. Potra, Joseph Frédéric Bonnans
Publication date: 3 August 1997
Published in: Mathematics of Operations Research (Search for Journal in Brave)
Full work available at URL: https://semanticscholar.org/paper/508a352010837d918726d43a36d1a8a4570a9870
Numerical mathematical programming methods (65K05) Newton-type methods (49M15) Complementarity and equilibrium problems and variational inequalities (finite dimensions) (aspects of mathematical programming) (90C33)
Related Items (6)
An infeasible full-NT step IPM for horizontal linear complementarity problem over Cartesian product of symmetric cones ⋮ Corrector-predictor methods for sufficient linear complementarity problems ⋮ Adaptive full newton-step infeasible interior-point method for sufficient horizontal LCP ⋮ Interior hybrid proximal extragradient methods for the linear monotone complementarity problem ⋮ Infeasible predictor-corrector interior-point method applied to image restoration in the presence of noise ⋮ Perturbed path following predictor-corrector interior point algorithms
This page was built for publication: On the Convergence of the Iteration Sequence of Infeasible Path Following Algorithms for Linear Complementarity Problems
