Branch-and-bound method for the minimization problem for a nonconvex quadratic function under convex quadratic constraints

zbMATH Open0962.90035MaRDI QIDQ2713937

O. V. Khamisov, M. S. Nechaeva

Publication date: 10 June 2001

Published in: Diskretnyĭ Analiz i Issledovanie Operatsiĭ. Seriya 2 (Search for Journal in Brave)

zbMATH Keywords

quadratic optimizationglobal optimalityconvex quadratic constraints

Mathematics Subject Classification ID

Quadratic programming (90C20)

Related Items (1)

An Ellipsoidal Branch and Bound Algorithm for Global Optimization

This page was built for publication: Branch-and-bound method for the minimization problem for a nonconvex quadratic function under convex quadratic constraints

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