A linear-time approximate convex envelope algorithm using the double Legendre-Fenchel transform with application to phase separation

DOI10.1007/s10589-014-9666-8zbMath1320.90079MaRDI QIDQ2515072

Alexandre Ern, Lorenzo Contento, Rossana Vermiglio

Publication date: 10 February 2015

Published in: Computational Optimization and Applications (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s10589-014-9666-8

zbMATH Keywords

phase separation; convex hull; convex envelope; Legendre-Fenchel transform

Mathematics Subject Classification ID

90C30: Nonlinear programming

Related Items

An analysis of the unified formulation for the equilibrium problem of compositional multiphase mixtures, Linear-Time Convexity Test for Low-Order Piecewise Polynomials, Computation of the epsilon-subdifferential of convex piecewise linear-quadratic functions in optimal worst-case time

Uses Software

• Qhull
• na13

Cites Work

• Unnamed Item
• Convex hull algorithms for piecewise linear-quadratic functions in computational convex analysis
• Convex parametric piecewise quadratic optimization: theory and algorithms
• Faster than the fast Legendre transform, the linear-time Legendre transform
• Optimal output-sensitive convex hull algorithms in two and three dimensions
• Mathematical study of non-ideal electrostatic correlations in equilibrium electrolytes
• PRESSURE LAWS AND FAST LEGENDRE TRANSFORM
• The convex envelope is the solution of a nonlinear obstacle problem
• COMPUTING THE CONVEX ENVELOPE USING A NONLINEAR PARTIAL DIFFERENTIAL EQUATION
• What Shape Is Your Conjugate? A Survey of Computational Convex Analysis and Its Applications
• Lipschitz $r$-continuity of the approximative subdifferential of a convex function.
• The quickhull algorithm for convex hulls
• Fast Legendre–Fenchel Transform and Applications to Hamilton–Jacobi Equations and Conservation Laws
• Convex Analysis