A new wide neighborhood primal-dual second-order corrector algorithm for linear optimization
From MaRDI portal
Publication:2228364
DOI10.1007/s11590-019-01468-zzbMath1459.90125OpenAlexW2969737233MaRDI QIDQ2228364
Petra Renáta Rigó, Zsolt Darvay, Behrouz Kheirfam
Publication date: 17 February 2021
Published in: Optimization Letters (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s11590-019-01468-z
Related Items (3)
An O(r(cond(G))1/4log¼ϵ−1) iteration predictor–corrector interior-point method with a new one-norm neighbourhood for symmetric cone optimization ⋮ A step-truncated method in a wide neighborhood interior-point algorithm for linear programming ⋮ A wide neighbourhood primal-dual second-order corrector interior point algorithm for semidefinite optimization
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- An \(O(\sqrt nL)\) iteration primal-dual second-order corrector algorithm for linear programming
- A new polynomial-time algorithm for linear programming
- A unified approach to interior point algorithms for linear complementarity problems: A summary
- Aspects of semidefinite programming. Interior point algorithms and selected applications
- Large-step interior-point algorithm for linear optimization based on a new wide neighbourhood
- A superlinearly convergent predictor-corrector method for degenerate LCP in a wide neighborhood of the central path with \(O(\sqrt nL)\)-iteration complexity
- A new second-order corrector interior-point algorithm for semidefinite programming
- A New Iteration Large-Update Primal-Dual Interior-Point Method for Second-Order Cone Programming
- A New Class of Large Neighborhood Path-Following Interior Point Algorithms for Semidefinite Optimization with $O(\sqrt{n}\log\frac{\mathrm{Tr}(X^0S^0)}{\epsilon})$ Iteration Complexity
- An O(√nL)-Iteration Homogeneous and Self-Dual Linear Programming Algorithm
- A Predictor-corrector Infeasible-interior-point Algorithm for Semidefinite Optimization in a Wide Neighborhood
- A Wide Neighborhood Second-order Predictor-corrector Interior-point Algorithm for Semidefinite Optimization with Modified Corrector Directions
- Interior Point Methods for Sufficient Horizontal LCP in a Wide Neighborhood of the Central Path with Best Known Iteration Complexity
- A new second-order corrector interior-point algorithm for P*(k)-LCP
- An O$(\sqrtn L)$ Iteration Primal-dual Path-following Method, Based on Wide Neighborhoods and Large Updates, for Monotone LCP
- Handbook of semidefinite programming. Theory, algorithms, and applications
- An easy way to teach interior-point methods.
This page was built for publication: A new wide neighborhood primal-dual second-order corrector algorithm for linear optimization
