# Open image in new window -Duality Theorems for Convex Semidefinite Optimization Problems with Conic Constraints

**Part of the following topical collections:**

## Abstract

A convex semidefinite optimization problem with a conic constraint is considered. We formulate a Wolfe-type dual problem for the problem for its Open image in new window -approximate solutions, and then we prove Open image in new window -weak duality theorem and Open image in new window -strong duality theorem which hold between the problem and its Wolfe type dual problem. Moreover, we give an example illustrating the duality theorems.

## Keywords

Approximate Solution Feasible Solution Convex Function Linear Matrix Inequality Constraint Qualification## 1. Introduction

Convex semidefinite optimization problem is to optimize an objective convex function over a linear matrix inequality. When the objective function is linear and the corresponding matrices are diagonal, this problem becomes a linear optimization problem.

For convex semidefinite optimization problem, Lagrangean duality without constraint qualification [1, 2], complete dual characterization conditions of solutions [1, 3, 4], saddle point theorems [5], and characterizations of optimal solution sets [6, 7] have been investigated.

To get the Open image in new window -approximate solution, many authors have established Open image in new window -optimality conditions, Open image in new window -saddle point theorems and Open image in new window -duality theorems for several kinds of optimization problems [1, 8, 9, 10, 11, 12, 13, 14, 15, 16].

Recently, Jeyakumar and Glover [11] gave Open image in new window -optimality conditions for convex optimization problems, which hold without any constraint qualification. Yokoyama and Shiraishi [16] gave a special case of convex optimization problem which satisfies Open image in new window -optimality conditions. Kim and Lee [12] proved sequential Open image in new window -saddle point theorems and Open image in new window -duality theorems for convex semidefinite optimization problems which have not conic constraints.

The purpose of this paper is to extend the Open image in new window -duality theorems by Kim and Lee [12] to convex semidefinite optimization problems with conic constraints. We formulate a Wolfe type dual problem for the problem for its Open image in new window -approximate solutions, and then prove Open image in new window -weak duality theorem and Open image in new window -strong duality theorem for the problem and its Wolfe type dual problem, which hold under a weakened constraint qualification. Moreover, we give an example illustrating the duality theorems.

## 2. Preliminaries

Consider the following convex semidefinite optimization problem:

where Open image in new window is a convex function, Open image in new window is a closed convex cone of Open image in new window , and for Open image in new window , where Open image in new window is the space of Open image in new window real symmetric matrices. The space Open image in new window is partially ordered by the L Open image in new window wner order, that is, for Open image in new window if and only if Open image in new window is positive semidefinite. The inner product in Open image in new window is defined by Open image in new window , where Open image in new window is the trace operation.

for any Open image in new window Clearly, Open image in new window is the feasible set of SDP.

Definition 2.1.

Let Open image in new window be a convex function.

where Open image in new window is the scalar product on Open image in new window .

Definition 2.2.

Definition 2.3.

Definition 2.4.

If Open image in new window is sublinear (i.e., convex and positively homogeneous of degree one), then Open image in new window , for all Open image in new window . If Open image in new window , Open image in new window , Open image in new window , then Open image in new window . It is worth nothing that if Open image in new window is sublinear, then

Moreover, if Open image in new window is sublinear and if Open image in new window , Open image in new window , and Open image in new window , then

Definition 2.5.

Let Open image in new window be a closed convex set in Open image in new window and Open image in new window .

(1)Let Open image in new window . Then Open image in new window is called the normal cone to Open image in new window at Open image in new window .

(2)Let Open image in new window . Let Open image in new window . Then Open image in new window is called the Open image in new window -normal set to Open image in new window at Open image in new window .

(3)When Open image in new window is a closed convex cone in Open image in new window , Open image in new window we denoted by Open image in new window and called the negative dual cone of Open image in new window .

Proposition 2.6 (see [17, 18]).

Proposition 2.7 (see [7]).

Following the proof of Lemma Open image in new window in [1], we can prove the following lemma.

Lemma 2.8.

## 3. Open image in new window -Duality Theorem

Now we give Open image in new window -duality theorems for SDP. Using Lemma 2.8, we can obtain the following lemma which is useful in proving our Open image in new window -strong duality theorems for SDP.

Lemma 3.1.

Proof.

for any Open image in new window .

( Open image in new window ) Suppose that there exists Open image in new window such that

for any Open image in new window Thus Open image in new window , for any Open image in new window . Hence Open image in new window is an Open image in new window -approximate solution of SDP.

Now we formulate the dual problem SDD of SDP as follows:

We prove Open image in new window -weak and Open image in new window -strong duality theorems which hold between SDP and SDD.

Theorem 3.2 ( Open image in new window -weak duality).

Proof.

Hence Open image in new window .

Theorem 3.3 ( Open image in new window -strong duality).

is closed. If Open image in new window is an Open image in new window -approximate solution of SDP, then there exists Open image in new window such that Open image in new window is a Open image in new window -approximate solution of SDD.

Proof.

for any Open image in new window . Letting Open image in new window in (3.14), Open image in new window . Since Open image in new window and Open image in new window , Open image in new window .

Thus from (3.14),

Thus Open image in new window is a 2 Open image in new window -approximate solution to SDD.

Now we characterize the Open image in new window -normal set to Open image in new window .

Proposition 3.4.

Proof.

From Proposition 3.4, we can calculate Open image in new window .

Corollary 3.5.

Let Open image in new window and Open image in new window Then following hold.

(i)If Open image in new window , then Open image in new window

(ii)If Open image in new window and Open image in new window , then Open image in new window

(iii)If Open image in new window and Open image in new window , then Open image in new window

