Handling Convexity-Like Constraints in Variational Problems

DOI10.1137/130938359zbMath1310.65074arXiv1403.2340OpenAlexW2005847353MaRDI QIDQ5174904

Quentin Mérigot, Edouard Oudet

Publication date: 19 February 2015

Published in: SIAM Journal on Numerical Analysis (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1403.2340

zbMATH Keywords

convergenceconvex functionscalculus of variationssupport functiontensor-product splinessecond-order constraints

Mathematics Subject Classification ID

Numerical optimization and variational techniques (65K10) Numerical aspects of computer graphics, image analysis, and computational geometry (65D18) Discrete approximations in optimal control (49M25) Existence theories in calculus of variations and optimal control (49J99)

Related Items (10)

Adaptive, anisotropic and hierarchical cones of discrete convex functions ⋮ Parametric shape optimization using the support function ⋮ Conforming approximation of convex functions with the finite element method ⋮ Pointwise rates of convergence for the Oliker-Prussner method for the Monge-Ampère equation ⋮ Crowd motion and evolution PDEs under density constraints ⋮ An iterated projection approach to variational problems under generalized convexity constraints ⋮ \{Euclidean, metric, and Wasserstein\} gradient flows: an overview ⋮ Discretization of functionals involving the Monge-Ampère operator ⋮ Linear-Time Convexity Test for Low-Order Piecewise Polynomials ⋮ Numerical shape optimization among convex sets

This page was built for publication: Handling Convexity-Like Constraints in Variational Problems