A Line Search SQP-type Method with Bi-object Strategy for Nonlinear Semidefinite Programming
We propose a line search exact penalty method with bi-object strategy for nonlinear semidefinite programming. At each iteration, we solve a linear semidefinite programming to test whether the linearized constraints are consistent or not. The search direction is generated by a piecewise quadratic-lin...
Uloženo v:
| Vydáno v: | Acta Mathematicae Applicatae Sinica Ročník 38; číslo 2; s. 388 - 409 |
|---|---|
| Hlavní autoři: | , |
| Médium: | Journal Article |
| Jazyk: | angličtina |
| Vydáno: |
Berlin/Heidelberg
Springer Berlin Heidelberg
01.04.2022
Springer Nature B.V |
| Vydání: | English series |
| Témata: | |
| ISSN: | 0168-9673, 1618-3932 |
| 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!
|
| Shrnutí: | We propose a line search exact penalty method with bi-object strategy for nonlinear semidefinite programming. At each iteration, we solve a linear semidefinite programming to test whether the linearized constraints are consistent or not. The search direction is generated by a piecewise quadratic-linear model of the exact penalty function. The penalty parameter is only related to the information of the current iterate point. The line search strategy is a penalty-free one. Global and local convergence are analyzed under suitable conditions. We finally report some numerical experiments to illustrate the behavior of the algorithm on various degeneracy situations. |
|---|---|
| Bibliografie: | ObjectType-Article-1 SourceType-Scholarly Journals-1 ObjectType-Feature-2 content type line 14 |
| ISSN: | 0168-9673 1618-3932 |
| DOI: | 10.1007/s10255-022-1081-9 |