A predictor-corrector algorithm with multiple corrections for convex quadratic programming

DOI10.1007/S10589-011-9421-3MaRDI QIDQ453603zbMATH OpenOpenAlexFDO

Authors Zhongyi Liu, Yue Chen, Wenyu Sun, Zhihui 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

zbMATH Keywords

polynomial complexitypredictor-correctorconvex quadratic programmingprimal-dual interior-point method

Mathematics Subject Classification ID

Quadratic programming (90C20) Convex programming (90C25) Interior-point methods (90C51)

Recommendations

• A polynomial predictor-corrector interior-point algorithm for convex quadratic programming
• scientific article; zbMATH DE number 766486
• scientific article; zbMATH DE number 822140
• scientific article; zbMATH DE number 1526551
• scientific article; zbMATH DE number 1919460

Cites work

• scientific article; zbMATH DE number 1017028 (Why is no real title available?)
• A Predictor-Corrector Algorithm for Linear Optimization Based on a Specific Self-Regular Proximity Function
• A computational study of the homogeneous algorithm for large-scale convex optimization
• A new polynomial-time algorithm for linear programming
• A primal-dual infeasible-interior-point algorithm for linear programming
• A primal-dual interior-point algorithm for quadratic programming
• An Iterative Solver-Based Infeasible Primal-Dual Path-Following Algorithm for Convex Quadratic Programming
• An O(√nL)-Iteration Homogeneous and Self-Dual Linear Programming Algorithm
• An infeasible interior-point algorithm with full-Newton step for linear optimization
• Further development of multiple centrality correctors for interior point methods
• Interior path following primal-dual algorithms. II: Convex quadratic programming
• Interior-point solver for large-scale quadratic programming problems with bound constraints
• Multiple centrality corrections in a primal-dual method for linear programming
• On Adaptive-Step Primal-Dual Interior-Point Algorithms for Linear Programming
• On quadratic convergence of the \(O(\sqrt nL)\)-iteration homogeneous and self-dual linear programming algorithm
• On the Implementation of a Primal-Dual Interior Point Method
• SimplifiedO(nL) infeasible interior-point algorithm for linear optimization using full-Newton steps

Cited in

(12)

• Higher-Order Predictor-Corrector Interior Point Methods with Application to Quadratic Objectives
• A predictor--corrector algorithm for QSDP combining Dikin-type and Newton centering steps
• scientific article; zbMATH DE number 2070508 (Why is no real title available?)
• scientific article; zbMATH DE number 1919460 (Why is no real title available?)
• A predictor-corrector method for extended linear-quadratic programming
• scientific article; zbMATH DE number 1744779 (Why is no real title available?)
• A wide-neighborhood predictor-corrector algorithm for convex quadratic programming
• scientific article; zbMATH DE number 822140 (Why is no real title available?)
• A polynomial predictor-corrector interior-point algorithm for convex quadratic programming
• A polynomial predictor-corrector interior-point algorithm for a class convex programming
• scientific article; zbMATH DE number 1526551 (Why is no real title available?)
• An exterior point polynomial-time algorithm for convex quadratic programming

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)