A Numerical Approach to the Estimation of the Solutions of some Variational Problems with Convexity Costraints

2008/03/06 by Ivar Ekeland, Ekeland, Ivar, Santiago Moreno +1
Mathematics · #49-04 #49M25 #49M37 #65K10 #91B30 #91B32 #FOS: Mathematics #Optimization and Control (math.OC) #math.OC #msc:49-04 #msc:49M25 #msc:49M37 #msc:65K10 #msc:91B30 #msc:91B32

paper · pdf · doi:10.48550/arxiv.0803.0904

21 pages, 7 figures

arxiv created 2008/03/06 · arxiv updated 2009/12/01

Abstract

We present an algorithm to approximate the solutions to variational problems where set of admissible functions consists of convex functions. The main motivator behind this numerical method is estimating solutions to Adverse Selection problems within a Principal-Agent framework. Problems such as product lines design, optimal taxation, structured derivatives design, etc. can be studied through the scope of these models. We develop a method to estimate their optimal pricing schedules.

Related

• A numerical method for variational problems with convexity constraints
• Handling convexity-like constraints in variational problems
• A duality and free boundary approach to adverse selection
• C^1,α regularity of variational problems with a convexity constraint
• Automatic Repair of Convex Optimization Problems