Open Access

Sufficient conditions for global optimality of semidefinite optimization

Journal of Inequalities and Applications20122012:108

https://doi.org/10.1186/1029-242X-2012-108

Received: 5 February 2012

Accepted: 18 May 2012

Published: 18 May 2012

Abstract

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.

1 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 [24]. Many survey articles such as [1, 57] 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:
( SD P f ) min x R n f ( x ) s . t . F 0 + k = 1 n F k x k O , x i [ u i , v i ] , i M , x j { p j , p j + 1 , . . . , q j } , j N

where M N = , M N = {1,..., 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.

2 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 , xy 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 α1,...,α n is denoted by diag(α1,...,α n ). We let U = {x = (x1,..., x n ) T | x i [u i , v i ], i M, x j {p j , p j + 1,...,q j }, j N}; The feasible set Ω of (SDP f ) is given by Ω = UF-1(S), where S = {M S m |M O} is the closed convex cone of positive semidefinite (m × m) matrices, F-1(S) := {x R n |F(x) O} and F ( x ) : = F 0 + k = 1 n F k x k . The inner product in S m is defined by (N 1, N 2) = Tr[N 1 N 2], where Tr[·] is the trace operation. The dual cone of S is denoted by S+ := {θ S m |(θ, Z) ≥ 0, Z S}, then S+ = S. Let F ^ ( x ) = k = 1 n x k F k , x = (x1,...,x n ) R n , then F ^ is a linear operator from R n to S m and its dual is defined by F * ^ ( Z ) = Tr [ F 1 Z ] , . . . , Tr [ F n Z ] T for any Z S. The Lagrangian function of (SDP f ) is defined as
H Z ( x ) : = f ( x ) - F ^ * ( Z ) T x - Tr [ Z F 0 ] ,
where Z S m . For x ̄ Ω and any i M, j N, we let
x ̄ ̃ i : = - 1 , if x ̄ i = u i 1 , if x ̄ i = v i sign ( f ( x ̄ ) - F ^ * ( Z ) ) i , if u i < x ̄ i < v i , x ̄ ̃ j : = - 1 , if x ̄ j = p j 1 , if x ̄ j = q j sign ( f ( x ̄ ) - F ^ * ( Z ) ) j , if p j < x ̄ j < q j ,
X ̄ ̃ = diag x ̄ ̃ 1 , . . . , x ̄ ̃ n , b x ̄ i : = x ̄ ̃ i f ( x ̄ ) - F ^ * ( Z ) i v i - u i b x ̄ j : = max x ̄ ̃ j f ( x ̄ ) - F ^ * ( Z ) j 1 , x ̄ ̃ j f ( x ̄ ) - F ^ * Z j q j - p j , b x ̄ : = b x ̄ 1 , . . . , b x ̄ n T ,
where sign f ( x ̄ ) - F ^ * Z k = - 1 , f ( x ̄ ) - F ^ * Z k < 0 0 , f ( x ̄ ) - F ^ * Z k = 0 1 , f ( x ̄ ) - F ^ * Z k > 0 , , k = 1 , 2 , . . . , n . Let G = diag(α1, α2,...,α n )bea diagonal matrix in S n . Let G ̃ = diag α ̃ 1 , . . . , α ̃ n , where α ̃ i = min { 0 , α i } for i M; α ̃ j = α j for j N and let
Ū = x R n | x i [ u i , v i ] , i M ; x j [ p j , q j ] , j N .

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 (SDP f ), let x ̄ Ω . If there exist Z O such that Tr Z F ( x ̄ ) = 0 and a diagonal matrix G = diag(α1,α2, ...,α n ) S n such that 2f(x) - G O for each x Ū and condition diag b x ̄ 1 2 G ̃ hold, then x ̄ is a global minimizer of (SDP f ).

Proof. Let l ( x ) = 1 2 x T G x + f ( x ̄ ) - F ^ * Z - G x ̄ T x , x R n , and ϕ(x) = H Z (x) -l(x), x Ū . Then we have that 2ϕ(x) = 2f(x) - 2l(x) = 2f(x) -G O, x Ū . Thus ϕ (x) is convex on Ū , and ϕ ( x ̄ ) = H Z ( x ̄ ) - l ( x ̄ ) = 0 . So we get that ϕ ( x ) ϕ ( x ̄ ) , x Ū and H Z ( x ) - H Z ( x ̄ ) l ( x ) - l ( x ̄ ) holds. As Tr[ZF(x)] ≥ 0,x F-1(S), Tr Z F ( x ̄ ) = 0 , we have
f ( x ) - f ( x ̄ ) f ( x ) - Tr Z F ( x ) - f ( x ̄ ) + Tr Z F ( x ̄ ) = H Z ( x ) - H Z ( x ̄ ) , l ( x ) - l ( x ̄ ) , x F - 1 ( S ) .
So we have
f ( x ) - f ( x ̄ ) l ( x ) - l ( x ̄ ) , x Ω ,
where
l ( x ) - l ( x ̄ ) = k = 1 n 1 2 α k x k - x ̄ k 2 + f ( x ̄ ) - F ^ * ( Z ) k x k - x ̄ k .
(1)
If l ( x ) - l ( x ̄ ) 0 , x Ω, then x ̄ is a global minimizer of (SDP f ). In the following, we prove if condition diag ( b x ̄ ) 1 2 G ̃ hold, then for any k = 1,..., n,
1 2 α k x k - x ̄ k 2 + f ( x ̄ ) - F ^ * Z k x k - x ̄ k 0 , for any x Ω .
(2)
hold, thus we have
k = 1 n 1 2 α k x k - x ̄ k 2 + f ( x ̄ ) - F ^ * Z k x k - x ̄ k 0 , for any x Ω .
(3)

i.e. x ̄ is a global minimizer of (SDP f ). We consider the following cases:

1°. If x ̄ i = u i , then (2) is equivalent to
1 2 α i x i - x ̄ i + f ( x ̄ ) - F * ^ Z i 0 , for any x i u i , v i f ( x ̄ ) - F * ^ ( Z ) i 0 , if α i 0 f ( x ̄ ) - F * ^ ( Z ) i - ( v i - u i ) α i 2 , if α i < 0 x ̄ ̃ i f ( x ̄ ) - F * ^ Z i min 0 , ( v i - u i ) α i 2 .
2°. If x ̄ i = v i , then (2) is equivalent to
1 2 α i x i - x ̄ i + f ( x ̄ ) - F ^ * Z i 0 , for any x i u i , v i f ( x ̄ ) - F ^ * ( Z ) i 0 , if α i 0 f ( x ̄ ) - F ^ * ( Z ) i - ( v i - u i ) α i 2 , if α i < 0 x ̄ ̃ i f ( x ̄ ) - F ^ * Z i min 0 , ( v i - u i ) α i 2 .
3°. If u i < x ̄ i < v i , then (2) is equivalent to
1 2 α i ( x i - x ̄ i ) + f ( x ̄ ) - F ^ * Z i 0 , for any x i x ̄ i , v i 1 2 α i ( x i - x ̄ i ) + f ( x ̄ ) - F ^ * Z i 0 , for any x i u i , x ̄ i f ( x ̄ ) - F ^ * Z i = 0 , α i 0 x ̄ ̃ i f ( x ̄ ) - F ^ * Z i min 0 , v i - u i α i 2 .
4°. If x ̄ j = p j , then (2) is equivalent to
1 2 α j x j - x ̄ j + f ( x ̄ ) - F ^ * Z j 0 , for any x j p j + 1 , p j + 2 , . . . , q j f ( x ̄ ) - F ^ * ( Z ) j - α j 2 , if α j 0 f ( x ̄ ) - F ^ * ( Z ) j - ( q j - p j ) α j 2 , if α j < 0 x ̄ j ̃ f ( x ̄ ) - F ^ * Z j min α j 2 , ( q j - p j ) α j 2 .
5°. If x ̄ j = q j , then (2) is equivalent to
1 2 α j x j - x ̄ j + f ( x ̄ ) - F ^ * Z j 0 , for any x j p j p j + 1 , . . . , q j - 1 f ( x ̄ ) - F ^ * ( Z ) j α j 2 , if α j 0 f ( x ̄ ) - F ^ * ( Z ) j - ( q j - p j ) α j 2 , if α j < 0 x ̄ j ̃ f ( x ̄ ) - F ^ * Z j min α j 2 , ( q j - p j ) α j 2 .
6°. If x ̄ j p j + 1 , . . . , q j - 1 , then (2) is equivalent to
1 2 α j ( x j - x ̄ j ) + f ( x ̄ ) - F ^ * Z j 0 , for any x j p j , . . . , x ̄ j - 1 1 2 α j ( x j - x ̄ j ) + f ( x ̄ ) - F ^ * Z j 0 , for any x j x ̄ j + 1 , . . . , q j - α j 2 f ( x ̄ ) - F ^ * Z j α j 2 , α j 0 x ̄ ̃ j f ( x ̄ ) - F ^ * Z j min α j 2 , q j - p j α j 2 .

By the above discussion, we know that if condition diag b x ̄ 1 2 G ̃ hold, then for any k = 1,...,n, 1 2 α k x k - x ̄ k 2 + f ( x ̄ ) - F ^ * Z k x k - x ̄ k 0 , for any x Ω., i.e. x ̄ is a global minimizer of (SDP f ).

If f(x) is convex, then we have the following results.

Corollary 3.1 For the problem (SDP f ), let x ̄ Ω . If f is convex on Ū and there exist Z O such that Tr Z F ( x ̄ ) = 0 and condition diag b x ̄ O hold, then x ̄ is a global minimizer of (SDP f ).

Proof. We can get the results from the proof of Theorem 3.1 by taken G = O.

Then we consider the following special cases. At first consider the following minimization problem with LMI and box constraints:
( SD P' f ) min x R n f ( x ) s . t . F 0 + k = 1 n F k x k O , x k = 1 n [ u k , v k ] .

Theorem 3.2 For the problem SD P' f , let x ̄ F - 1 ( S ) k = 1 n u k , v k . If there exist Z O such that Tr Z F ( x ̄ ) = 0 and a diagonal matrix G = diag(α1, α2, ..., α n ) S n such that 2f(x)-G O for each x k = 1 n u k , v k and condition 1 2 α ̃ k v k - u k - x ̄ ̃ k f ( x ̄ ) - F ^ * Z k 0 hold, then x ̄ is a global minimizer of SD P' f .

Remark 3.1 This is just the result of [13, Theorem 3.1] when f ( x ) = 1 2 x T A x + a T x .

In the second we consider the following minimization problem with LMI and bivalent constraints:
( SD P" f ) min x R n f ( x ) s . t . F 0 + k = 1 n F k x k O , x k = 1 n { - 1 , 1 } .

Theorem 3.3 For the problem SD P" f , let x ̄ F - 1 ( S ) i = 1 n { - 1 , 1 } . If there exist Z O such that Tr Z F ( x ̄ ) = 0 and 2 f ( x ) - diag X ̄ ̃ f x ̄ - F ^ * Z O for each x k = 1 n [ - 1 , 1 ] hold, then x ̄ is a global minimizer of SD P" f .

Proof. From the proof of Theorem3.1, we know if there exists a diagonal matrix G = diag(α1,α2, ...,α n ) S n such that 2f(x) - G O on k = 1 n [ - 1 , 1 ] and l ( x ) - l ( x ̄ ) 0 hold for each x k = 1 n { - 1 , 1 } , where l ( x ) = 1 2 x T G x + f ( x ̄ ) - F ^ * Z - G x ̄ T x , then x ̄ is a global minimizer of SD P" f .

Suppose condition 2 f ( x ) - diag X ̄ ̃ f x ̄ - F ^ * Z O hold on k = 1 n [ - 1 , 1 ] , we let α k = x ̄ ̃ k f ( x ̄ ) - F ^ * Z k , then we have 2f(x) -G O. For each k = 1, 2,..., n and each x k = 1 n { - 1 , 1 } , we only have x k = x ̄ k or x k = - x ̄ k . Obviously If x k = x ̄ k , then we have
l ( x ) - l ( x ̄ ) = k = 1 n 1 2 α k x k - x ̄ k 2 + f ( x ̄ ) - F ^ * Z k x k - x ̄ k = 0 .
if x k = - x ̄ k , then we have
1 2 α k x k - x ̄ k 2 + f ( x ̄ ) - F ^ * Z k x k - x ̄ k = 2 α k x ̄ k 2 - 2 f ( x ̄ ) - F ^ * Z k x ̄ k = 2 α k - f ( x ̄ ) - F ^ * Z k x ̄ ̃ k = 0 ,
so we get
l ( x ) - l ( x ̄ ) = k = 1 n 1 2 α k x k - x ̄ k 2 + f ( x ̄ ) - F ^ * Z k x k - x ̄ k = 0 .

That is for each x k = 1 n { - 1 , 1 } , l ( x ) - l ( x ̄ ) = 0 .

Remark 3.2 This is just the result of [13, Theorem 4.1] when f ( x ) = 1 2 x T A x + a T x .

Example 3.1 Consider the following programming problem with LMI and bivalent constraints:
( E X P 1 ) min f ( x ) : = 2 3 x 1 3 - x 1 2 + 2 x 2 2 + x 1 x 2 - x 2 s . t . F 0 + k = 1 2 x k F k O , x k = 1 2 { - 1 , 1 } ,

Where F 0 = 3 2 0 2 1 0 0 0 1 , F 1 = 0 1 0 1 0 0 0 0 1 , F 2 = 1 0 0 0 1 0 0 0 1 . .

We can check the point x ̄ = - 1 , 1 T satisfies the sufficient global optimization conditions of SD P" f . Since F ( x ) = 3 + x 2 2 + x 1 0 2 + x 1 1 + x 2 0 0 0 1 + x 1 + x 2 , F ( x ̄ ) = 4 1 0 1 2 0 0 0 1 . Let Z = 1 - 3 0 - 3 2 0 0 0 - 2 , and Tr Z F ( x ̄ ) = 0 . We can get f ( x ) = 2 x 1 2 - 2 x 1 + x 2 , 4 x 2 + x 1 - 1 T , f ( x ̄ ) = ( 5 , 2 ) T , X ̄ ̃ f ( x ̄ ) - F ^ * Z = ( - 13 , 1 ) T so 2 f ( x ) - diag X ̄ ̃ f x ̄ - F ^ * Z = 4 x 1 - 2 + 13 1 1 4 - 1 O for any x1 [-1,1]. So (-1,1) T is the global minimizer of (EXP 1).

In fact from Ω = x k = 1 2 { - 1 , 1 } | F 0 + k = 1 2 x k F k O = - 1 , - 1 , ( 1 , 1 ) , ( - 1 , 1 ) , we can easily check that (-1,1) T is the global minimizer of (EXP 1).

4 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:
( SDP ) min x R n f ( x ) = k = 1 n c k x k s . t . F 0 + i = 1 n F k x k O , x k = 1 n [ u k , v k ] .

Theorem 4.1 For the problem (SDP), let x ̄ F - 1 ( S ) k = 1 n [ u k , v k ] . If there exist Z O such that Tr Z F ( x ̄ ) = 0 and a diagonal matrix G = diag(α1,α2, ..., α n ) S n such that -G O for each x k = 1 n u k , v k and condition 1 2 α ̃ k v k - u k - x ̄ ̃ k c k - F ^ * Z k 0 , k = 1, 2,...,n hold, then x ̄ is a global minimizer of (SDP).

Proof. Obviously we have 2f(x) = O for all x k = 1 n u k , v k by the reason of f ( x ) = k = 1 n c k x k , so we can get this result from Theorem 3.2.

Theorem 4.2 For the problem (SDP), let x ̄ F - 1 ( S ) k = 1 n [ u k , v k ] . If there exist Z O such that Tr Z F ( x ̄ ) = 0 and condition - x ̄ ̃ k c k - F ^ * Z k 0 , k = 1,2,...,n hold, then x ̄ is a global minimizer of (SDP).

Proof. Let G = O for all x k = 1 n u k , v k , then the condition -G O for each x k = 1 n u k , v k in Theorem 4.1 is met, so we can get this result from Theorem 4.1.

Example 4.1 Consider the following programming problem with LMI and box constraints:
( E X P 2 ) min f ( x ) : = 3 x 1 - 2 x 2 s . t . F 0 + k = 1 2 x k F k O , x k = 1 2 [ - 1 , 1 ] .

Where F 0 = 3 2 0 2 1 0 0 0 1 , F 1 = 0 1 0 1 0 0 0 0 1 , F 2 = 1 0 0 0 1 0 0 0 1 , c = ( 3 , - 2 ) T . .

We can check the point x ̄ = ( - 1 , 1 ) T satisfies the sufficient global optimization conditions of (SDP). Since F ( x ) = 3 + x 2 2 + x 1 0 2 + x 1 1 + x 2 0 0 0 1 + x 1 + x 2 , F ( x ̄ ) = 4 1 0 1 2 0 0 0 - 1 . Let Z = 1 - 3 0 - 3 2 0 0 0 - 2 , and Tr Z F ( x ̄ ) = 0 Tr[ZF1] = -8, Tr[ZF2] = 1. We can get x ̄ ̃ 1 ( c - F ^ * ( Z ) ) 1 = ( - 1 ) × ( 3 - ( - 4 ) ) = - 7 < 0 ; x ̄ ̃ 2 ( c - F ^ * ( Z ) ) 2 = ( 1 ) × ( ( - 2 ) - 5 ) = - 7 < 0 . So (-1,, 1) T is the global minimizer of (EXP 2).

Declarations

Acknowledgements

The authors are grateful to the referees for their careful reading and noting several misprints, and their helpful and useful comments. This research is partially supported by the National Natural Science Foundation of China (No. 10971241) and by the National Research Foundation of Yibin University (No. 2011B07).

Authors’ Affiliations

(1)
Department of Mathematics, Yibin University
(2)
College of Mathematics Science, Chongqing Normal University
(3)
College of science, PLA University of Science and Technology

References

  1. Boyd S, El Ghaoui L, Feron E, Balakrishnan V: Linear matrix Inequalities in System and Control Theory, vol. 15. SIAM Stud. Appl Math SIAM, Philadelphia; 1994.View ArticleGoogle Scholar
  2. Goemans MX: Semidefinite programming in combinatorial optimization. Math Program 1997, 79: 143–161.MATHMathSciNetGoogle Scholar
  3. Lovfisz L: Semidefinite programs and combinatorial optimization. Lecture notes; 1995.Google Scholar
  4. Alizadeh E: Interior point methods in semidefinite programming with applications to combinatorial optimization. SIAM J Optim 1995, 5: 13–51. 10.1137/0805002MATHMathSciNetView ArticleGoogle Scholar
  5. Vandenberghe L, Boyd S: Semidefinite programming. SIAM Rev 1996, 38(1):49–95. 10.1137/1038003MATHMathSciNetView ArticleGoogle Scholar
  6. Wolkowicz H, Saigal R, Vandeberghe : Handbook of Semidefinite Programming, Theory, Algorithms, and Applications. Kluwer Academic Publishers; 2000.View ArticleGoogle Scholar
  7. de Klerk E: Aspects of Semidefinite Programming--Interior Point Algorithms and Selected Applications. Kluwer Academic Publishers; 2002.Google Scholar
  8. Beck A, Teboulle M: Global optimality conditions for quadratic optimization problems with binary constraints. SIAM J Optim 2000, 11: 179–188. 10.1137/S1052623498336930MATHMathSciNetView ArticleGoogle Scholar
  9. Jeyakumar V, Rubinov AM, Wu ZY: Non-convex quadratic minimization problems with quadratic constraints: global optimality conditions. Math Program Ser A 2007, 110: 521–541. 10.1007/s10107-006-0012-5MATHMathSciNetView ArticleGoogle Scholar
  10. Jeyakumar V, Rubinov AM, Wu ZY: Sufficient global optimality conditions for non-convex quadratic minimization problems with box constraints. J Glob Optim 2006, 36: 471–481. 10.1007/s10898-006-9022-3MATHMathSciNetView ArticleGoogle Scholar
  11. Jeyakumar V, Srisatkunarajah S, Huy NQ: United global optimality conditions for smooth minimization problems with mixed variables. RAIRO Oper Res 2008, 42: 361–370. 10.1051/ro:2008019MATHMathSciNetView ArticleGoogle Scholar
  12. Wu ZY, Bai FS: Global optimality conditions for mixed nonconvex quadratic programs. Optimization 2009, 58(1):39–47. 10.1080/02331930701761243MATHMathSciNetView ArticleGoogle Scholar
  13. Jeyakumar V, Wu ZY: Conditions for global optimality of quadratic minimizaiton programs with LMI constraints. Asia-Pac J Oper Res 2007, 24(2):149–160. 10.1142/S021759590700119XMATHMathSciNetView ArticleGoogle Scholar
  14. Jeyakumar V: A note on strong duality in convex semidefinite optimization: necessary and sufficient conditions. Optim Lett 2008, 2: 15–25.MATHMathSciNetView ArticleGoogle Scholar
  15. Boyd S, El Ghaoui L, Feron E, Balakrishnan V: Linear Matrix Inequalities in Systems and Control Theory, vol. 15. SIAM Stud Appl Math SIAM, Philadelphia 1994.Google Scholar
  16. Todd MJ: Semidefinite optimization. Acta Numer 2001, 10: 515-s560.MATHMathSciNetView ArticleGoogle Scholar
  17. Balakrishnan V, Vandenberghe L: Semidefinite programming duality and linear time-invariant systems. IEEE Trans Autom Control 2003, 48: 30–41. 10.1109/TAC.2002.806652MathSciNetView ArticleGoogle Scholar

Copyright

© Quan et al; licensee Springer. 2012

This article is published under license to BioMed Central Ltd. This is an Open Access article distributed under the terms of the Creative Commons Attribution License (http://creativecommons.org/licenses/by/2.0), which permits unrestricted use, distribution, and reproduction in any medium, provided the original work is properly cited.