## Abstract The purpose of this article is to present an algorithm for globally maximizing the ratio of two convex functions __f__ and __g__ over a convex set __X__. To our knowledge, this is the first algorithm to be proposed for globally solving this problem. The algorithm uses a branch and bound
β¦ LIBER β¦
A characterization of convex functions
β Scribed by Dinh The Luc; S. Swaminathan
- Publisher
- Elsevier Science
- Year
- 1993
- Tongue
- English
- Weight
- 325 KB
- Volume
- 20
- Category
- Article
- ISSN
- 0362-546X
No coin nor oath required. For personal study only.
π SIMILAR VOLUMES
Maximizing the ratio of two convex funct
β
Harold P. Benson
π
Article
π
2006
π
John Wiley and Sons
π
English
β 126 KB
Uniform approximation by quasi-convex an
β
Vasant A Ubhaya
π
Article
π
1988
π
Elsevier Science
π
English
β 514 KB
Lp approximation by quasi-convex and con
β
Vasant A Ubhaya
π
Article
π
1989
π
Elsevier Science
π
English
β 698 KB
On characterization of convexity for reg
β
DuΕ‘an BednaΕΔ±Μk; Karel Pastor
π
Article
π
2004
π
Elsevier Science
π
English
β 225 KB
Multioptimum of a convex functional
β
D.V Pai
π
Article
π
1977
π
Elsevier Science
π
English
β 920 KB
Monotonic Averages of Convex Functions
β
Grahame Bennett; Graham Jameson
π
Article
π
2000
π
Elsevier Science
π
English
β 133 KB
We investigate the monotonicity of various averages of the values of a convex or . concave function at n equally spaced points. For a convex function, averages without end points increase with n, while averages with end points decrease. Averages including one end point are treated as a special case