Please use this identifier to cite or link to this item: http://hdl.handle.net/10397/14524
Title: A feasible direction method for the semidefinite program with box constraints
Authors: Xu, Y
Sun, W
Qi, L 
Keywords: Box constraint
Feasible direction method
Global convergence
Optimization
Semidefinite program
Issue Date: 2011
Publisher: Pergamon Press
Source: Applied mathematics letters, 2011, v. 24, no. 11, p. 1874-1881 How to cite?
Journal: Applied mathematics letters 
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.
URI: http://hdl.handle.net/10397/14524
ISSN: 0893-9659
DOI: 10.1016/j.aml.2011.05.010
Appears in Collections:Journal/Magazine Article

Access
View full-text via PolyU eLinks SFX Query
Show full item record

SCOPUSTM   
Citations

2
Last Week
0
Last month
0
Citations as of Aug 19, 2017

WEB OF SCIENCETM
Citations

2
Last Week
0
Last month
0
Citations as of Aug 20, 2017

Page view(s)

40
Last Week
1
Last month
Checked on Aug 20, 2017

Google ScholarTM

Check

Altmetric



Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.