RUS  ENG
Full version
JOURNALS // Numerical methods and programming // Archive
Num. Meth. Prog., 2006 Volume 7, Issue 3, Pages 273–277 (Mi vmp603)
This article is cited 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.

UDC: 519.853.3


© Steklov Math. Inst. of RAS, 2024