Global Convergence of Algorithms Under Constant Rank Conditions for Nonlinear Second-Order Cone Programming

In Andreani et al. (Weak notions of nondegeneracy in nonlinear semidefinite programming, 2020), the classical notion of nondegeneracy (or transversality) and Robinson’s constraint qualification have been revisited in the context of nonlinear semidefinite programming exploiting the structure of the p...

Celý popis

Uložené v:

Podrobná bibliografia
Vydané v:	Journal of optimization theory and applications Ročník 195; číslo 1; s. 42 - 78
Hlavní autori:	Andreani, Roberto, Haeser, Gabriel, Mito, Leonardo M., Ramírez, C. Héctor, Silveira, Thiago P.
Médium:	Journal Article
Jazyk:	English
Vydavateľské údaje:	New York Springer US 01.10.2022 Springer Nature B.V
Predmet:	Algorithms Applications of Mathematics Calculus of Variations and Optimal Control; Optimization Context Convergence Engineering Lagrange multiplier Mathematics Mathematics and Statistics Operations Research/Decision Theory Optimization Semidefinite programming Theory of Computation Global convergence Algorithms 90C30 90C46 Constraint qualifications Constant rank Second-order cone programming
ISSN:	0022-3239, 1573-2878
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!