본문 바로가기
KERD
논문KCI 등재

Accelerated parallel projection method for solving the shortest distance problem

0

조회

0

다운로드

0

인용

0

참고문헌

키워드

주제분류수학

초록

We consider the problem of finding the vector of minimum length in the simplex of finite dimensional Euclidean space. A final accelerated parallel algorithm for solving this problem is proposed.

Abstract

We consider the problem of finding the vector of minimum length in the simplex of finite dimensional Euclidean space. A final accelerated parallel algorithm for solving this problem is proposed.

참고문헌 (7)

  1. Kononov I.V, "Methods for solving finite-variation inequalities", DAS, ~ (1998)
  2. "Acceleration of iterative methods for the projection on the polyhedron// Investigated in Russia" (2005)[URL]
  3. Nurminski E.A, "Method of suitable affine subspaces for the projection on the simplex", Journal of Computational Mathematics and Mathematical Physics, 45(11), pp.1996~2004 (2005)
  4. Zhang J, "Some recent advances in projections-type methods for variation inequalities", Journal of Computational and Applied Mathematics, 152(1), pp.559~585 (2003)
  5. Panin V.M., "Models and methods finite variation inequalities", pp.2000, 47~64
  6. Nurminski E.A, "A parallel method of projection into the convex envelope of a family of sets", Izvestiya VUZov. Math, 12(499), pp.78~82 (2003)
  7. "GNU Octave"[URL]

관련 논문AI추천

이 간행물의 다른 논문 (17건)