Mehrotra-type predictor-corrector algorithm revisited
From MaRDI portal
Publication:3539794
DOI10.1080/10556780701661393zbMath1211.90128OpenAlexW2055391493MaRDI QIDQ3539794
Publication date: 19 November 2008
Published in: Optimization Methods and Software (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1080/10556780701661393
predictor-corrector methodslinear optimizationpolynomial complexityMehrotra-type algorithminterior-point-methods
Linear programming (90C05) Interior-point methods (90C51) Software, source code, etc. for problems pertaining to operations research and mathematical programming (90-04)
Related Items (5)
An arc-search \({\mathcal {O}}(nL)\) infeasible-interior-point algorithm for linear programming ⋮ Robust continuation methods for tracing solution curves of parameterized systems ⋮ A predictor-corrector algorithm for linear optimization based on a modified Newton direction ⋮ On complexity of a new Mehrotra-type interior point algorithm for \(P_\ast(\kappa )\) linear complementarity problems ⋮ Newton-type interior-point methods for solving generalized complementarity problems in polyhedral cones
Uses Software
Cites Work
- Postponing the choice of the barrier parameter in Mehrotra-type predictor-corrector algorithms
- On finding a vertex solution using interior point methods
- On quadratic and \(O(\sqrt{n}L)\) convergence of a predictor-corrector algorithm for LCP
- 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
- PCx: an interior-point code for linear programming
- LOQO:an interior point code for quadratic programming
- Convergence Conditions and Krylov Subspace--Based Corrections for Primal-Dual Interior-Point Method
- Interior Point Methods for Linear Optimization
This page was built for publication: Mehrotra-type predictor-corrector algorithm revisited
