Weak notions of nondegeneracy in nonlinear semidefinite programming

The constraint nondegeneracy condition is one of the most relevant and useful constraint qualifications in nonlinear semidefinite programming. It can be characterized in terms of any fixed orthonormal basis of the, let us say, ℓ -dimensional kernel of the constraint matrix, by the linear independenc...

Celý popis

Uložené v:

Podrobná bibliografia
Vydané v:	Mathematical programming Ročník 205; číslo 1-2; s. 1 - 32
Hlavní autori:	Andreani, Roberto, Haeser, Gabriel, Mito, Leonardo M., Ramírez, Héctor
Médium:	Journal Article
Jazyk:	English
Vydavateľské údaje:	Berlin/Heidelberg Springer Berlin Heidelberg 01.05.2024 Springer
Predmet:	Calculus of Variations and Optimal Control; Optimization Combinatorics Full Length Paper Mathematical and Computational Physics Mathematical Methods in Physics Mathematics Mathematics and Statistics Mathematics of Computing Numerical Analysis Theoretical Semidefinite programming 90C30 90C46 Constraint nondegeneracy Constraint qualifications 90C22 90C26
ISSN:	0025-5610, 1436-4646
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!