-

 

 

 




Optimization Online





 

Representation of nonnegative convex polynomials

Jean B. Lasserre(lasserre***at***laas.fr)

Abstract: We provide a specific representation of convex polynomials nonnegative on a convex (not necessarily compact) basic closed semi-algebraic set $K$ of $R^n$. Namely, they belong to a specific subset of the quadratic module generated by the concave polynomials that define $K$.

Keywords: Convexity; basi semi-algebraic sets.

Category 1: Convex and Nonsmooth Optimization (Convex Optimization )

Category 2: Linear, Cone and Semidefinite Programming (Semi-definite Programming )

Citation: To appear in Archiv der Mathematik

Download: [PDF]

Entry Submitted: 07/09/2008
Entry Accepted: 07/09/2008
Entry Last Modified: 07/09/2008

Modify/Update this entry


  Visitors Authors More about us Links
  Subscribe, Unsubscribe
Digest Archive
Search, Browse the Repository

 

Submit
Update
Policies
Coordinator's Board
Classification Scheme
Credits
Give us feedback
Optimization Journals, Sites, Societies
Mathematical Programming Society