|
Numerical methods and programming, 2006, Volume 7, Issue 3, Pages 273–277
(Mi vmp603)
|
|
|
|
This article is cited in 2 scientific papers (total in 2 papers)
Вычислительные методы и приложения
An accelerated parallel projection method for solving the minimum length problem
D. V. Dolgy, E. A. Nurminski Institute for Automation and Control Processes, Far Eastern Branch of the Russian Academy of Sciences, Vladivostok
Abstract:
The problem of determining the minimum-length vector in the simplex of finite-dimensional Euclidean space is
considered. A finite accelerated parallel algorithm for solving this problem is proposed.
Keywords:
imbedded decomposition method, projection problem, simplex of finite-dimensional Euclidean space, parallel algorithms.
Citation:
D. V. Dolgy, E. A. Nurminski, “An accelerated parallel projection method for solving the minimum length problem”, Num. Meth. Prog., 7:3 (2006), 273–277
Linking options:
https://www.mathnet.ru/eng/vmp603 https://www.mathnet.ru/eng/vmp/v7/i3/p273
|
Statistics & downloads: |
Abstract page: | 113 | Full-text PDF : | 58 | References: | 1 |
|