scientific article; zbMATH DE number 1791165

MaRDI QIDQ4551426zbMATH OpenFDO

Authors Ximing Liang

Publication date 4 February 2003

zbMATH Keywords

convex quadratic programming problemsglobal convergencenumerical examplespotential-reduction interior-point algorithm

Mathematics Subject Classification ID

Numerical mathematical programming methods (65K05) Quadratic programming (90C20) Convex programming (90C25) Interior-point methods (90C51)

Recommendations

• A potential reduction algorithm for linearly constrained convex programming
• An O(n^ 3 L) primal-dual potential reduction algorithm for solving convex quadratic programs
• On some efficient interior point methods for nonlinear convex programming
• scientific article; zbMATH DE number 2059753
• scientific article; zbMATH DE number 1919460

Cited in

(3)

• A potential reduction algorithm for an extended SDP problem
• An interior trust region algorithm for solving linearly constrained nonlinear optimization
• A potential reduction algorithm for linearly constrained convex programming

This page was built for publication:

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