Note on a sufficient condition for a local minimum of a class of nonconvex quadratic programs

DOI10.1007/BF01580090MaRDI QIDQ1290611zbMATH OpenFDO

Authors Susana Scheimberg, Patricia Erthal de Moraes

Publication date 1998

Published in Mathematical Programming. Series A. Series B (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/BF01580090

zbMATH Keywords

counterexamplelocal minimumnonconvex quadratic programssufficient condition

Mathematics Subject Classification ID

Quadratic programming (90C20) Nonconvex programming, global optimization (90C26)

Recommendations

• Necessary and sufficient condition for local minima of a class of nonconvex quadratic programs
• An optimality criterion for global quadratic optimization
• Global and local quadratic minimization

Cites work

• Necessary and sufficient condition for local minima of a class of nonconvex quadratic programs

Cited in

(6)

• Cycling can occur in Mráz's algorithm for nonconvex quadratic programming
• Necessary and sufficient condition for local minima of a class of nonconvex quadratic programs
• A note on a paper by E. Khorram and A. Ghodousian
• Properties of the general quadratic optimization problem and the corresponding linear complementarity problem
• Remarks on solutions to a nonconvex quadratic programming test problem
• A note on ``A new local and global optimization method for mixed integer quadratic programming problems by G.Q. Li et al.

This page was built for publication: Note on a sufficient condition for a local minimum of a class of nonconvex quadratic programs

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