
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.
T57-57.97, Applied mathematics. Quantitative methods, global optimality conditions, convex sets, linear constraints, Quadratic programming, Optimality conditions and duality in mathematical programming, nonconvex quadratic optimization, Nonconvex programming, global optimization
T57-57.97, Applied mathematics. Quantitative methods, global optimality conditions, convex sets, linear constraints, Quadratic programming, Optimality conditions and duality in mathematical programming, nonconvex quadratic optimization, Nonconvex programming, global optimization
| selected citations These citations are derived from selected sources. This is an alternative to the "Influence" indicator, which also reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically). | 0 | |
| popularity This indicator reflects the "current" impact/attention (the "hype") of an article in the research community at large, based on the underlying citation network. | Average | |
| influence This indicator reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically). | Average | |
| impulse This indicator reflects the initial momentum of an article directly after its publication, based on the underlying citation network. | Average |
