Мобильная версия

Доступно журналов:

3 288

Доступно статей:

3 891 637

 

Скрыть метаданые

Автор Tuy, Hoang
Автор Khatchaturov, V.
Автор Utkin, S.
Дата выпуска 1987
dc.description A class of exhaustive cone splitting procedures is developed and is shown to perform substantially better than the bisection procedure in conical algorithms for concave minimization. Computational experiments are reported and discussed.
Формат application.pdf
Издатель Akademic-Verlag
Копирайт Copyright Taylor and Francis Group, LLC
Тема Cone splitting
Тема exhaustive procedure
Тема conical algorithm
Тема concave minimization
Тема Primary: 90 C 30
Тема Secondary: 65 K 05
Тема Secondary: 65 K 10
Название A class of exhaustive cone splitting procedures in conical algorithms for concave minmization
Тип research-article
DOI 10.1080/02331938708843294
Electronic ISSN 1029-4945
Print ISSN 0233-1934
Журнал Optimization
Том 18
Первая страница 791
Последняя страница 807
Аффилиация Tuy, Hoang; Institute of Mathematics, Vien Toán Hoc
Аффилиация Khatchaturov, V.; Academy of Sciences, Computer Center
Аффилиация Utkin, S.; Academy of Sciences, Computer Center
Выпуск 6
Библиографическая ссылка Hamami, M. 1982. “Finitely Convergent Tuy-type Algorithms for Concave Minimization”. In Ph. D. Dissertation, Los Angeles: University of California.
Библиографическая ссылка Jacobsen, S.E. 1981. Convergence of a TuY-type Algorithm for Concave Minimization Subject to Linear Inequality Constraints. Applied Mathematics and Optimization, 7: 1–9.
Библиографическая ссылка Thoai, Ng.V and Tuy, H. 1980. Convergent Algorithm for Minimizing a Concave Function. Mathematics of Operations Research, 5: 556–566.
Библиографическая ссылка Tuy, H. 1964. Concave Programming Under Linear Constraints. DokladyAkad. Nauk SSSR, 159: 32–35. Translated (1964). Soviet Mathematics 5 (1964) 1437-1440
Библиографическая ссылка Tuy, H., Thieu, T.V. and Thai, Ng.Q. 1985. A Conical Algorithm for Globally Minimizing a Concave Function Over a Closed Convex Set. Mathematics of Operations Research, 10: 498–514.
Библиографическая ссылка Tuy, H. 1986. “A General Deterministic Approach to Global Optimization via D. C. Programming”. In Fermat Days 1985:Mathematics for Optimization Mathematical Studies Series, North-Holland. forthcoming
Библиографическая ссылка Tuy, H. and Horst, R. 1985. “Convergence and Restart in Branch and Bound Algorithms for Global Optimization”. In Application to Concave Minimization and D. C. Optimization Problems, Hanoi: Institute of Mathematics. Preprint

Скрыть метаданые