Startseite A New Nonlinear Lagrangian Method for Nonconvex Semidefinite Programming
Artikel
Lizenziert
Nicht lizenziert Erfordert eine Authentifizierung

A New Nonlinear Lagrangian Method for Nonconvex Semidefinite Programming

  • Y. Li und L. Zhang
Veröffentlicht/Copyright: 9. Juni 2010

Abstract

We study convergence properties of a new nonlinear Lagrangian method for nonconvex semidefinite programming. The convergence analysis shows that this method converges locally when the penalty parameter is less than a threshold and the error bound of solution is proportional to the penalty parameter under the constraint nondegeneracy condition, the strict complementarity condition and the strong second order sufficient conditions. The major tools used in the analysis include the second implicit function theorem and differentials of Löwner operators.

Received: 2008-01-30
Revised: 2008-08-17
Published Online: 2010-06-09
Published in Print: 2009-December

© Heldermann Verlag

Heruntergeladen am 26.10.2025 von https://www.degruyterbrill.com/document/doi/10.1515/JAA.2009.149/html?lang=de
Button zum nach oben scrollen