Optimization Online


On the computation of convex envelopes for bivariate functions through KKT conditions

Marco Locatelli (marco.locatelli***at***unipr.it)

Abstract: In this paper we exploit a slight variant of a result previously proved in [11] to define a procedure which delivers the convex envelope of some bivariate functions over polytopes. The procedure is based on the solution of a KKT system and simplifies the derivation of the convex envelope with respect to previously proposed techniques. The procedure is applied to derive the convex envelope of the bilinear function xy over any polytope, and the convex envelope of functions x^ny^m over boxes.

Keywords: non convex problems, convex envelope, KKT conditions

Category 1: Global Optimization (Theory )


Download: [PDF]

Entry Submitted: 01/11/2016
Entry Accepted: 01/11/2016
Entry Last Modified: 01/16/2018

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 Optimization Society