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

Full description

Saved in:

Bibliographic Details
Published in:	Mathematical programming Vol. 129; no. 1; pp. 5 - 31
Main Authors:	Rudolf, Gábor, Noyan, Nilay, Papp, Dávid, Alizadeh, Farid
Format:	Journal Article
Language:	English
Published:	Berlin/Heidelberg Springer-Verlag 01.09.2011 Springer Nature B.V
Subjects:	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
Online Access:	Get full text
Tags:	Add Tag No Tags, Be the first to tag this record!

Be the first to leave a comment!