Numerische Mathematik

, Volume 111, Issue 1, pp 1–34 | Cite as

Approximating optimization problems over convex functions

Article
First Online:
Received:
Revised:

Abstract

Many problems of theoretical and practical interest involve finding an optimum over a family of convex functions. For instance, finding the projection on the convex functions in H k (Ω), and optimizing functionals arising from some problems in economics. In the continuous setting and assuming smoothness, the convexity constraints may be given locally by asking the Hessian matrix to be positive semidefinite, but in making discrete approximations two difficulties arise: the continuous solutions may be not smooth, and functions with positive semidefinite discrete Hessian need not be convex in a discrete sense. Previous work has concentrated on non-local descriptions of convexity, making the number of constraints to grow super-linearly with the number of nodes even in dimension 2, and these descriptions are very difficult to extend to higher dimensions. In this paper we propose a finite difference approximation using positive semidefinite programs and discrete Hessians, and prove convergence under very general conditions, even when the continuous solution is not smooth, working on any dimension, and requiring a linear number of constraints in the number of nodes. Using semidefinite programming codes, we show concrete examples of approximations to problems in two and three dimensions.

Mathematics Subject Classification (2000)

52B55 65D15 90C90 
This is a preview of subscription content, log in to check access.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. 1.
    Birke M., Dette H.: Estimating a convex function in nonparametric regression. Scand. J. Stat. 34(2), 384–404 (2007)MATHCrossRefMathSciNetGoogle Scholar
  2. 2.
    Borchers B.: CSDP, A C library for semidefinite programming. Optim. Methods Softw. 11(1), 613–623 (1999)CrossRefMathSciNetGoogle Scholar
  3. 3.
    Buttazzo G., Guasoni P.: Shape optimization problems over classes of convex domains. J. Convex Anal. 4(2), 343–351 (1997)MATHMathSciNetGoogle Scholar
  4. 4.
    Buttazzo G., Ferone V., Kawohl B.: Minimum problems over sets of concave functions and related questions. Math. Nachr. 173, 71–89 (1995)MATHCrossRefMathSciNetGoogle Scholar
  5. 5.
    Carlier G., Lachand-Robert T.: Regularity of solutions for some variational problems subject to a convexity constraint. Commun. Pure Appl. Math. LIV, 583–594 (2001)CrossRefMathSciNetGoogle Scholar
  6. 6.
    Carlier G., Lachand-Robert T., Maury B.: A numerical approach to variational problems subject to convexity constraint. Numer. Math. 88(2), 299–318 (2001)MATHCrossRefMathSciNetGoogle Scholar
  7. 7.
    Eaton, J.W.: GNU octave manual, Network Theory Limited (2002) http://www.octave.org
  8. 8.
    Groeneboom P., Jonglbloed G., Wellner J.A.: Estimation of a convex function: characterizations and asymptotic theory. Ann. Stat. 29(6), 1653–1698 (2001)MATHCrossRefGoogle Scholar
  9. 9.
    Hanson D.L., Pledger G.: Consistency in concave regression. Ann. Stat. 4(6), 1038–1050 (1676)CrossRefMathSciNetGoogle Scholar
  10. 10.
    Hoffman A.J., Wielandt H.W.: The variation of the spectrum of a normal matrix. Duke Math. J. 20, 37–39 (1953)MATHCrossRefMathSciNetGoogle Scholar
  11. 11.
    Lachand-Robert T., Oudet É.: Minimizing within convex bodies using a convex hull method. SIAM J. Optim. 16(2), 368–379 (2005)MATHCrossRefMathSciNetGoogle Scholar
  12. 12.
    Lachand-Robert T., Peletier M.A.: Extremal points of a functional on the set of convex functions. Proc. Am. Math. Soc. 127(6), 1723–1727 (1999)MATHCrossRefMathSciNetGoogle Scholar
  13. 13.
    Lachand-Robert T., Peletier M.A.: Newton’s problem of the body of minimal resistance in the class of convex developable functions. Math. Nachr. 226, 153–176 (2001)MATHCrossRefMathSciNetGoogle Scholar
  14. 14.
    Manelli A.M., Vincent D.R.: Multidimensional mechanism design: revenue maximization and the multiple-good monopoly. J. Econ. Theory 137, 153–185 (2007)MATHCrossRefGoogle Scholar
  15. 15.
    Meyer M.C.: Consistency and power in tests with shape-restricted alternatives. J. Stat. Plan. Inference 136, 3931–3947 (2006)MATHCrossRefGoogle Scholar
  16. 16.
    Murota K., Shioura A.: Relationship of M-/L-convex functions with discrete convex functions by Miller and by Favati-Tardella. Discrete Appl. Math. 115, 151–176 (2001)MATHCrossRefMathSciNetGoogle Scholar
  17. 17.
    Rochet J.-C., Choné P.: Ironing, sweeping and multidimensional screening. Econometrica 66, 783–826 (1998)MATHCrossRefGoogle Scholar
  18. 18.
    Shih, T.D., Chen, V.C.P., Kim, S.B.: Convex version of multivariate adaptive regression splines for optimization (2006). http://students.uta.edu/dt/dts5878/convexMARS.pdf
  19. 19.
    Rockafellar R.T.: Convex analysis. Princeton University Press, Princeton (1970)MATHGoogle Scholar
  20. 20.
    Vandenberghe L., Boyd S.: Semidefinite programming. SIAM Rev. 38(1), 49–95 (1996)MATHCrossRefMathSciNetGoogle Scholar
  21. 21.
    Wolfram Research, Inc.: Mathematica, version 6.0. Wolfram Research, Inc (2007)Google Scholar
  22. 22.
    Ziemer W.P.: Weakly differentiable functions: Sobolev spaces and functions of bounded variation. Springer, Heidelberg (1989)MATHGoogle Scholar

Copyright information

© Springer-Verlag 2008

Authors and Affiliations

  1. 1.Consejo Nacional de Investigaciones Científicas y Técnicas and Universidad Nacional del LitoralSanta FeArgentina

Personalised recommendations