메뉴 건너뛰기




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

Author keywords

computational linear algebra; linear time algorithm; Orthogonal projections; subgradient methods

Indexed keywords

CLUSTERING ALGORITHMS; GEOMETRY;

EID: 0038542012     PISSN: 00223239     EISSN: None     Source Type: Journal    
DOI: 10.1023/A:1023997605430     Document Type: Article
Times cited : (40)

References (11)
  • 2
  • 4
    • 9744230896 scopus 로고    scopus 로고
    • Université Libre de Bruxelles, Institut de Statistique et de Recherche Opérationnelle, PhD Thesis
    • WYNANTS, C., Network Synthesis Problems, Université Libre de Bruxelles, Institut de Statistique et de Recherche Opérationnelle, PhD Thesis, 1999.
    • (1999) Network Synthesis Problems
    • Wynants, C.1
  • 6
    • 0021479943 scopus 로고
    • An O(n) Algorithm for Quadratic Knapsack Problems
    • BRUCKER, P., An O(n) Algorithm for Quadratic Knapsack Problems, Operations Research Letters, Vol. 3, pp. 163-166, 1984.
    • (1984) Operations Research Letters , vol.3 , pp. 163-166
    • Brucker, P.1
  • 8
    • 0000859664 scopus 로고
    • An Algorithm for a Singly Constrained Class of Quadratic Programs Subject to Upper and Lower Bounds
    • PARDALOS, P. M., and KOVOOR, N., An Algorithm for a Singly Constrained Class of Quadratic Programs Subject to Upper and Lower Bounds, Mathematical Programming, Vol. 46, pp. 321-328, 1990.
    • (1990) Mathematical Programming , vol.46 , pp. 321-328
    • Pardalos, P.M.1    Kovoor, N.2
  • 11
    • 0017495556 scopus 로고
    • An Effective Subgradient Procedure for Minimal Cost Multicommodity Flow Problems
    • KENNINGHON, J., and SHALABY, M., An Effective Subgradient Procedure for Minimal Cost Multicommodity Flow Problems, Management Science, Vol. 23, pp. 994-1004, 1977.
    • (1977) Management Science , vol.23 , pp. 994-1004
    • Kenninghon, J.1    Shalaby, M.2


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