A New Wide Neighborhood Primal-Dual Predictor-Corrector Interior-Point Method for Linear Programming
From MaRDI portal
Publication:3188443
DOI10.1080/01630563.2016.1138128zbMath1346.90578OpenAlexW2408880050MaRDI QIDQ3188443
No author found.
Publication date: 19 August 2016
Published in: Numerical Functional Analysis and Optimization (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1080/01630563.2016.1138128
Related Items (2)
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 wide neighborhood infeasible-interior-point method with arc-search for -SCLCPs
Cites Work
- 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. I: 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
- An O$(\sqrtn L)$ Iteration Primal-dual Path-following Method, Based on Wide Neighborhoods and Large Updates, for Monotone LCP
- Unnamed Item
- Unnamed Item
This page was built for publication: A New Wide Neighborhood Primal-Dual Predictor-Corrector Interior-Point Method for Linear Programming
