|
MATHEMATICS
A search for the global minimum in nonconvex programming problems
with dependencies that are biseparable superpositions of convex
functions
E. S. Levitinab, I. L. Khranovichab a Institute for Systems Analysis of Russian Academy of Sciences, Moscow
b Water Problems Institute of the Russian Academy of Sciences, Moscow
Citation:
E. S. Levitin, I. L. Khranovich, “A search for the global minimum in nonconvex programming problems
with dependencies that are biseparable superpositions of convex
functions”, Dokl. Akad. Nauk, 350:2 (1996), 166–169
Linking options:
https://www.mathnet.ru/eng/dan4010 https://www.mathnet.ru/eng/dan/v350/i2/p166
|
Statistics & downloads: |
Abstract page: | 105 | Full-text PDF : | 36 | References: | 1 |
|