A wide neighborhood arc-search interior-point algorithm for convex quadratic programming
From MaRDI portal
Publication:3176174
DOI10.1007/s11859-017-1274-xzbMath1399.90293OpenAlexW2767354562MaRDI QIDQ3176174
Ming Wang Zhang, Zhengwei Huang, Beibei Yuan
Publication date: 18 July 2018
Published in: Wuhan University Journal of Natural Sciences (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s11859-017-1274-x
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- A wide neighborhood infeasible-interior-point method with arc-search for linear programming
- A polynomial arc-search interior-point algorithm for linear programming
- A polynomial arc-search interior-point algorithm for convex quadratic programming
- A new polynomial-time algorithm for linear programming
- An extension of Karmarkar's projective algorithm for convex quadratic programming
- Interior path following primal-dual algorithms. II: Convex quadratic programming
- Long-step strategies in interior-point primal-dual methods
- Improved complexity using higher-order correctors for primal-dual Dikin affine scaling
- On polynomiality of the Mehrotra-type predictor-corrector interior-point algorithms
- An arc-search infeasible-interior-point method for symmetric optimization in a wide neighborhood of the central path
- An \(O(n^ 3L)\) primal interior point algorithm for convex quadratic programming
- A modified infeasible interior-point algorithm for P*(κ)-HLCP over symmetric cones
- A Polynomial-Time Primal-Dual Affine Scaling Algorithm for Linear and Convex Quadratic Programming and Its Power Series Extension
- An Asymptotical $O(\sqrt{n} L)$-Iteration Path-Following Linear Programming Algorithm That Uses Wide Neighborhoods
This page was built for publication: A wide neighborhood arc-search interior-point algorithm for convex quadratic programming
