Optimization Online


Convex envelopes for quadratic and polynomial functions over polytopes

M Locatelli(locatell***at***ce.unipr.it)

Abstract: In this paper we consider the problem of computing the value and a supporting hyperplane of the convex envelope for quadratic and polynomial functions over polytopes with known vertex set. We show that for general quadratic functions the computation can be carried on through a copositive problem, but in some cases (including all the two-dimensional ones) we can solve a semidefinite problem. The result is also extended to two-dimensional polynomial functions satisfying certain conditions.

Keywords: convex envelopes, semidefinite programming, copositive programming, quadratic problems, polynomial problems

Category 1: Global Optimization (Theory )


Download: [PDF]

Entry Submitted: 11/03/2010
Entry Accepted: 11/03/2010
Entry Last Modified: 11/03/2010

Modify/Update this entry

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


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