Skip to main content
Log in

A convexity theorem for multiplicative functions

  • Original Paper
  • Published:
Optimization Letters Aims and scope Submit manuscript

Abstract

We generalize a well known convexity property of the multiplicative potential function. We prove that, given any convex function \({g : \mathbb{R}^m \rightarrow [{0}, {\infty}]}\), the function \({({\rm \bf x},{\rm \bf y})\mapsto g({\rm \bf x})^{1+\alpha}{\bf y}^{-{\bf \beta}}, {\bf y}>{\bf 0}}\), is convex if β ≥ 0 and α ≥ β 1 + ··· + β n . We also provide further generalization to functions of the form \({({\rm \bf x},{\rm \bf y}_1, . . . , {y_n})\mapsto g({\rm \bf x})^{1+\alpha}f_1({\rm \bf y}_1)^{-\beta_1} \cdot \cdot \cdot f_n({\rm \bf y}_n)^{-\beta_n} }\) with the f k concave, positively homogeneous and nonnegative on their domains.

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

Access this article

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

Instant access to the full article PDF.

Similar content being viewed by others

References

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

    Google Scholar 

  2. Borwein J. M.: A generalization of Young’s l p inequality. Math. Inequalities Appl. 1, 131–136 (1998)

    MATH  Google Scholar 

  3. Crouzeix J.P., Ferland J.A., Schaible S.: Generalized convexity on affine subspaces with an application to potential functions. Math. Program 56, 223–232 (1992)

    Article  MathSciNet  MATH  Google Scholar 

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

    Google Scholar 

  5. Imai I.: On the convexity of the multiplicative version of Karmarkar’s potential function. Math. Program 40, 29–32 (1988)

    Article  MATH  Google Scholar 

  6. Iri, M., Imai, I.: A multiplicative penalty function method for linear programming—another ’new and fast’ algorithm. In: Proceedings of the 6th Mathematical Programming Symposium of Japan, pp. 97–120, Tokyo (1985)

  7. Iri M., Imai I.: A multiplicative barrier function method for linear programming. Algorithmica 1, 455–482 (1986)

    Article  MathSciNet  MATH  Google Scholar 

  8. Konno H., Kuno T., Yajima Y.: Global minimization of a generalized convex multiplicative function. J. Glob. Optim. 4(1), 47–62 (1994)

    Article  MathSciNet  MATH  Google Scholar 

  9. Konno H., Fukaishi K.: A branch and bound algorithm for solving low rank linear multiplicative and fractional programming problems. J. Glob. Optim. 18(3), 283–299 (2000)

    Article  MathSciNet  MATH  Google Scholar 

  10. Maréchal P.: On the convexity of the multiplicative and penalty functions and related topics. Math. Program. Ser. A 89, 505–516 (2001)

    Article  MATH  Google Scholar 

  11. Maréchal P.: On a functional operation generating convex functions. Part I: duality. J. Optim. Theory Appl. 126(1), 175–189 (2005)

    Article  MathSciNet  MATH  Google Scholar 

  12. Maréchal P.: On a functional operation generating convex functions. Part II: algebraic properties. J. Optim. Theory Appl. 126(2), 357–366 (2005)

    Article  MathSciNet  MATH  Google Scholar 

  13. Maréchal P.: On a class of convex sets and functions. Set Valued Anal. 13, 197–212 (2005)

    Article  MathSciNet  MATH  Google Scholar 

  14. Matsui T.: NP-hardness of linear multiplicative programming and related problems. J. Glob. Optim. 9(2), 113–119 (1996)

    Article  MathSciNet  MATH  Google Scholar 

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

    MATH  Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to Pierre Maréchal.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Maréchal, P. A convexity theorem for multiplicative functions. Optim Lett 6, 357–362 (2012). https://doi.org/10.1007/s11590-011-0277-3

Download citation

  • Received:

  • Accepted:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s11590-011-0277-3

Keywords

Navigation