메뉴 건너뛰기




Volumn 21, Issue 3, 2005, Pages 314-319

A note on level-2 condition numbers

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTATIONAL COMPLEXITY; ERROR ANALYSIS; MATRIX ALGEBRA; NUMERICAL ANALYSIS; PERTURBATION TECHNIQUES; SET THEORY; THEOREM PROVING;

EID: 18144403812     PISSN: 0885064X     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.jco.2004.06.004     Document Type: Article
Times cited : (10)

References (12)
  • 1
    • 18144418311 scopus 로고    scopus 로고
    • Solving linear programs with finite precision: I. Condition numbers and random programs
    • D. Cheung F. Cucker Solving linear programs with finite precision I. Condition numbers and random programs Math. Program. 99 2004 175-196
    • (2004) Math. Program. , vol.99 , pp. 175-196
    • Cheung, D.1    Cucker, F.2
  • 2
    • 18144426903 scopus 로고    scopus 로고
    • Solving linear programs with finite precision: II
    • preprint
    • D. Cheung, F. Cucker, Solving linear programs with finite precision: II. Algorithms, 2004, preprint.
    • (2004) Algorithms
    • Cheung, D.1    Cucker, F.2
  • 3
    • 3142757851 scopus 로고    scopus 로고
    • Unifying condition numbers for linear programming
    • D. Cheung F. Cucker J. Peña Unifying condition numbers for linear programming Math. Oper. Res. 28 2003 609-624
    • (2003) Math. Oper. Res. , vol.28 , pp. 609-624
    • Cheung, D.1    Cucker, F.2    Peña, J.3
  • 5
    • 0001345156 scopus 로고
    • On condition numbers and the distance to the nearest ill-posed problem
    • J. Demmel On condition numbers and the distance to the nearest ill-posed problem Numer. Math. 51 1987 251-289
    • (1987) Numer. Math. , vol.51 , pp. 251-289
    • Demmel, J.1
  • 6
    • 0000802374 scopus 로고
    • The approximation of one matrix by another of lower rank
    • C. Eckart G. Young The approximation of one matrix by another of lower rank Psychometrika 1 1936 211-218
    • (1936) Psychometrika , vol.1 , pp. 211-218
    • Eckart, C.1    Young, G.2
  • 8
    • 0041316314 scopus 로고
    • Condition numbers and their condition numbers
    • D. Higham Condition numbers and their condition numbers Linear Algebra Appl. 214 1995 193-215
    • (1995) Linear Algebra Appl. , vol.214 , pp. 193-215
    • Higham, D.1
  • 10
    • 84949482231 scopus 로고
    • Is it possible to know a problem instance is ill-posed?
    • J. Renegar Is it possible to know a problem instance is ill-posed? J. Complexity 10 1994 1-56
    • (1994) J. Complexity , vol.10 , pp. 1-56
    • Renegar, J.1
  • 11
    • 0000208672 scopus 로고
    • Incorporating condition measures into the complexity theory of linear programming
    • J. Renegar Incorporating condition measures into the complexity theory of linear programming SIAM J. Optim. 5 1995 506-524
    • (1995) SIAM J. Optim. , vol.5 , pp. 506-524
    • Renegar, J.1
  • 12
    • 0029195774 scopus 로고
    • Linear programming, complexity theory and elementary functional analysis
    • J. Renegar Linear programming, complexity theory and elementary functional analysis Math. Program. 70 1995 279-351
    • (1995) Math. Program. , vol.70 , pp. 279-351
    • Renegar, J.1


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