A self-adapt projection contraction method solving large-scale quadratic programming with simple quadratic constraint

MaRDI QIDQ2780890zbMATH OpenFDO

Authors Guolei Hu

Publication date 4 November 2002

Published in Numerical Mathematics (Search for Journal in Brave)

zbMATH Keywords

large scale problemquadratic programmingself-adapt projection contration method

Mathematics Subject Classification ID

Numerical mathematical programming methods (65K05) Large-scale problems in mathematical programming (90C06) Quadratic programming (90C20)

Recommendations

• A projection and contraction method for convex quadratic programming
• scientific article; zbMATH DE number 4204121
• An overview on projection-type methods for convex large-scale quadratic programs
• scientific article; zbMATH DE number 4033492
• A modified projection algorithm for large strictly-convex quadratic programs

Cited in

(5)

• An efficient PGM-based algorithm with backtracking strategy for solving quadratic optimization problems with spherical constraint
• A projection and contraction method for convex quadratic programming
• An overview on projection-type methods for convex large-scale quadratic programs
• scientific article; zbMATH DE number 1839735 (Why is no real title available?)
• A self-adaptive projection and contraction method for optimizing the sum of a convex and a quadratic function

This page was built for publication: A self-adapt projection contraction method solving large-scale quadratic programming with simple quadratic constraint

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