A convexity theorem for multiplicative functions
From MaRDI portal
Publication:691470
DOI10.1007/S11590-011-0277-3zbMATH Open1262.90132OpenAlexW2005338279MaRDI QIDQ691470FDOQ691470
Authors: Pierre Maréchal 
Publication date: 30 November 2012
Published in: Optimization Letters (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s11590-011-0277-3
Recommendations
Cites Work
- Convex Analysis
- \(NP\)-hardness of linear multiplicative programming and related problems
- A branch and bound algorithm for solving low rank linear multiplicative and fractional programming problems
- A Generalization of Young's ℓ^p Inequality
- On a functional operation generating convex functions. II: Algebraic properties
- Global minimization of a generalized convex multiplicative function
- A multiplicative barrier function method for linear programming
- On a functional operation generating convex functions. I: Duality
- On the convexity of the multiplicative version of Karmarkar's potential function
- Generalized convexity on affine subspaces with an application to potential functions
- On a class of convex sets and functions
- On the convexity of the multiplicative potential and penalty functions and related topics
Cited In (7)
- Coefficient convexity of divisors of xn - 1
- Generating convex functions.
- A Capelli type theorem for multiplicative convolutions of polynomials
- Title not available (Why is that?)
- Applications of convex analysis within mathematics
- Exponential generalization of Newman's inequality and Klamkin's inequality
- Describing multiplicative convex functions
This page was built for publication: A convexity theorem for multiplicative functions
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q691470)
