A predictor-corrector algorithm with multiple corrections for convex quadratic programming
From MaRDI portal
Publication:453603
DOI10.1007/S10589-011-9421-3zbMATH Open1250.90063OpenAlexW2056573259MaRDI QIDQ453603FDOQ453603
Wenyu Sun, Zhongyi Liu, Zhihui Wei, Yue Chen
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
Recommendations
polynomial complexitypredictor-correctorconvex quadratic programmingprimal-dual interior-point method
Cites Work
- On the Implementation of a Primal-Dual Interior Point Method
- A new polynomial-time algorithm for linear programming
- An infeasible interior-point algorithm with full-Newton step for linear optimization
- On Adaptive-Step Primal-Dual Interior-Point Algorithms for Linear Programming
- Title not available (Why is that?)
- A Predictor-Corrector Algorithm for Linear Optimization Based on a Specific Self-Regular Proximity Function
- An O(√nL)-Iteration Homogeneous and Self-Dual Linear Programming Algorithm
- 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
- A primal-dual infeasible-interior-point algorithm for linear programming
- Multiple centrality corrections in a primal-dual method for linear programming
- A primal-dual interior-point algorithm for quadratic programming
- 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
- On quadratic convergence of the \(O(\sqrt nL)\)-iteration homogeneous and self-dual linear programming algorithm
- Interior-point solver for large-scale quadratic programming problems with bound constraints
Cited In (9)
- A predictor--corrector algorithm for QSDP combining Dikin-type and Newton centering steps
- Title not available (Why is that?)
- Title not available (Why is that?)
- A predictor-corrector method for extended linear-quadratic programming
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- An exterior point polynomial-time algorithm for convex quadratic programming
- Higher-Order Predictor-Corrector Interior Point Methods with Application to Quadratic Objectives
This page was built for publication: A predictor-corrector algorithm with multiple corrections for convex quadratic programming
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q453603)
