Skip to main content

Generating Convex Functions

  • Chapter
  • 654 Accesses

Part of the book series: Nonconvex Optimization and Its Applications ((NOIA,volume 54))

Abstract

A functional operation that generates convex functions on ℝn +m from convex functions on ℝn and ℝm originated from the study of the multiplicative potential function. We review some of the properties of this functional operation, including associativity, right distributivity with respect to addition and left distributivity with respect to infimal convolution. We also show how it can be used to build a generalized version of the multiplicative potential function.

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

Buying options

Chapter
USD   29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD   129.00
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD   169.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info
Hardcover Book
USD   169.99
Price excludes VAT (USA)
  • Durable hardcover 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

Learn about institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. M. Avriel, W. E. Diewert, S. Schaible and I. Zang, Generalized Convexity, ( Plenum Press, New York and London, 1988 )

    Google Scholar 

  2. J.M. Borwein, “A generalization of Young’s l p inequality,” Mathematical Inequalities and Applications 1, (1998) 131–136.

    MathSciNet  Google Scholar 

  3. J.P. Crouzeix, J.A. Ferland and S. Schaible, “Generalized convexity on affine subspaces with an application to potential functions,” Mathematical Programming 56, (1992) 223–232.

    Article  MathSciNet  Google Scholar 

  4. I. Imai, “On the convexity of the multiplicative version of Karmarkar’s potential function,” Mathematical Programming40, (1988) 29–32.

    Article  MathSciNet  Google Scholar 

  5. M. Iri and I. Imai, “A multiplicative barrier function method for linear programming,” Algorithmica 1, (1986) 455–482.

    Article  MathSciNet  Google Scholar 

  6. J.-B. Hiriart-Urruty and C. Lemaréchal, Convex Analysis and Minimization Algorithms, I and II, (Springer-Verlag, Berlin, 1993).

    Google Scholar 

  7. P. Maréchal, “On the convexity of the multiplicative potential and penalty functions and related topics,” to appear in Mathematical Programming.

    Google Scholar 

  8. P. Maréchal, “On a functional operation that generates new convex functions from old ones,” submitted to Transactions of the American Mathematical Society.

    Google Scholar 

  9. R.T. Rockafellar, Convex Analysis, (Princeton University Press, Princeton, N.J., 1970 ).

    MATH  Google Scholar 

  10. S. Schaible, “Quasi-convex optimization in general real linear spaces,” Zeitschrift fuer Operations Research 16, (1972) 205–213.

    MathSciNet  Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2001 Kluwer Academic Publishers

About this chapter

Cite this chapter

Maréchal, P. (2001). Generating Convex Functions. In: Hadjisavvas, N., Pardalos, P.M. (eds) Advances in Convex Analysis and Global Optimization. Nonconvex Optimization and Its Applications, vol 54. Springer, Boston, MA. https://doi.org/10.1007/978-1-4613-0279-7_21

Download citation

  • DOI: https://doi.org/10.1007/978-1-4613-0279-7_21

  • Publisher Name: Springer, Boston, MA

  • Print ISBN: 978-0-7923-6942-4

  • Online ISBN: 978-1-4613-0279-7

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics