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.
Original language | English |
---|---|
Pages (from-to) | 1874-1881 |
Number of pages | 8 |
Journal | Applied Mathematics Letters |
Volume | 24 |
Issue number | 11 |
DOIs | |
Publication status | Published - 1 Nov 2011 |
Keywords
- Box constraint
- Feasible direction method
- Global convergence
- Optimization
- Semidefinite program
ASJC Scopus subject areas
- Applied Mathematics