Adaptive, Anisotropic and Hierarchical cones of Discrete Convex functions - Archive ouverte HAL Accéder directement au contenu
Article Dans Une Revue Numerische Mathematik Année : 2016

Adaptive, Anisotropic and Hierarchical cones of Discrete Convex functions

Résumé

We address the discretization of optimization problems posed on the cone of convex functions, motivated in particular by the principal agent problem in economics, which models the impact of monopoly on product quality. Consider a two dimensional domain, sampled on a grid of N points. We show that the cone of restrictions to the grid of convex functions is in general characterized by N^2 linear inequalities; a direct computational use of this description therefore has a prohibitive complexity. We thus introduce a hierarchy of sub-cones of discrete convex functions, associated to stencils which can be adaptively, locally, and anisotropically refined. Numerical experiments optimize the accuracy/complexity tradeoff through the use of a-posteriori stencil refinement strategies.
Fichier principal
Vignette du fichier
AIHCvx.pdf (6.56 Mo) Télécharger le fichier
Origine : Fichiers produits par l'(les) auteur(s)
Loading...

Dates et versions

hal-00943096 , version 1 (06-02-2014)
hal-00943096 , version 2 (23-09-2014)

Identifiants

Citer

Jean-Marie Mirebeau. Adaptive, Anisotropic and Hierarchical cones of Discrete Convex functions. Numerische Mathematik, 2016, 132 (4), pp.807-853. ⟨hal-00943096v2⟩
156 Consultations
82 Téléchargements

Altmetric

Partager

Gmail Facebook X LinkedIn More