Global optimality of quadratic minimization over symmetric polytopes
https://doi.org/10.1080/02331930701617395Publisher, magazine: ,
Publication year: 2007
Lưu Trích dẫn Chia sẻAbstract
We establish necessary as well as sufficient conditions for a feasible point to be a global minimizer of a quadratic function over a symmetric polytope. We also show that the necessary condition becomes necessary and sufficient for global optimality in the special case where the matrices are involved diagonal matrices. Sufficient conditions are obtained by way of simple quadratic underestimation. Examples are discussed to illustrate the optimality conditions.
Tags: quadratic nonconvex minimization; Symmetric polytopes; Necessary optimality conditions; Sufficient conditions; Box constraints
Các bài viết liên quan đến tác giả Jeya Jeyakumar
Global minimization of difference of quadratic and convex functions over box or binary constraints
Convex composite non-Lipschitz programming
Sharp variational conditions for convex composite nonsmooth functions
An open mapping theorem using unbounded generalized Jacobians
Sequential Lagrangian conditions for convex programs with applications to semidefinite programming
Nonsmooth calculus, minimality, and monotonicity of convexificators
Global optimality of quadratic minimization over symmetric polytopes