Postponing the choice of the barrier parameter in Mehrotra-type predictor-corrector algorithms
From MaRDI portal
Publication:881509
DOI10.1016/j.ejor.2006.08.044zbMath1121.90091OpenAlexW1987085624MaRDI QIDQ881509
Publication date: 30 May 2007
Published in: European Journal of Operational Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.ejor.2006.08.044
predictor-corrector methodlinear optimizationpolynomial complexitysuperlinear convergenceMehrotra-type algorithm
Abstract computational complexity for mathematical programming problems (90C60) Linear programming (90C05)
Related Items (7)
A finite termination Mehrotra-type predictor-corrector algorithm ⋮ A constraint-reduced variant of Mehrotra's predictor-corrector algorithm ⋮ An \(O(\sqrt nL)\) iteration primal-dual second-order corrector algorithm for linear programming ⋮ Mehrotra-type predictor-corrector algorithm revisited ⋮ Mehrotra-type predictor-corrector algorithms for sufficient linear complementarity problem ⋮ Computational experience with a modified potential reduction algorithm for linear programming ⋮ Infeasible Mehrotra-Type Predictor-Corrector Interior-Point Algorithm for the CartesianP*(κ)-LCP Over Symmetric Cones
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- On finding a vertex solution using interior point methods
- On quadratic and \(O(\sqrt{n}L)\) convergence of a predictor-corrector algorithm for LCP
- Multiple centrality corrections in a primal-dual method for linear programming
- The Mizuno-Todd-Ye algorithm in a larger neighborhood of the central path
- On Mehrotra-Type Predictor-Corrector Algorithms
- On the Implementation of a Primal-Dual Interior Point Method
- Solving large-scale linear programs by interior-point methods under the Matlab∗Environment†
- 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
- Convergence Conditions and Krylov Subspace--Based Corrections for Primal-Dual Interior-Point Method
- A Predictor-Corrector Algorithm for Linear Optimization Based on a Specific Self-Regular Proximity Function
This page was built for publication: Postponing the choice of the barrier parameter in Mehrotra-type predictor-corrector algorithms
