An algorithm for computing solutions of variational problems with global convexity constraints
From MaRDI portal
Publication:2270139
DOI10.1007/s00211-009-0270-2zbMath1188.65086arXiv0803.0904OpenAlexW1967110739MaRDI QIDQ2270139
Santiago Moreno-Bromberg, Ivar Ekeland
Publication date: 15 March 2010
Published in: Numerische Mathematik (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/0803.0904
Lua error in Module:PublicationMSCList at line 37: attempt to index local 'msc_result' (a nil value).
Related Items (11)
Adaptive, anisotropic and hierarchical cones of discrete convex functions ⋮ Risk minimization and optimal derivative design in a principal agent game ⋮ Conforming approximation of convex functions with the finite element method ⋮ Efficiency and equilibria in games of optimal derivative design ⋮ The numerical solution of Newton's problem of least resistance ⋮ On the strategic use of risk and undesirable goods in multidimensional screening ⋮ An iterated projection approach to variational problems under generalized convexity constraints ⋮ \{Euclidean, metric, and Wasserstein\} gradient flows: an overview ⋮ When is multidimensional screening a convex program? ⋮ Discretization of functionals involving the Monge-Ampère operator ⋮ Linear-Time Convexity Test for Low-Order Piecewise Polynomials
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Risk minimization and optimal derivative design in a principal agent game
- Approximating optimization problems over convex functions
- Monopoly and product quality
- Optimal derivatives design for mean-variance agents under adverse selection
- Convergence of convex sets and of solutions of variational inequalities
- NON-CONVERGENCE RESULT FOR CONFORMAL APPROXIMATION OF VARIATIONAL PROBLEMS SUBJECT TO A CONVEXITY CONSTRAINT
- Extremal points of a functional on the set of convex functions
- Convergent finite elements for a class of nonconvex variational problems
- Ironing, Sweeping, and Multidimensional Screening
- Multiproduct Nonlinear Pricing
- Minimizing within Convex Bodies Using a Convex Hull Method
- A symmetry problem in the calculus of variations
- A numerical approach to variational problems subject to convexity constraint
This page was built for publication: An algorithm for computing solutions of variational problems with global convexity constraints