Sufficient global optimality conditions for multi-extremal smooth minimization problems with bounds and linear matrix inequality constraints
https://doi.org/10.1017/S1446181100010063Publisher, magazine: ,
Publication year: 2006
Lưu Trích dẫn Chia sẻAbstract
We present sufficient conditions for global optimality of a general nonconvex smooth minimisation model problem involving linear matrix inequality constraints with bounds on the variables. The linear matrix inequality constraints are also known as “semi-definite” constraints which arise in many applications, especially in control system analysis and design. Due to the presence of nonconvex objective functions, such minimisation problems generally have many local minimisers which are not global minimisers. We develop conditions for identifying global minimisers of the model problem by first constructing a (weighted sum of squares) quadratic underestimator for the twice continuously differentiable objective function of the minimisation problem and then by characterising global minimisers of the easily tractable underestimator over the same feasible region of the original problem. We apply the results to obtain global optimality conditions for optimisation problems with discrete constraints
Tags: smooth nonconvex minimisation; global optimality conditions; box constraints; discrete constraints; linear matrix inequalities; multi-extremal problems
Các bài viết liên quan đến tác giả Nguyễn Quang Huy
Remarks on a conjecture of J. Benoist
Global minimization of difference of quadratic and convex functions over box or binary constraints
Unbounded components in the solution sets of strictly quasiconcave vector maximization problems
Global optimality of quadratic minimization over symmetric polytopes
Kuhn-Tucker sufficiency for global minimum of multi-extremal mathematical programming problems
On the Contractibility of the Efficient and Weakly Efficient Sets in R2