|
Diskretnyi Analiz i Issledovanie Operatsii, 2008, Volume 15, Issue 3, Pages 3–10
(Mi da529)
|
|
|
|
This article is cited in 1 scientific paper (total in 1 paper)
Efficient methods for solving convex programming problems that apply embedding of admissible set in simplexes
V. P. Bulatova, T. I. Belykhb, È. N. Yas'kovaa a L. A. Melentiev Energy Systems Institute, Siberian Branch of the Russian Academy of Sciences
b Baikal National University of Economics and Law
Abstract:
A variant of the embedding method is proposed. In previous proposed variants the support cones played the role of embedding sets. Here the cones are replaced with support simplexes which enables one to obtain a polynomial guaranteed convergence rate and its best mean estimate. Tabl. 1, illustr. 2, bibl. 5.
Keywords:
convex cone, support cone, Chebyshev point, support simplex.
Received: 17.10.2007 Revised: 25.03.2008
Citation:
V. P. Bulatov, T. I. Belykh, È. N. Yas'kova, “Efficient methods for solving convex programming problems that apply embedding of admissible set in simplexes”, Diskretn. Anal. Issled. Oper., 15:3 (2008), 3–10
Linking options:
https://www.mathnet.ru/eng/da529 https://www.mathnet.ru/eng/da/v15/i3/p3
|
Statistics & downloads: |
Abstract page: | 611 | Full-text PDF : | 229 | References: | 47 | First page: | 2 |
|