Sufficient conditions for global optimality of semidefinite optimization

In this article, by using the Lagrangian function, we investigate the sufficient global optimality conditions for a class of semi-definite optimization problems, where the objective function are general nonlinear, the variables are mixed integers subject to linear matrix inequalities (LMIs) constraints as well as bounded constraints. In addition, the sufficient global optimality conditions for general nonlinear programming problems are derived, where the variables satisfy LMIs constraints and box constraints or bivalent constraints. Furthermore, we give the sufficient global optimality conditions for standard semi-definite programming problem, where the objective function is linear, the variables satisfy linear inequalities constraints and box constraints.Mathematics Subject Classification 2010: 90C30; 90C26; 90C11.


Introduction
As we know semi-definite programming (SDP) can be viewed as a natural extension of linear programming where the componentwise inequalities between vectors are replaced by matrix inequalities. The SDP has many important applications in systems and control theory [1] and combinatorial optimization [2][3][4]. Many survey articles such as [1,[5][6][7] featured various applications of SDP and algorithmic aspects. With the development of optimization software, more and more problems are modeled as SDP problems. SDP became one of the basic modeling and optimization tools along with linear and quadratic programming.
Recently, many researchers focused on characterizing the global minimizer of many mathematical programming problems. Beck and Teboulle [8] have established a necessary global optimality condition for nonconvex quadratic optimization problems with binary constrains. Jeyakumar et al. [9] have given Lagrange multiplier conditions for global optimality of general quadratic minimization problems with quadratic constraints. Jeyakumar et al. [10] have obtained sufficient global optimality conditions for a quadratic minimization problem subject to box constraints or binary constraints. Jeyakumar et al. [11] have established some necessary and sufficient conditions for a given feasible point to be a global minimizer of some minimization problems with mixed variables. Wu and Bai [12] have given some global optimality conditions for mixed quadratic programming problems, their approach is based on L-subdifferential and L-normal cone. Especially Jeyakumar and Wu [13] have presented sufficient conditions for global optimality of non-convex quadratic programs involving linear matrix inequality (LMI) constraints by using Lagrangian function and by examining conditions which minimizes a quadratic subgradient of the Lagrangian function over simple bounding constraints. Jeyakumar [14] have obtained some necessary and sufficient constraint qualifications (CQs) for the strong duality in convex semidefinite optimization.
In this article, we consider the following semidefinite optimization model problem: .., n), u i , v i R and u i <v i for any i M, p j , q j are integers and p j <q j for all j N; f : R n R are twice continuously differentiable functions on an open subset of R n containing set {x R n |x i [u i ,v i ],i M; x j [p j , q j ], j N}. For k = 0, 1, 2,..., n, F k S m , the space of symmetric (m × m) matrices with the trace inner product and ≽ denotes the Löwner partial order of S m , that is, for A, B S m , A ≽ B if and only if (A -B) is positive semidefinite. Such semidefinite optimization model problem has been intensely studied in the last 10 years since it arose from control system analysis and design. Interested reader may refer to [15,16]. The convex semidefinite optimization model problem has been studied in [14,16,17] for it's valuable numerical and modeling tool for system and control theory.
The purpose of this article is to present some sufficient global optimality condition for a given feasible point to be a global minimizer of programming problems (SDP f ) with nonlinear objects. We develop the sufficient global optimality conditions for nonlinear programming problem (SDP f ) with LMI and bounded constraints of mixed integer variables by using the Lagrangian function. We also deduce the sufficient global optimality conditions for nonlinear programs with LMI and box constraints or bivalent constraints which are the extended results beyond [13], as well as the sufficient global optimality conditions for standard SDP problem (SDP), where the objective function is linear, the variables satisfy LMIs constraints and box constraints.

Preliminaries and notations
Firstly we present some notations that will be used throughout this article. The real line is denoted by R and the n-dimensional Euclidean space is denoted by R n . For vectors x, y R n , x ≥ y means that x k ≥ y k , for k = 1,..., n. The notation A ≽ B means A -B is a positive semidefinite and A ≼ O means -A ≽ O. A diagonal matrix with diagonal elements a 1 ,...,a n is denoted by diag(a 1 ,...,a n ). We let is the trace operation. The dual cone of S is denoted by where Z S m . Forx ∈ and any i M, j N, we let diag(a 1 , a 2 ,...,a n )bea diagonal matrix in S n . LetG = diag (α 1 , ...,α n ) , wherẽ 3 Sufficient global optimality conditions for (SDP f ) In this section, we will derive the sufficient global optimality conditions for problem (SDPf). Theorem 3.1 (Sufficient global optimality conditions for (SDP f )) For the problem So we have If l(x) − l(x) ≥ 0, ∀x Ω, thenx is a global minimizer of (SDP f ). In the following, we prove if condition diag(bx) 1 2G hold, then for any k = 1,..., n, hold, thus we have i.e.x is a global minimizer of (SDP f ). We consider the following cases: 1°. Ifx i = u i , then (2) is equivalent to 2°. Ifx i = v i , then (2) is equivalent to 4°. Ifxj = p j , then (2) is equivalent to 5°. Ifxj = q j , then (2) is equivalent to By the above discussion, we know that if condition diag (bx) 1 2G hold, then for any k = 1,...,n, 1 2 is a global minimizer of (SDP f ). If f(x) is convex, then we have the following results. Then we consider the following special cases. At first consider the following minimization problem with LMI and box constraints: If there exist Z ≽ O such that Tr ZF(x) = 0and a diagonal matrix G = diag(a 1 , a 2 , ..., a n ) S n such that Remark 3.1 This is just the result of [13, Theorem 3.1] when f (x) = 1 2 x T Ax + a T x . In the second we consider the following minimization problem with LMI and bivalent constraints: From the proof of Theorem3.1, we know if there exists a diagonal matrix G = diag(a 1 ,a 2 , ...,a n ) S n such that x is a global minimizer of SDP" f .  x T Ax + a T x .

Sufficient global optimality conditions for (SDP)
Consider the following standard SDP problem, where the objective function is linear, the variables satisfy linear inequalities constraints and box constraints: If there exist Z ≽ O such that Tr ZF(x) = 0and a diagonal matrix G = diag(a 1 ,a 2 , ..., a n ) S n such that ..,n hold, thenx is a global minimizer of (SDP).
Proof. Obviously we have ∇ 2 f(x) = O for all x ∈ n k=1 [u k , v k ] by the reason of f (x) = n k=1 c k x k , so we can get this result from Theorem 3.2.