## 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 β¦
The maximization of a function over the efficient set via a penalty function approach
β Scribed by D.J. White
- Publisher
- Elsevier Science
- Year
- 1996
- Tongue
- English
- Weight
- 701 KB
- Volume
- 94
- Category
- Article
- ISSN
- 0377-2217
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
Maximization of a matrix function relate
β
Gi-Sang Cheon; Suk-Geun Hwang
π
Article
π
1992
π
Elsevier Science
π
English
β 604 KB
Toward a global maximization of the mole
β
Constans, Pere; Amat, LluοΏ½s; CarbοΏ½-Dorca, Ramon
π
Article
π
1997
π
John Wiley and Sons
π
English
β 307 KB
π 1 views
A quantum similarity measure between two molecules is normally identified with the maximum value of the overlap of the corresponding molecular electron densities. The electron density overlap is a function of the mutual positioning of the compared molecules, requiring the measurement of similarity,
On the value of a stopped set function p
β
Klaus D. Schmidt
π
Article
π
1980
π
Elsevier Science
π
English
β 423 KB
An interior penalty function method for
β
Ronald J Stern; Adi Ben-Israel
π
Article
π
1974
π
Elsevier Science
π
English
β 363 KB
A dynamic penalty function method for th
β
J.A. Snyman; Nielen Stander; W.J. Roux
π
Article
π
1994
π
Elsevier Science
π
English
β 876 KB