Adaptive large-neighborhood self-regular predictor-corrector interior-point methods for linear optimization
From MaRDI portal
Publication:995953
DOI10.1007/s10957-006-9095-7zbMath1138.90011OpenAlexW1991452775MaRDI QIDQ995953
Publication date: 10 September 2007
Published in: Journal of Optimization Theory and Applications (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10957-006-9095-7
quadratic convergencepredictor-corrector methodspolynomial complexityself-regular proximity functions
Abstract computational complexity for mathematical programming problems (90C60) Linear programming (90C05) Interior-point methods (90C51)
Related Items (3)
On self-regular IPMs (with comments and rejoinder) ⋮ Adaptive large-neighborhood self-regular predictor-corrector interior-point methods for linear optimization ⋮ Computational experience with a modified potential reduction algorithm for linear programming
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- A new polynomial-time algorithm for linear programming
- Adaptive large-neighborhood self-regular predictor-corrector interior-point methods for linear optimization
- On quadratic and \(O(\sqrt{n}L)\) convergence of a predictor-corrector algorithm for LCP
- A superlinearly convergent predictor-corrector method for degenerate LCP in a wide neighborhood of the central path with \(O(\sqrt nL)\)-iteration complexity
- Predictor-corrector method for linear complementarity problems with polynomial complexity and superlinear convergence
- On the Implementation of a Primal-Dual Interior Point Method
- On Adaptive-Step Primal-Dual Interior-Point Algorithms for Linear Programming
- A New Infinity-Norm Path Following Algorithm for Linear Programming
- An Asymptotical $O(\sqrt{n} L)$-Iteration Path-Following Linear Programming Algorithm That Uses Wide Neighborhoods
- Complexity of Predictor-Corrector Algorithms for LCP Based on a Large Neighborhood of the Central Path
- Predictor–corrector methods for sufficient linear complementarity problems in a wide neighborhood of the central path
- An adaptive self-regular proximity-based large-update IPM for LO
- A Predictor-Corrector Algorithm for Linear Optimization Based on a Specific Self-Regular Proximity Function
This page was built for publication: Adaptive large-neighborhood self-regular predictor-corrector interior-point methods for linear optimization
