Polynomial time second order mehrotra-type predictor--corrector algorithms
From MaRDI portal
Publication:864824
DOI10.1016/j.amc.2006.05.092zbMath1112.65057OpenAlexW2025574637MaRDI QIDQ864824
Maziar Salahi, Nezam Mahdavi-Amiri
Publication date: 13 February 2007
Published in: Applied Mathematics and Computation (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.amc.2006.05.092
interior point methodslinear optimizationpolynomial complexitypredictor--corrector methodssecond order methods
Numerical mathematical programming methods (65K05) Linear programming (90C05) Interior-point methods (90C51)
Related Items
An predictor–corrector interior-point algorithm for semidefinite optimization based on a wide neighbourhood, An arc-search infeasible-interior-point method for symmetric optimization in a wide neighborhood of the central path, A Mehrotra Type Predictor-Corrector Interior-Point Method for P∗(κ)-HLCP, An \(O(\sqrt{n}L)\) iteration Mehrotra-type predictor-corrector algorithm for monotone linear complementarity problem, A finite termination Mehrotra-type predictor-corrector algorithm, A New Second-Order Infeasible Primal-Dual Path-Following Algorithm for Symmetric Optimization, A second order Mehrotra-type predictor-corrector algorithm for semidefinite optimization, A new second-order corrector interior-point algorithm for semidefinite programming, Polynomial convergence of second-order mehrotra-type predictor-corrector algorithms over symmetric cones, A step-truncated method in a wide neighborhood interior-point algorithm for linear programming, Polynomial complexity of an interior point algorithm with a second order corrector step for symmetric cone programming, An \(O(\sqrt nL)\) iteration primal-dual second-order corrector algorithm for linear programming, A Mehrotra predictor-corrector interior-point algorithm for semidefinite optimization, An adaptive infeasible-interior-point method with the one-norm wide neighborhood for semi-definite programming, Mehrotra-type predictor-corrector algorithms for sufficient linear complementarity problem, A new second-order Mehrotra-type predictor-corrector algorithm for SDO, Infeasible Mehrotra-Type Predictor-Corrector Interior-Point Algorithm for the CartesianP*(κ)-LCP Over Symmetric Cones, A corrector-predictor arc search interior-point algorithm for symmetric optimization, On the convergence analysis of arc search interior point methods for LCPs
Uses Software
Cites Work
- On polynomiality of the Mehrotra-type predictor-corrector interior-point algorithms
- 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†
- PCx: an interior-point code for linear programming
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item