메뉴 건너뛰기
Mathematical Programming, Series B
Volumn 90, Issue 1, 2001, Pages 59-69
Characterizations, bounds, and probabilistic analysis of two complexity measures for Linear Programming problems
Author keywords

Interior point methods; Linear programming; Probabilistic analysis
Indexed keywords

EID: 0003079802     PISSN: 00255610     EISSN: None     Source Type: Journal    
DOI: 10.1007/PL00011420     Document Type: Article
Times cited : (32)
References (17)
  • 1
    • 0010787663 scopus 로고
    • Average performance of a self-dual interior-point algorithm for linear programming
    • Pardalos, P.M., ed., World Scientific Publishing, London
    • Anstreicher, K.M., Ji, J., Potra, F., Ye, Y. (1992): Average performance of a self-dual interior-point algorithm for linear programming. In: Pardalos, P.M., ed., Complexity in Numerical Optimization, pp. 1-15. World Scientific Publishing, London
    • (1992) Complexity in Numerical Optimization , pp. 1-15
    • Anstreicher, K.M.1    Ji, J.2    Potra, F.3    Ye, Y.4
  • 2
    • 0033076102 scopus 로고    scopus 로고
    • Probabilistic analysis of an infeasible primal-dual algorithm for linear programming
    • Anstreicher, K.M., Ji, J., Potra, F., Ye, Y. (1999): Probabilistic analysis of an infeasible primal-dual algorithm for linear programming. Math. Oper. Res. 24, 176-192
    • (1999) Math. Oper. Res. , vol.24 , pp. 176-192
    • Anstreicher, K.M.1    Ji, J.2    Potra, F.3    Ye, Y.4
  • 3
    • 38249016652 scopus 로고
    • A geometric property of the least squares solution of linear equations
    • Ben-Tal, A., Teboulle, M. (1990): A geometric property of the least squares solution of linear equations. Lin. Alg. Appl. 139, 165-170
    • (1990) Lin. Alg. Appl. , vol.139 , pp. 165-170
    • Ben-Tal, A.1    Teboulle, M.2
  • 4
    • 0001935197 scopus 로고
    • On the speed of an iterative process
    • Dikin, I.I. (1974): On the speed of an iterative process. Upravlaemye Sistemy 12, 54-60
    • (1974) Upravlaemye Sistemy , vol.12 , pp. 54-60
    • Dikin, I.I.1
  • 5
    • 0030490110 scopus 로고    scopus 로고
    • On linear least-squares problems with diagonally dominant weight matrices
    • Forsgren, A. (1996): On linear least-squares problems with diagonally dominant weight matrices. SIAM J. Matrix Anal. Appl. 17, 763-788
    • (1996) SIAM J. Matrix Anal. Appl. , vol.17 , pp. 763-788
    • Forsgren, A.1
  • 6
    • 0041299939 scopus 로고
    • On the distribution of solution of systems of linear equations with random coefficients
    • Girko, V.L. (1974): On the distribution of solution of systems of linear equations with random coefficients. Theory of Probability and Mathematical Statistics 2, 41-44
    • (1974) Theory of Probability and Mathematical Statistics , vol.2 , pp. 41-44
    • Girko, V.L.1
  • 7
    • 0038913526 scopus 로고    scopus 로고
    • A note on properties of condition numbers
    • Gonzaaa, C.C., Lara, H. (1997): A note on properties of condition numbers. Lin. Alg. Appl. 261, 269-273
    • (1997) Lin. Alg. Appl. , vol.261 , pp. 269-273
    • Gonzaaa, C.C.1    Lara, H.2
  • 8
    • 0000328359 scopus 로고    scopus 로고
    • A modified layered-step interior-point algorithm for linear programming
    • Megiddo, N., Mizuno, S., Tsuchiya, T. (1998): A modified layered-step interior-point algorithm for linear programming. Math. Program. 82, 339-355
    • (1998) Math. Program. , vol.82 , pp. 339-355
    • Megiddo, N.1    Mizuno, S.2    Tsuchiya, T.3
  • 9
    • 0001500190 scopus 로고
    • On bounds for scaled projections and pseudoinverses
    • O'Leary, D.P. (1990): On bounds for scaled projections and pseudoinverses. Lin. Alg. Appl. 132, 115-117
    • (1990) Lin. Alg. Appl. , vol.132 , pp. 115-117
    • O'Leary, D.P.1
  • 10
    • 0000685126 scopus 로고
    • On scaled projections and pseudoinverses
    • Stewart, G.W. (1989): On scaled projections and pseudoinverses. Lin. Alg. Appl. 112, 189-193
    • (1989) Lin. Alg. Appl. , vol.112 , pp. 189-193
    • Stewart, G.W.1
  • 11
    • 0025512866 scopus 로고
    • A Dantzig-Wolfe-like variant of Karmarkar's interior-point linear programming algorithm
    • Todd, M.J. (1990): A Dantzig-Wolfe-like variant of Karmarkar's interior-point linear programming algorithm. Oper. Res. 38, 1006-1018
    • (1990) Oper. Res. , vol.38 , pp. 1006-1018
    • Todd, M.J.1
  • 12
    • 0010786679 scopus 로고
    • Probabilistic models for linear programming
    • Todd, M.J. (1991): Probabilistic models for linear programming. Math. Oper. Res. 16, 671-693
    • (1991) Math. Oper. Res. , vol.16 , pp. 671-693
    • Todd, M.J.1
  • 13
    • 0345103352 scopus 로고    scopus 로고
    • On the condition numbers for polyhedra in Karmarkar's form
    • Tunçel, L. (1999): On the condition numbers for polyhedra in Karmarkar's form. Oper. Res. Lett. 24, 149-155
    • (1999) Oper. Res. Lett. , vol.24 , pp. 149-155
    • Tunçel, L.1
  • 14
    • 30244506467 scopus 로고    scopus 로고
    • A primal-dual interior-point method whose running time depends only on the constraint matrix
    • Vavasis, S.A., Ye, Y. (1996): A primal-dual interior-point method whose running time depends only on the constraint matrix. Math. Program. 74, 79-120
    • (1996) Math. Program. , vol.74 , pp. 79-120
    • Vavasis, S.A.1    Ye, Y.2
  • 15
    • 0029313616 scopus 로고
    • Condition numbers for polyhedra with real number data
    • Vavasis, S.A., Ye, Y. (1995): Condition numbers for polyhedra with real number data. Oper. Res. Lett. 17, 209-214
    • (1995) Oper. Res. Lett. , vol.17 , pp. 209-214
    • Vavasis, S.A.1    Ye, Y.2
  • 17
    • 0002953043 scopus 로고
    • Toward probabilistic analysis of interior-point algorithms for linear programming
    • Ye, Y. (1994): Toward probabilistic analysis of interior-point algorithms for linear programming. Math. Oper. Res. 19, 38-52
    • (1994) Math. Oper. Res. , vol.19 , pp. 38-52
    • Ye, Y.1

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