메뉴 건너뛰기




Volumn 1184, Issue , 1996, Pages 565-574

The parallel surrogate constraint approach to the linear feasibility problem

Author keywords

Distributed computing; Linear and convex feasibility; Parallel algorithms; Projection methods

Indexed keywords

DISTRIBUTED COMPUTER SYSTEMS; IMAGE RECONSTRUCTION; MEDICAL IMAGING; MEDICAL PROBLEMS; PARALLEL ALGORITHMS;

EID: 21444449958     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-62095-8_61     Document Type: Conference Paper
Times cited : (3)

References (9)
  • 1
  • 3
    • 0001001503 scopus 로고
    • Parallel Projected Aggregation Methods for Solving the Convex Feasibility Problem
    • Garcfa Palomares, U. M.: Parallel Projected Aggregation Methods for Solving the Convex Feasibility Problem. SIAM Journal on Optimization, 3-4:882-900, November 1993.
    • (1993) SIAM Journal on Optimization , Issue.3-4 , pp. 882-900
    • Garcfa Palomares, U.M.1


* 이 정보는 Elsevier사의 SCOPUS DB에서 KISTI가 분석하여 추출한 것입니다.