A new primal-dual predictor-corrector interior-point method for linear programming based on a wide neighbourhood
From MaRDI portal
Publication:306400
DOI10.1007/s10957-016-0927-9zbMath1344.90037OpenAlexW2324999667MaRDI QIDQ306400
F. Blanchet-Sadri, M. Dambrine
Publication date: 31 August 2016
Published in: Journal of Optimization Theory and Applications (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10957-016-0927-9
Related Items
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 new wide-neighborhood predictor-corrector interior-point method for semidefinite optimization, A wide neighbourhood predictor–corrector infeasible-interior-point algorithm for symmetric cone programming, A wide neighborhood primal-dual predictor-corrector interior-point method for symmetric cone optimization, A wide neighborhood infeasible-interior-point method with arc-search for -SCLCPs
Cites Work
- 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
- Interior path following primal-dual algorithms. II: Convex quadratic programming
- Neighborhood-following algorithms for linear 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
- On Mehrotra-Type Predictor-Corrector Algorithms
- On Adaptive-Step Primal-Dual Interior-Point Algorithms for Linear Programming
- An O$(\sqrtn L)$ Iteration Primal-dual Path-following Method, Based on Wide Neighborhoods and Large Updates, for Monotone LCP
- An easy way to teach interior-point methods.
