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

Ausführliche Beschreibung

Gespeichert in:

Bibliographische Detailangaben
Veröffentlicht in:	Journal of optimization theory and applications Jg. 195; H. 1; S. 42 - 78
Hauptverfasser:	Andreani, Roberto, Haeser, Gabriel, Mito, Leonardo M., Ramírez, C. Héctor, Silveira, Thiago P.
Format:	Journal Article
Sprache:	Englisch
Veröffentlicht:	New York Springer US 01.10.2022 Springer Nature B.V
Schlagworte:	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
Online-Zugang:	Volltext
Tags:	Tag hinzufügen Keine Tags, Fügen Sie den ersten Tag hinzu!

Schreiben Sie den ersten Kommentar!