A feasible direction method for the semidefinite program with box constraints

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.

[1]  William W. Hager,et al.  Recent Advances in Bound Constrained Optimization , 2005, System Modelling and Optimization.

[2]  Henry Wolkowicz,et al.  Handbook of Semidefinite Programming , 2000 .

[3]  Christian Kanzow,et al.  On Affine-Scaling Interior-Point Newton Methods for Nonlinear Minimization with Bound Constraints , 2006, Comput. Optim. Appl..

[4]  Thomas F. Coleman,et al.  A Subspace, Interior, and Conjugate Gradient Method for Large-Scale Bound-Constrained Minimization Problems , 1999, SIAM J. Sci. Comput..

[5]  Masao Fukushima,et al.  Successive Linearization Methods for Nonlinear Semidefinite Programs , 2005, Comput. Optim. Appl..

[6]  Ya-Xiang Yuan,et al.  Optimization Theory and Methods: Nonlinear Programming , 2010 .

[7]  D. Bertsekas.  Projected Newton methods for optimization problems with simple constraints , 1981, CDC 1981.

[8]  Francisco Facchinei,et al.  An Active Set Newton Algorithm for Large-Scale Nonlinear Programs with Box Constraints , 1998, SIAM J. Optim..

[9]  E. Polak,et al.  Family of Projected Descent Methods for Optimization Problems with Simple Bounds , 1997 .

[10]  C. Helmberg.  Semidefinite Programming for Combinatorial Optimization , 2000 .

[11]  José Mario Martínez,et al.  Large-Scale Active-Set Box-Constrained Optimization Method with Spectral Projected Gradients , 2002, Comput. Optim. Appl..

[12]  L. N. Vicente,et al.  Trust-Region Interior-Point Algorithms for Minimization Problems with Simple Bounds , 1996 .

[13]  P. Toint,et al.  Correction to the paper on global convergence of a class of trust region algorithms for optimization with simple bounds , 1989 .

[14]  Stefan Schäffler,et al.  Applied Mathematics and Parallel Computing: Festschrift for Klaus Ritter , 2012 .

[15]  J. M. Martínez,et al.  A new trust region algorithm for bound constrained minimization , 1994 .

[16]  Thomas F. Coleman,et al.  An Interior Trust Region Approach for Nonlinear Minimization Subject to Bounds , 1993, SIAM J. Optim..

[17]  P. Toint,et al.  Global convergence of a class of trust region algorithms for optimization with simple bounds , 1988 .

[18]  Wenyu Sun,et al.  On filter-successive linearization methods for nonlinear semidefinite programming , 2009 .