An infeasible interior-point algorithm for convex quadratic programming with full-Newton step

zbMATH Open1313.90253MaRDI QIDQ2924312FDOQ2924312

Authors: Xiaoyu Gong, Limin Sun, Zhenpeng Hu, Xianjia Wang 

Publication date: 3 November 2014

Published in: Mathematics in Practice and Theory (Search for Journal in Brave)

Recommendations

• An Infeasible Mizuno–Todd–Ye Type Algorithm for Convex Quadratic Programming with Polynomial Complexity
• scientific article; zbMATH DE number 1866539
• An infeasible interior point method for convex quadratic problems
• A class of infeasible interior point algorithms for convex quadratic programming
• scientific article; zbMATH DE number 1094157

zbMATH Keywords

polynomial complexityconvex quadratic programminginfeasible interior-point algorithmfull-Newton step

Mathematics Subject Classification ID

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

Cited In (17)

• An infeasible-interior-point algorithm for separable convex quadratic programming
• Title not available (Why is that?)
• An infeasible interior point method for convex quadratic problems
• An infeasible interior point algorithm for convex quadratic programming based on an algebraic transformation
• Title not available (Why is that?)
• An interior point-proximal method of multipliers for convex quadratic programming
• Newton-KKT interior-point methods for indefinite quadratic programming
• New infeasible interior-point algorithm based on monomial method
• An infeasible interior-point algorithm with full-Newton step for linear optimization
• Convergence of the homotopy path for a full-Newton step infeasible interior-point method
• Title not available (Why is that?)
• A new full-Newton step feasible interior point method for convex quadratic programming
• An Infeasible Mizuno–Todd–Ye Type Algorithm for Convex Quadratic Programming with Polynomial Complexity
• A class of infeasible interior point algorithms for convex quadratic programming
• A quasi-Newton penalty barrier method for convex minimization problems
• An infeasible-start framework for convex quadratic optimization, with application to constraint-reduced interior-point and other methods
• IPRQP: a primal-dual interior-point relaxation algorithm for convex quadratic programming

This page was built for publication: An infeasible interior-point algorithm for convex quadratic programming with full-Newton step

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2924312)