An infeasible-interior-point algorithm for separable convex quadratic programming

MaRDI QIDQ2719670zbMATH OpenFDO

Authors Pusheng Fei, Wei Qiu, Jian Li

Publication date 25 June 2001

Published in Journal of Wuhan University. Natural Science Edition (Search for Journal in Brave)

zbMATH Keywords

polynomial-time algorithm

Mathematics Subject Classification ID

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

Recommendations

• scientific article; zbMATH DE number 2091971
• scientific article; zbMATH DE number 1866539
• An infeasible interior-point algorithm for convex quadratic programming with full-Newton step
• A class of infeasible interior point algorithms for convex quadratic programming
• An Infeasible Mizuno–Todd–Ye Type Algorithm for Convex Quadratic Programming with Polynomial Complexity

Cited in

(4)

• scientific article; zbMATH DE number 2091971 (Why is no real title available?)
• Separable Quadratic Programming via a Primal-Dual Interior Point Method and its Use in a Sequential Procedure
• Linear time algorithms for some separable quadratic programming problems
• scientific article; zbMATH DE number 1866539 (Why is no real title available?)

This page was built for publication: An infeasible-interior-point algorithm for separable convex quadratic programming

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