A predictor-corrector algorithm with multiple corrections for convex quadratic programming
From MaRDI portal
Publication:453603
DOI10.1007/s10589-011-9421-3zbMath1250.90063OpenAlexW2056573259MaRDI QIDQ453603
Zhongyi Liu, Yue Chen, Wen-Yu Sun, Zhi-Hui Wei
Publication date: 27 September 2012
Published in: Computational Optimization and Applications (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10589-011-9421-3
convex quadratic programmingpolynomial complexitypredictor-correctorprimal-dual interior-point method
Related Items (1)
Cites Work
- Unnamed Item
- A new polynomial-time algorithm for linear programming
- Further development of multiple centrality correctors for interior point methods
- Interior path following primal-dual algorithms. II: Convex quadratic programming
- A computational study of the homogeneous algorithm for large-scale convex optimization
- On quadratic convergence of the \(O(\sqrt nL)\)-iteration homogeneous and self-dual linear programming algorithm
- A primal-dual infeasible-interior-point algorithm for linear programming
- Multiple centrality corrections in a primal-dual method for linear programming
- Interior-point solver for large-scale quadratic programming problems with bound constraints
- An infeasible interior-point algorithm with full-Newton step for linear optimization
- A primal-dual interior-point algorithm for quadratic programming
- On the Implementation of a Primal-Dual Interior Point Method
- On Adaptive-Step Primal-Dual Interior-Point Algorithms for Linear Programming
- An O(√nL)-Iteration Homogeneous and Self-Dual Linear Programming Algorithm
- A Predictor-Corrector Algorithm for Linear Optimization Based on a Specific Self-Regular Proximity Function
- SimplifiedO(nL) infeasible interior-point algorithm for linear optimization using full-Newton steps
- An Iterative Solver-Based Infeasible Primal-Dual Path-Following Algorithm for Convex Quadratic Programming
This page was built for publication: A predictor-corrector algorithm with multiple corrections for convex quadratic programming
