Complexity of Predictor-Corrector Algorithms for LCP Based on a Large Neighborhood of the Central Path

DOI10.1137/S1052623496304141zbMath0980.90092MaRDI QIDQ4943612

Clóvis C. Gonzaga

Publication date: 19 March 2000

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

zbMATH Keywords

linear complementarity problemprimal-dual interior point algorithmpredictor-corrector algorithms

Mathematics Subject Classification ID

Numerical mathematical programming methods (65K05) Complementarity and equilibrium problems and variational inequalities (finite dimensions) (aspects of mathematical programming) (90C33) Interior-point methods (90C51)

Related Items (7)

Hessian distances and their applications in the complexity analysis of interior-point methods ⋮ Predictor–corrector methods for sufficient linear complementarity problems in a wide neighborhood of the central path ⋮ Postponing the choice of the barrier parameter in Mehrotra-type predictor-corrector algorithms ⋮ A step-truncated method in a wide neighborhood interior-point algorithm for linear programming ⋮ Corrector-predictor methods for monotone linear complementarity problems in a wide neighborhood of the central path ⋮ Adaptive large-neighborhood self-regular predictor-corrector interior-point methods for linear optimization ⋮ Enlarging neighborhoods of interior-point algorithms for linear programming via least values of proximity measure functions

This page was built for publication: Complexity of Predictor-Corrector Algorithms for LCP Based on a Large Neighborhood of the Central Path