Computing uniform convex approximations for convex envelopes and convex hulls

MaRDI QIDQ3530153zbMATH OpenFDO

Authors R. Laraki, Jean B. Lasserre

Publication date 15 October 2008

Full work available at URL http://www.heldermann.de/JCA/JCA15/JCA153/jca15044.htm

zbMATH Keywords

Convex envelopeGeneral moment problemLegendre-Fenchel dualityRational functionSemidefinite programmingSemidefinite representable set

Mathematics Subject Classification ID

Convexity of real functions of several variables, generalizations (26B25) Real rational functions (26C15) Semidefinite programming (90C22) Convex programming (90C25)

Recommendations

• Spectrahedral approximations of convex hulls of algebraic sets
• Convex hulls of algebraic sets
• Computing the value of the convex envelope of quadratic forms over polytopes through a semidefinite program
• On convex envelopes for bivariate functions over polytopes
• Exact and approximate results for convex envelopes of special structured functions over simplices

Cited in

(20)

• Estimates for numerical approximations of rank one convex envelopes
• Convex envelopes of separable functions over regions defined by separable functions of the same type
• Convex envelopes of bivariate functions through the solution of KKT systems
• Exact and approximate results for convex envelopes of special structured functions over simplices
• Convex envelope of bivariate cubic functions over rectangular regions
• Convex sets with semidefinite representation
• On the semidefinite representation of real functions applied to symmetric matrices
• Computing the value of the convex envelope of quadratic forms over polytopes through a semidefinite program
• Spectrahedral approximations of convex hulls of algebraic sets
• Acyclic Gambling Games
• COMPUTING THE CONVEX ENVELOPE USING A NONLINEAR PARTIAL DIFFERENTIAL EQUATION
• Envelope computation in the plane by approximate implicitization
• Semidefinite Approximation of Closed Convex Set
• Polyhedral subdivisions and functional forms for the convex envelopes of bilinear, fractional and other bivariate functions over general polytopes
• Reliable and Efficient Approximation of Polyconvex Envelopes
• Convex geometry of finite exchangeable laws and de Finetti style representation with universal correlated corrections
• A new technique to derive tight convex underestimators (sometimes envelopes)
• Convex hull algorithms for piecewise linear-quadratic functions in computational convex analysis
• Incremental algorithms for finding the convex hulls of circles and the lower envelopes of parabolas
• Moments and sums of squares for polynomial optimization and related problems

This page was built for publication: Computing uniform convex approximations for convex envelopes and convex hulls

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3530153)