An iterated projection approach to variational problems under generalized convexity constraints
type: Item
instance of: scholarly article
title: An iterated projection approach to variational problems under generalized convexity constraints
zbMATH Open document ID: 1383.49040
author: Xavier Dupuis
author: Guillaume Carlier
published in: Applied Mathematics and Optimization
publication date: 2018-02-13T00:00:00Z
Mathematics Subject Classification ID: 49M25
Mathematics Subject Classification ID: 65K15
Mathematics Subject Classification ID: 90C25
Mathematics Subject Classification ID: 90B50
zbMATH DE Number: 6837691
zbMATH Keywords: principal-agent problem
zbMATH Keywords: \(b\)-convexity constraint
zbMATH Keywords: convexity constraint
zbMATH Keywords: convex envelopes
zbMATH Keywords: iterated projections
zbMATH Keywords: Dykstra's algorithm
describes a project that uses: PLCP
describes a project that uses: SQPlab
MaRDI profile type: Publication
full work available at URL: s00245-016-9361-5
OpenAlex ID: W2347113818
cites work: Approximating optimization problems over convex functions
cites work: Q3632456
cites work: Dykstras algorithm with bregman projections: A convergence proof
cites work: Numerical optimization. Theoretical and practical aspects. Transl. from the French
cites work: Q3739782
cites work: Polar factorization and monotone rearrangement of vector‐valued functions
cites work: A symmetry problem in the calculus of variations
cites work: Minimum Problems over Sets of Concave Functions and Related Questions
cites work: Q4382553
cites work: A general existence result for the principal-agent problem with adverse selection
cites work: Q4801813
cites work: Exponential convergence for a convexifying equation
cites work: Regularity of solutions for some variational problems subject to a convexity constraint.
cites work: A numerical approach to variational problems subject to convexity constraint
cites work: NON-CONVERGENCE RESULT FOR CONFORMAL APPROXIMATION OF VARIATIONAL PROBLEMS SUBJECT TO A CONVEXITY CONSTRAINT
cites work: Q5852058
cites work: An Algorithm for Restricted Least Squares Regression
cites work: An algorithm for computing solutions of variational problems with global convexity constraints
cites work: When is multidimensional screening a convex program?
cites work: An example of non-convex minimization and an application to Newton's problem of the body of least resistance
cites work: Regularity and singularities of optimal convex shapes in the plane
cites work: Identification du cône dual des fonctions convexes et applications
cites work: On the regularity of solutions of optimal transportation problems
cites work: Regularity of potential functions of the optimal transportation problem
cites work: Handling Convexity-Like Constraints in Variational Problems
cites work: The convex envelope is the solution of a nonlinear obstacle problem
cites work: COMPUTING THE CONVEX ENVELOPE USING A NONLINEAR PARTIAL DIFFERENTIAL EQUATION
cites work: A Numerical Method for Variational Problems with Convexity Constraints
cites work: Ironing, Sweeping, and Multidimensional Screening
cites work: Convex Analysis
cites work: A method to convexify functions via curve evolution
DOI: 10.1007/S00245-016-9361-5
description: scientific article; zbMATH DE number 6837691