On the superlinear local convergence of a penalty-free method for nonlinear semidefinite programming

This paper is concerned with a sequentially semidefinite programming (SSDP) algorithm for solving nonlinear semidefinite programming problems (NLSDP), which does not use a penalty function or a filter. This method, inspired by the classic SQP method, calculates a trial step by a quadratic semidefini...

Celý popis

Uloženo v:
Podrobná bibliografie
Vydáno v:Journal of computational and applied mathematics Ročník 308; s. 1 - 19
Hlavní autoři: Zhao, Qi, Chen, Zhongwen
Médium: Journal Article
Jazyk:angličtina
Vydáno: Elsevier B.V 15.12.2016
Témata:
Algorithms
Convergence
Global convergence
Iterative methods
Local convergence
Mathematical analysis
Mathematical models
Mathematical programming
Nonlinear semidefinite programming
Nonlinearity
Penalty-free method
Second order correction
Strategy
Nonlinear semidefinite programming
Global convergence
65K05
90C22
Second order correction
Local convergence
Penalty-free method
ISSN:0377-0427, 1879-1778
On-line přístup:Získat plný text
Tagy: Přidat tag
Žádné tagy, Buďte první, kdo vytvoří štítek k tomuto záznamu!
Popis
Shrnutí:This paper is concerned with a sequentially semidefinite programming (SSDP) algorithm for solving nonlinear semidefinite programming problems (NLSDP), which does not use a penalty function or a filter. This method, inspired by the classic SQP method, calculates a trial step by a quadratic semidefinite programming subproblem at each iteration. The trial step is determined such that either the value of the objective function or the measure of constraint violation is sufficiently reduced. In order to guarantee global convergence, the measure of constraint violation in each iteration is required not to exceed a progressively decreasing limit. We prove the global convergence properties of the algorithm under mild assumptions. We also analyze the local behaviour of the proposed method while using a second order correction strategy to avoid Maratos effect. We prove that, under the strict complementarity and the strong second order sufficient conditions with the sigma term, the rate of local convergence is superlinear. Finally, some numerical results with nonlinear semidefinite programming formulation of control design problem with the data contained in COMPleib are given.
Bibliografie:ObjectType-Article-1
SourceType-Scholarly Journals-1
ObjectType-Feature-2
content type line 23
ISSN:0377-0427
1879-1778
DOI:10.1016/j.cam.2016.05.007