Optimality Conditions for the Minimization of a Quadratic with Two Quadratic Constraints
SIAM Journal on Optimization
Conditions for Global Optimality 2
Journal of Global Optimization
Sufficient global optimality conditions for weakly convex minimization problems
Journal of Global Optimization
Journal of Global Optimization
Global optimality conditions for quadratic 0-1 optimization problems
Journal of Global Optimization
Global optimality conditions for cubic minimization problem with box or binary constraints
Journal of Global Optimization
On zero duality gap in nonconvex quadratic programming problems
Journal of Global Optimization
Hi-index | 0.00 |
For the problem of maximizing a convex quadratic function under convex quadratic constraints, we derive conditions characterizing a globally optimal solution. The method consists in exploiting the global optimality conditions, expressed in terms of ε-subdifferentials of convex functions and ε-normal directions, to convex sets. By specializing the problem of maximizing a convex function over a convex set, we find explicit conditions for optimality.