A numerical approach to variational problems subject to convexity constraint
From MaRDI portal
Publication:5944669
DOI10.1007/s002110000235zbMath0987.65053MaRDI QIDQ5944669
Bertrand Maury, Guillaume Carlier, Thomas Lachand-Robert
Publication date: 23 June 2002
Published in: Numerische Mathematik (Search for Journal in Brave)
Related Items (11)
Adaptive, anisotropic and hierarchical cones of discrete convex functions ⋮ The monopolist's problem: existence, relaxation, and approximation ⋮ 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 ⋮ The numerical solution of Newton's problem of least resistance ⋮ Optimal derivatives design for mean-variance agents under adverse selection ⋮ An iterated projection approach to variational problems under generalized convexity constraints ⋮ Approximating optimization problems over convex functions ⋮ An algorithm for computing solutions of variational problems with global convexity constraints ⋮ Discretization of functionals involving the Monge-Ampère operator ⋮ The Dirichlet problem for the convex envelope
This page was built for publication: A numerical approach to variational problems subject to convexity constraint
