Abstract
This paper is devoted to global optimality conditions for quadratic optimization problems in a real space of dimension n. More precisely, we are concerned with nonconvex quadratic optimization problems with linear constraints. We present some sufficient conditions of global optimality for such problems subject to linear equality and inequality constraints. We prove that when the set of Karush-Kuhn-Tucker triplets of this problem is convex, then a local minimizer is global
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have