Solving convex quadratic programming by potential reduction interior-point algorithm

MaRDI QIDQ2748686zbMATH OpenFDO

Authors Ximing Liang, Longhua Ma, Jixin Qian

Publication date 12 February 2002

Published in Journal of Zhejiang University. Science (Search for Journal in Brave)

zbMATH Keywords

convex quadratic programming global convergence numerical experiments point algorithm potential-reduction interior

Mathematics Subject Classification ID

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

Review text

We solve convex quadratic programming by a potential-reduction interior-point algorithm. It is proved that the potential-reduction interior-point algorithm is globally convergent. Some numerical experiments were made.

This page was built for publication: Solving convex quadratic programming by potential reduction interior-point algorithm

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