๐”– Bobbio Scriptorium
โœฆ   LIBER   โœฆ

Minimum discrimination information problems via generalized geometric programming

โœ Scribed by Detong Zhu

Book ID
107500639
Publisher
SP Editorial Committee of Applied Mathematics - A Journal of Chinese Universities
Year
2003
Tongue
English
Weight
436 KB
Volume
18
Category
Article
ISSN
1005-1031

No coin nor oath required. For personal study only.

๐Ÿ“œ SIMILAR VOLUMES

Two problems with GGP generalized geomet
Two problems with GGP generalized geometric programming algorithm
โœ Yeh, Alexander ๐Ÿ“‚ Article ๐Ÿ“… 1993 ๐Ÿ› John Wiley and Sons ๐ŸŒ English โš– 386 KB

The generalized geometric programming algorithm GGP has been found to be one of the better algorithms for optimizing algebraic functions subject to algebraic constraints. The paper discusses two problems with the GGP algorithm presented by Avriel et al. (1980). The first problem is that, because of

Optimality criteria for general unconstr
Optimality criteria for general unconstrained geometric programming problems
โœ Tibor Illรฉs ๐Ÿ“‚ Article ๐Ÿ“… 1991 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 393 KB

This paper presents a possible generalization of geometric programming problems. Such a generalization was proposed by Paterson [6], based on Roc.l~eUar's [8] conjugate function theory. Using their results, we define a slightly different, more symmetric dual pair of general unconstrained geometric