Non-convex quadratic minimization problems with quadratic constraints: global optimality conditions

In this paper, we first examine how global optimality of non-convex constrained optimization problems is related to Lagrange multiplier conditions. We then establish Lagrange multiplier conditions for global optimality of general quadratic minimization problems with quadratic constraints. We also ob...

Full description

Saved in:

Bibliographic Details
Published in:	Mathematical programming Vol. 110; no. 3; pp. 521 - 541
Main Authors:	Jeyakumar, V., Rubinov, A. M., Wu, Z. Y.
Format:	Journal Article
Language:	English
Published:	Heidelberg Springer 01.09.2007 Springer Nature B.V
Subjects:	Applied mathematics Applied sciences Constraints Convex analysis Exact sciences and technology Information technology Lagrange multiplier Mathematical functions Mathematical programming Operational research and scientific management Operational research. Management science Optimization Quadratic programming Studies Non convex programming Quadratic inequality constraints Non-convex quadratic minimization Constraint satisfaction Minimization Global optimum Quadratic programming Binary constraints Convex programming Constrained optimization Lagrange multiplier Global optimality conditions Least squares method Lagrange multipliers Inequality constraint Optimality condition Optimality criterion Ellipsoid Non convex analysis Mathematical programming
ISSN:	0025-5610, 1436-4646
Online Access:	Get full text
Tags:	Add Tag No Tags, Be the first to tag this record!

Be the first to leave a comment!