Skip to main content
Log in

On the convexity of the multiplicative potential and penalty functions and related topics

  • Published:
Mathematical Programming Submit manuscript

Abstract.

It is well known that a function f of the real variable x is convex if and only if (x,y)→yf(y -1 x),y>0 is convex. This is used to derive a recursive proof of the convexity of the multiplicative potential function. In this paper, we obtain a conjugacy formula which gives rise, as a corollary, to a new rule for generating new convex functions from old ones. In particular, it allows to extend the aforementioned property to functions of the form (x,y)→g(y)f(g(y)-1 x) and provides a new tool for the study of the multiplicative potential and penalty functions.

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

Access this article

Subscribe and save

Springer+ Basic
$34.99 /Month
  • Get 10 units per month
  • Download Article/Chapter or eBook
  • 1 Unit = 1 Article or 1 Chapter
  • Cancel anytime
Subscribe now

Buy Now

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Similar content being viewed by others

Author information

Authors and Affiliations

Authors

Additional information

Received: June 3, 1999 / Accepted: September 29, 2000¶Published online January 17, 2001

Rights and permissions

Reprints and permissions

About this article

Cite this article

Maréchal, P. On the convexity of the multiplicative potential and penalty functions and related topics. Math. Program. 89, 505–516 (2001). https://doi.org/10.1007/PL00011412

Download citation

  • Issue Date:

  • DOI: https://doi.org/10.1007/PL00011412