Adaptive, anisotropic and hierarchical cones of discrete convex functions

DOI10.1007/s00211-015-0732-7zbMath1343.65073arXiv1402.1561OpenAlexW1920208764MaRDI QIDQ264117

Jean-Marie Mirebeau

Publication date: 5 April 2016

Published in: Numerische Mathematik (Search for Journal in Brave)

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

zbMATH Keywords

optimizationcomplexityconvexityconvex programmingconvex functionsfinite difference methodsnumerical experimenteconomicsmonopolist problem

Mathematics Subject Classification ID

Numerical mathematical programming methods (65K05) Convex programming (90C25) Microeconomic theory (price theory and economic markets) (91B24) Convex functions and convex programs in convex geometry (52A41) Convexity of real functions of several variables, generalizations (26B25)

Related Items (8)

Solvability of a class of singular fourth order equations of Monge-Ampère type ⋮ Conforming approximation of convex functions with the finite element method ⋮ Twisted Harnack inequality and approximation of variational problems with a convexity constraint by singular Abreu equations ⋮ Numerical Approximation of Optimal Convex Shapes ⋮ Discretization of functionals involving the Monge-Ampère operator ⋮ Improved Accuracy of Monotone Finite Difference Schemes on Point Clouds and Regular Grids ⋮ Minimal convex extensions and finite difference discretisation of the quadratic Monge–Kantorovich problem ⋮ Linear-Time Convexity Test for Low-Order Piecewise Polynomials

Cites Work

• Unnamed Item
• The numerical solution of Newton's problem of least resistance
• When is multidimensional screening a convex program?
• Haggling over substitutes
• Approximating optimization problems over convex functions
• Voronoi diagrams and arrangements
• Flipping edges in triangulations
• Sparse non-negative stencils for anisotropic diffusion
• An algorithm for computing solutions of variational problems with global convexity constraints
• Efficient fast marching with Finsler metrics
• Optimal derivatives design for mean-variance agents under adverse selection
• Bundling as an optimal selling mechanism for a multiple-good monopolist
• NON-CONVERGENCE RESULT FOR CONFORMAL APPROXIMATION OF VARIATIONAL PROBLEMS SUBJECT TO A CONVEXITY CONSTRAINT
• Anisotropic Fast-Marching on Cartesian Grids Using Lattice Basis Reduction
• On Convex Functions and the Finite Element Method
• Ironing, Sweeping, and Multidimensional Screening
• A Numerical Method for Variational Problems with Convexity Constraints
• Handling Convexity-Like Constraints in Variational Problems
• A fast algorithm for the two dimensional HJB equation of stochastic control
• Minimizing within Convex Bodies Using a Convex Hull Method
• Monotone and consistent discretization of the Monge-Ampère operator
• A general existence result for the principal-agent problem with adverse selection
• A numerical approach to variational problems subject to convexity constraint

This page was built for publication: Adaptive, anisotropic and hierarchical cones of discrete convex functions