Now we give an example illustrating our Open image in new window -duality theorems.

Example 3.6.

that is, Open image in new window -weak duality holds.

Let Open image in new window be an Open image in new window -approximate solution of SDP. Then Open image in new window and Open image in new window . So, we can easily check that Open image in new window Open image in new window .

Since Open image in new window , from (3.29),

for any Open image in new window Open image in new window . So Open image in new window is an Open image in new window -approximate solution of SDD. Hence Open image in new window -strong duality holds.

## Notes

### Acknowledgment

This work was supported by the Korea Science and Engineering Foundation (KOSEF) NRL Program grant funded by the Korean government (MEST)(no. R0A-2008-000-20010-0).

## References

- 1.Jeyakumar V, Dinh N: Avoiding duality gaps in convex semidefinite programming without Slater's condition. In
*Applied Mathematics Report*. University of New South Wales, Sydney, Australia; 2004.Google Scholar - 2.Ramana MV, Tunçel L, Wolkowicz H: Strong duality for semidefinite programming.
*SIAM Journal on Optimization*1997, 7(3):641–662. 10.1137/S1052623495288350MathSciNetCrossRefMATHGoogle Scholar - 3.Jeyakumar V, Lee GM, Dinh N: New sequential Lagrange multiplier conditions characterizing optimality without constraint qualification for convex programs.
*SIAM Journal on Optimization*2003, 14(2):534–547. 10.1137/S1052623402417699MathSciNetCrossRefMATHGoogle Scholar - 4.Jeyakumar V, Nealon MJ: Complete dual characterizations of optimality for convex semidefinite programming. In
*Constructive, Experimental, and Nonlinear Analysis (Limoges, 1999), CMS Conference Proceedings*.*Volume 27*. American Mathematical Society, Providence, RI, USA; 2000:165–173.Google Scholar - 5.Dinh N, Jeyakumar V, Lee GM: Sequential Lagrangian conditions for convex programs with applications to semidefinite programming.
*Journal of Optimization Theory and Applications*2005, 125(1):85–112. 10.1007/s10957-004-1712-8MathSciNetCrossRefMATHGoogle Scholar - 6.Jeyakumar V, Lee GM, Dinh N: Lagrange multiplier conditions characterizing the optimal solution sets of cone-constrained convex programs.
*Journal of Optimization Theory and Applications*2004, 123(1):83–103.MathSciNetCrossRefMATHGoogle Scholar - 7.Jeyakumar V, Lee GM, Dinh N: Characterizations of solution sets of convex vector minimization problems.
*European Journal of Operational Research*2006, 174(3):1380–1395. 10.1016/j.ejor.2005.05.007MathSciNetCrossRefMATHGoogle Scholar - 8.Govil MG, Mehra A: -optimality for multiobjective programming on a Banach space.
*European Journal of Operational Research*2004, 157(1):106–112. 10.1016/S0377-2217(03)00206-6MathSciNetCrossRefMATHGoogle Scholar - 9.Gutiérrez C, Jiménez B, Novo V: Multiplier rules and saddle-point theorems for Helbig's approximate solutions in convex Pareto problems.
*Journal of Global Optimization*2005, 32(3):367–383. 10.1007/s10898-004-5904-4MathSciNetCrossRefMATHGoogle Scholar - 10.Hamel A: An -lagrange multiplier rule for a mathematical programming problem on Banach spaces.
*Optimization*2001, 49(1–2):137–149. 10.1080/02331930108844524MathSciNetCrossRefMATHGoogle Scholar - 11.Jeyakumar V, Glover BM: Characterizing global optimality for DC optimization problems under convex inequality constraints.
*Journal of Global Optimization*1996, 8(2):171–187. 10.1007/BF00138691MathSciNetCrossRefMATHGoogle Scholar - 12.Kim GS, Lee GM: On -approximate solutions for convex semidefinite optimization problems.
*Taiwanese Journal of Mathematics*2007, 11(3):765–784.MathSciNetMATHGoogle Scholar - 13.Liu JC: -duality theorem of nondifferentiable nonconvex multiobjective programming.
*Journal of Optimization Theory and Applications*1991, 69(1):153–167. 10.1007/BF00940466MathSciNetCrossRefMATHGoogle Scholar - 14.Liu JC: -Pareto optimality for nondifferentiable multiobjective programming via penalty function.
*Journal of Mathematical Analysis and Applications*1996, 198(1):248–261. 10.1006/jmaa.1996.0080MathSciNetCrossRefMATHGoogle Scholar - 15.Strodiot J-J, Nguyen VH, Heukemes N: -optimal solutions in nondifferentiable convex programming and some related questions.
*Mathematical Programming*1983, 25(3):307–328. 10.1007/BF02594782MathSciNetCrossRefMATHGoogle Scholar - 16.Yokoyama K, Shiraishi S: An -optimal condition for convex programming problems without Slater's constraint qualifications. preprintGoogle Scholar
- 17.Hiriart-Urruty JB, Lemarechal C:
*Convex Analysis and Minimization Algorithms. I. Fundamentals, Grundlehren der mathematischen Wissenschaften*.*Volume 305*. Springer, Berlin, Germany; 1993.CrossRefGoogle Scholar - 18.Hiriart-Urruty JB, Lemarechal C:
*Convex Analysis and Minimization Algorithms. II. Advanced Theory and Bundle Methods, Grundlehren der mathematischen Wissenschaften*.*Volume 306*. Springer, Berlin, Germany; 1993.Google Scholar

## Copyright information

This article is published under license to BioMed Central Ltd. This is an open access article distributed under the Creative Commons Attribution License, which permits unrestricted use, distribution, and reproduction in any medium, provided the original work is properly cited.