|
Volumn 117, Issue 3, 2003, Pages 553-574
|
An O(n) algorithm for projecting a vector on the intersection of a hyperplane and a box in ℝn
a a a a |
Author keywords
computational linear algebra; linear time algorithm; Orthogonal projections; subgradient methods
|
Indexed keywords
CLUSTERING ALGORITHMS;
GEOMETRY;
COMPUTATIONAL LINEAR ALGEBRA;
COMPUTATIONAL RESULTS;
FINDING ALGORITHM;
LINEAR TIME;
LINEAR-TIME ALGORITHMS;
ORTHOGONAL PROJECTION;
SUB-GRADIENT METHODS;
TIME ALGORITHMS;
TIME COMPLEXITY;
VECTORS;
|
EID: 0038542012
PISSN: 00223239
EISSN: None
Source Type: Journal
DOI: 10.1023/A:1023997605430 Document Type: Article |
Times cited : (40)
|
References (11)
|