Elsevier

Applied Mathematics Letters

Volume 24, Issue 11, November 2011, Pages 1874-1881
Applied Mathematics Letters

A feasible direction method for the semidefinite program with box constraints☆

https://doi.org/10.1016/j.aml.2011.05.010Get rights and content
Under an Elsevier user license
open archive

Abstract

In this paper, we try to solve the semidefinite program with box constraints. Since the traditional projection method for constrained optimization with box constraints is not suitable to the semidefinite constraints, we present a new algorithm based on the feasible direction method. In the paper, we discuss two cases: the objective function in semidefinite programming is linear and nonlinear, respectively. We establish the convergence of our algorithm, and report the numerical experiments which show the effectiveness of the algorithm.

Highlights

► Solving the semidefinite program with box constraints has many important applications in engineering. ► We present a new algorithm for the box-constrained semidefinite program based on the feasible direction method. ► We establish the global convergence for the feasible direction algorithm for the semidefinite program with box constraints.

Keywords

Optimization
Semidefinite program
Box constraint
Feasible direction method
Global convergence

Cited by (0)

☆

This work was supported by Research Grant Council of Hong Kong, National Natural Science Foundation of China (grant No. 10871098, No. 11071122), the Specialized Research Fund of Doctoral Program of Higher Education of China, and the Natural Science Fund of Jiangsu Province (grant No. BK2009397).

Copyright © 2011 Elsevier Ltd. All rights reserved.