Showing a limited preview of this publication:
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