An O( nL) iteration primal-dual second-order corrector algorithm for linear programming
From MaRDI portal
Publication:644523
DOI10.1007/S11590-010-0242-6zbMATH Open1269.90058OpenAlexW2085309471MaRDI QIDQ644523FDOQ644523
Authors: Changhe Liu, Hongwei Liu, Weijie Cong 
Publication date: 4 November 2011
Published in: Optimization Letters (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s11590-010-0242-6
Recommendations
- A new wide neighborhood primal-dual second-order corrector algorithm for linear optimization
- An $O(\sqrt{n} L)$-Iteration Large-Step Primal-Dual Affine Algorithm for Linear Programming
- A quadratically convergent \(O(\sqrt n\;L)\)-iteration algorithm for linear programming
- A new \(O(\sqrt nL)\) iteration large-update primal-dual interior-point method for second-order cone programming
- An O(√nL)-Iteration Homogeneous and Self-Dual Linear Programming Algorithm
- A new second-order corrector interior-point algorithm for semidefinite programming
- An improved first-order primal-dual algorithm with a new correction step
- A second order infeasible Mehrotra-type predictor-corrector algorithm for linear programming
- An \(O(\sqrt {n} L)\) iteration bound primal-dual cone affine scaling algorithm for linear programming
Linear programming (90C05) Interior-point methods (90C51) Abstract computational complexity for mathematical programming problems (90C60)
Cites Work
- Numerical Optimization
- On the Implementation of a Primal-Dual Interior Point Method
- Title not available (Why is that?)
- Interior-point methods
- Title not available (Why is that?)
- Title not available (Why is that?)
- Encyclopedia of Optimization
- An O(√nL)-Iteration Homogeneous and Self-Dual Linear Programming Algorithm
- An O$(\sqrtn L)$ Iteration Primal-dual Path-following Method, Based on Wide Neighborhoods and Large Updates, for Monotone LCP
- Some disadvantages of a Mehrotra-type primal-dual corrector interior point algorithm for linear programming
- Topics in semidefinite and interior-point methods
- On polynomiality of the Mehrotra-type predictor-corrector interior-point algorithms
- On Mehrotra-Type Predictor-Corrector Algorithms
- Polynomial time second order mehrotra-type predictor--corrector algorithms
- Neighborhood-following algorithms for linear programming
- A primal-dual infeasible-interior-point algorithm for linear programming
- Multiple centrality corrections in a primal-dual method for linear programming
- Path-Following Methods for Linear Programming
- Postponing the choice of the barrier parameter in Mehrotra-type predictor-corrector algorithms
- On finding a vertex solution using interior point methods
- Title not available (Why is that?)
- A simpler and tighter redundant Klee-Minty construction
Cited In (18)
- An \(\operatorname{O}(\sqrt{r}(\operatorname{cond}(G))^{1 / 4}\log \varepsilon^{- 1})\) iteration predictor-corrector interior-point method with a new one-norm neighbourhood for symmetric cone optimization
- An \(O(\sqrt{n}L)\) iteration Mehrotra-type predictor-corrector algorithm for monotone linear complementarity problem
- A new Ai-Zhang type interior point algorithm for sufficient linear complementarity problems
- A new wide neighborhood primal-dual second-order corrector algorithm for linear optimization
- A new primal-dual predictor-corrector interior-point method for linear programming based on a wide neighbourhood
- A wide neighborhood primal-dual predictor-corrector interior-point method for symmetric cone optimization
- A new wide neighborhood primal-dual predictor-corrector interior-point method for linear programming
- Large-step interior-point algorithm for linear optimization based on a new wide neighbourhood
- A wide neighborhood interior-point algorithm based on the trigonometric kernel function
- A new second-order corrector interior-point algorithm for \(P_\ast (\kappa)\)-LCP
- A superlinearly convergent wide-neighborhood predictor-corrector interior-point algorithm for linear programming
- Two wide neighborhood interior-point methods for symmetric cone optimization
- A step-truncated method in a wide neighborhood interior-point algorithm for linear programming
- An efficient second-order predictor-corrector infeasible primal-dual IPM algorithm with large iteration path updates for solving well-known SDO problems
- A long-step feasible predictor–corrector interior-point algorithm for symmetric cone optimization
- New complexity analysis of a Mehrotra-type predictor-corrector algorithm for semidefinite programming
- An improved first-order primal-dual algorithm with a new correction step
- A new long-step interior point algorithm for linear programming based on the algebraic equivalent transformation
Uses Software
This page was built for publication: An \(O(\sqrt nL)\) iteration primal-dual second-order corrector algorithm for linear programming
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q644523)
