A QQP-Minimization Method for Semidefinite and Smooth Nonconvex Programs

In several applications, semideenite programs with nonlinear equality constraints arise. We give two such examples to emphasize the importance of this class of problems. We then propose a new solution method that also applies to smooth nonconvex programs. The method combines ideas of a predictor corrector interior-point method, of the SQP method, and of trust region methods. In particular, we believe that the new method combines the advantages|generality and robustness of trust region methods, local convergence of the SQP-method and data-independence of interior-point methods. Some convergence results are given, and some very preliminary numerical experiments suggest a high robustness of the proposed method.

[1]  Anders Forsgren,et al.  Primal-Dual Interior Methods for Nonconvex Nonlinear Programming , 1998, SIAM J. Optim..

[2]  H. Wolkowicz,et al.  SQ2P, Sequential Quadratic Constrained Quadratic Programming , 1998 .

[3]  M. Powell.  Trust Region Calculations Revisited 1 , 1997 .

[4]  Jorge Nocedal,et al.  A trust region method based on interior point techniques for nonlinear programming , 2000, Math. Program..

[5]  M. J. D. Powell,et al.  Nonlinear Programming—Sequential Unconstrained Minimization Techniques , 1969 .

[6]  F. Jarre.  An interior-point method for minimizing the maximum eigenvalue of a linear combination of matrices , 1993 .

[7]  A. Tits,et al.  A Primal-Dual Interior-Point Method for Nonconvex Optimization with Multiple Logarithmic Barrier Parameters and with Strong Convergence Properties , 1998 .

[8]  Anthony V. Fiacco,et al.  Nonlinear programming;: Sequential unconstrained minimization techniques , 1968 .

[9]  Michael L. Overton,et al.  A Primal-dual Interior Method for Nonconvex Nonlinear Programming , 1998 .

[10]  Stephen J. Wright,et al.  The role of linear objective functions in barrier methods , 1999, Math. Program..

[11]  Danny C. Sorensen,et al.  On the use of directions of negative curvature in a modified newton method , 1979, Math. Program..

[12]  G. Sonnevend.  An "analytical centre" for polyhedrons and new classes of global algorithms for linear (smooth, convex) programming , 1986 .

[13]  Robert J. Vanderbei,et al.  An Interior-Point Algorithm for Nonconvex Nonlinear Programming , 1999, Comput. Optim. Appl..

[14]  Narendra Karmarkar,et al.  A new polynomial-time algorithm for linear programming , 1984, STOC '84.

[15]  Masakazu Muramatsu,et al.  Global Convergence of a Long-Step Affine Scaling Algorithm for Degenerate Linear Programming Problems , 1995, SIAM J. Optim..

[16]  Richard H. Byrd,et al.  A Family of Trust Region Based Algorithms for Unconstrained Minimization with Strong Global Convergence Properties. , 1985 .

[17]  Florian Jarre,et al.  Optimal Truss Design by Interior-Point Methods , 1998, SIAM J. Optim..

[18]  M. Powell.  The use of Band Matrices for Second Derivative Approximations in Trust Region Algorithms , 1998 .