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...

Celý popis

Uložené v:

Podrobná bibliografia
Vydané v:	Acta Mathematicae Applicatae Sinica Ročník 38; číslo 2; s. 388 - 409
Hlavní autori:	Fu, Wen-hao, Chen, Zhong-wen
Médium:	Journal Article
Jazyk:	English
Vydavateľské údaje:	Berlin/Heidelberg Springer Berlin Heidelberg 01.04.2022 Springer Nature B.V
Vydanie:	English series
Predmet:	Algorithms Applications of Mathematics Iterative methods Math Applications in Computer Science Mathematical and Computational Physics Mathematics Mathematics and Statistics Penalty function Search methods Semidefinite programming Theoretical rate of convergence bi-object strategy 49M30 nonlinear semidefinite programming global convergence 90C22
ISSN:	0168-9673, 1618-3932
On-line prístup:	Získať plný text
Tagy:	Pridať tag Žiadne tagy, Buďte prvý, kto otaguje tento záznam!

Buďte prvý, kto okomentuje tento záznam!