Skip to main content

On Locally Polyhedral Convex Functions

  • Chapter
Trends in Mathematical Optimization

Abstract

A specific property of convex functions, which is called the diff-max property, plays an important role in some aspects of optimization. This paper shows that in a finite dimensional space a closed proper convex function has this property if and only if it is locally polyhedral. A preliminary study of closed locally polyhedral convex sets is provided and a survey of some applications of the diff-max property in optimization is given.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 39.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 54.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Bastiani, A.: Polyèdres convexes de dimension quelconque. Cptes Rendus Ac. Sc. Paris 247 (1958), 1943–1946.

    Google Scholar 

  2. Bastiani, A.: Cones convexes et pyramides convexes. Ann. Inst. Fourier 9 (1959), 249–292.

    Article  Google Scholar 

  3. Brondsted, A.: An introduction to convex polyhedra. Springer-Verlag, Berlin (1983).

    Google Scholar 

  4. Durier, R.: Weighting factor results in vector optimization. Working Paper, University of Dijon (1985).

    Google Scholar 

  5. Durier, R.: On efficient points and Fermât-Weber problem. Working Paper, University of Dijon (1985).

    Google Scholar 

  6. Durier, R.: Meilleure approximation en norme vectorielle et théorie de la localisation. RAIRO Modélisation Mathématique et Analyse Numérique (1986), forth-coming.

    Google Scholar 

  7. Durier, R. and Michelot, C.: Sets of efficient points in a normed space. J. of Math. Anal, and Appi. (1986), forthcoming.

    Google Scholar 

  8. Klee, V.: Some characterizations of convex polyhedra. Acta Math. 102 (1959), 79–107.

    Article  Google Scholar 

  9. Lefebvre, O. and Michelot, C.: A primal-dual algorithm for the Fermât-Weber problem involving mixed gauges. Working Paper, University of Dijon (1986).

    Google Scholar 

  10. Lefebvre, O. and Michelot, C.: Calcul d’un point fixe d’une application prox par la méthode des approximations successives: conditions de convergence finie. Working Paper, University of Dijon (1986).

    Google Scholar 

  11. Robert, F.: Meilleure approximation en norme vectorielle et minima de Pareto. RAIRO Modélisation Mathématique et Analyse Numérique 19 (1985), 89–110.

    Google Scholar 

  12. Rockafellar, R. T.: Convex Analysis. Princeton University Press, Princeton (1970).

    Google Scholar 

  13. Spingarn, J. E.: Partial inverse of a monotone operator. Appi. Math, and Optimization 10 (1983), 247–265.

    Article  Google Scholar 

  14. Valentine, F. A.: Convex sets. Mac Graw Hill, New York (1964).

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 1988 Birkhäuser Verlag Basel

About this chapter

Cite this chapter

Durier, R. (1988). On Locally Polyhedral Convex Functions. In: Hoffmann, KH., Zowe, J., Hiriart-Urruty, JB., Lemarechal, C. (eds) Trends in Mathematical Optimization. International Series of Numerical Mathematics/Internationale Schriftenreihe zur Numerischen Mathematik/Série internationale d’Analyse numérique, vol 84. Birkhäuser Basel. https://doi.org/10.1007/978-3-0348-9297-1_4

Download citation

  • DOI: https://doi.org/10.1007/978-3-0348-9297-1_4

  • Publisher Name: Birkhäuser Basel

  • Print ISBN: 978-3-0348-9984-0

  • Online ISBN: 978-3-0348-9297-1

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics