A convexity theorem for multiplicative functions
From MaRDI portal
Recommendations
Cites work
- A Generalization of Young's ℓ^p Inequality
- A branch and bound algorithm for solving low rank linear multiplicative and fractional programming problems
- A multiplicative barrier function method for linear programming
- Convex Analysis
- Generalized convexity on affine subspaces with an application to potential functions
- Global minimization of a generalized convex multiplicative function
- On a class of convex sets and functions
- On a functional operation generating convex functions. I: Duality
- On a functional operation generating convex functions. II: Algebraic properties
- On the convexity of the multiplicative potential and penalty functions and related topics
- On the convexity of the multiplicative version of Karmarkar's potential function
- \(NP\)-hardness of linear multiplicative programming and related problems
Cited in
(7)- Describing multiplicative convex functions
- Coefficient convexity of divisors of xn - 1
- Generating convex functions.
- A Capelli type theorem for multiplicative convolutions of polynomials
- scientific article; zbMATH DE number 7470558 (Why is no real title available?)
- Applications of convex analysis within mathematics
- Exponential generalization of Newman's inequality and Klamkin's inequality
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)
