Bilinear optimality constraints for the cone of positive polynomials

For a proper cone and its dual cone the complementary slackness condition defines an n -dimensional manifold in the space . When is a symmetric cone, points in must satisfy at least n linearly independent bilinear identities. This fact proves to be useful when optimizing over such cones, therefore i...

Celý popis

Uložené v:

Podrobná bibliografia
Vydané v:	Mathematical programming Ročník 129; číslo 1; s. 5 - 31
Hlavní autori:	Rudolf, Gábor, Noyan, Nilay, Papp, Dávid, Alizadeh, Farid
Médium:	Journal Article
Jazyk:	English
Vydavateľské údaje:	Berlin/Heidelberg Springer-Verlag 01.09.2011 Springer Nature B.V
Predmet:	Algorithms Calculus of Variations and Optimal Control; Optimization Combinatorics Errors Full Length Paper Intervals Linear programming Manifolds Mathematical and Computational Physics Mathematical Methods in Physics Mathematical programming Mathematics Mathematics and Statistics Mathematics of Computing Numerical Analysis Optimization Polynomials Studies Syntax Theoretical Variables Optimality conditions Complementarity slackness Positive polynomials 90C46 90C22 Bilinearity rank Bilinear cones
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!