메뉴 건너뛰기




Volumn 11, Issue 1, 2000, Pages 133-148

Convergence analysis of inexact infeasible-interior-point algorithms for solving linear programming problems

Author keywords

Inexact search direction; Infeasible interior point method; Linear programming

Indexed keywords


EID: 0034550508     PISSN: 10526234     EISSN: None     Source Type: Journal    
DOI: 10.1137/S1052623497329993     Document Type: Article
Times cited : (30)

References (10)
  • 1
    • 0038951788 scopus 로고    scopus 로고
    • A QMR-based interior-point algorithm for solving linear programs
    • R.W. FREUND AND F. JARRE, A QMR-based interior-point algorithm for solving linear programs, Math. Programming, 76 (1997), pp. 183-210.
    • (1997) Math. Programming , vol.76 , pp. 183-210
    • Freund, R.W.1    Jarre, F.2
  • 2
    • 0033076251 scopus 로고    scopus 로고
    • Convergence of a class of inexact interior-point algorithms for linear programs
    • R.W. FREUND, F. JARRE, AND S. MIZUNO, Convergence of a class of inexact interior-point algorithms for linear programs, Math. Oper. Res., 24 (1999), pp. 50-71.
    • (1999) Math. Oper. Res. , vol.24 , pp. 50-71
    • Freund, R.W.1    Jarre, F.2    Mizuno, S.3
  • 3
    • 3042932589 scopus 로고
    • A primal-dual infeasible-interior-point algorithm for linear programming
    • M. KOJIMA, N. MEGIDDO, AND S. MIZUNO, A primal-dual infeasible-interior-point algorithm for linear programming, Math. Programming, 61 (1993), pp. 263-280.
    • (1993) Math. Programming , vol.61 , pp. 263-280
    • Kojima, M.1    Megiddo, N.2    Mizuno, S.3
  • 5
    • 0000022796 scopus 로고
    • On implementing Mehrotra's predictorcorrector interior-point method for linear programming
    • I.J. LUSTIG, R.E. MARSTEN, AND D.F. SHANNO, On implementing Mehrotra's predictorcorrector interior-point method for linear programming, SIAM J. Optim., 2 (1992), pp. 435-449.
    • (1992) SIAM J. Optim. , vol.2 , pp. 435-449
    • Lustig, I.J.1    Marsten, R.E.2    Shanno, D.F.3
  • 6
    • 0028479748 scopus 로고
    • Computational experience with a globally convergent primal-dual predictor-corrector algorithm for linear programming
    • I.J. LUSTIG, R.E. MARSTEN, AND D.F. SHANNO, Computational experience with a globally convergent primal-dual predictor-corrector algorithm for linear programming, Math. Programming, 66 (1994), pp. 123-135.
    • (1994) Math. Programming , vol.66 , pp. 123-135
    • Lustig, I.J.1    Marsten, R.E.2    Shanno, D.F.3
  • 7
    • 0000561116 scopus 로고
    • On the implementation of a primal-dual interior point method
    • S. MEHROTRA, On the implementation of a primal-dual interior point method, SIAM J. Optim., 2 (1992), pp. 575-601.
    • (1992) SIAM J. Optim. , vol.2 , pp. 575-601
    • Mehrotra, S.1
  • 8
    • 0039993745 scopus 로고    scopus 로고
    • Global and polynomial-time convergence of an infeasible-interior-point algorithm using inexact computation
    • S. MIZUNO AND F. JARRE, Global and polynomial-time convergence of an infeasible-interior-point algorithm using inexact computation, Math. Program., 84 (1999), pp. 357-373.
    • (1999) Math. Program. , vol.84 , pp. 357-373
    • Mizuno, S.1    Jarre, F.2
  • 9
    • 21344448735 scopus 로고    scopus 로고
    • An infeasible-interior-point algorithm using projections onto a convex set
    • S. MIZUNO AND F. JARRE, An infeasible-interior-point algorithm using projections onto a convex set, Ann. Oper. Res., 62 (1996), pp. 59-80.
    • (1996) Ann. Oper. Res. , vol.62 , pp. 59-80
    • Mizuno, S.1    Jarre, F.2
  • 10
    • 0017491126 scopus 로고
    • A characterization of stability in linear programming
    • S.M. ROBINSON, A characterization of stability in linear programming, Oper. Res., 25 (1977), pp. 435-447.
    • (1977) Oper. Res. , vol.25 , pp. 435-447
    • Robinson, S.M.1


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