A sequential semidefinite programming method and an application in passive reduced-order modeling
Skip to main content
eScholarship
Open Access Publications from the University of California

A sequential semidefinite programming method and an application in passive reduced-order modeling

  • Author(s): Freund, Roland W.
  • Jarre, Florian
  • Vogelbusch, Christoph
  • et al.

Published Web Location

https://arxiv.org/pdf/math/0503135.pdf
No data is associated with this publication.
Abstract

We consider the solution of nonlinear programs with nonlinear semidefiniteness constraints. The need for an efficient exploitation of the cone of positive semidefinite matrices makes the solution of such nonlinear semidefinite programs more complicated than the solution of standard nonlinear programs. In particular, a suitable symmetrization procedure needs to be chosen for the linearization of the complementarity condition. The choice of the symmetrization procedure can be shifted in a very natural way to certain linear semidefinite subproblems, and can thus be reduced to a well-studied problem. The resulting sequential semidefinite programming (SSP) method is a generalization of the well-known SQP method for standard nonlinear programs. We present a sensitivity result for nonlinear semidefinite programs, and then based on this result, we give a self-contained proof of local quadratic convergence of the SSP method. We also describe a class of nonlinear semidefinite programs that arise in passive reduced-order modeling, and we report results of some numerical experiments with the SSP method applied to problems in that class.

Item not freely available? Link broken?
Report a problem accessing this item