메뉴 건너뛰기
Mathematical Programming, Series B
Volumn 84, Issue 1, 1999, Pages 105-122
Global and polynomial-time convergence of an infeasible-interior-point algorithm using inexact computation
Author keywords

Convergence; Dual; Inexact computation; Interior; Linear programming problem; Point method; Primal
Indexed keywords

EID: 0039993745     PISSN: 00255610     EISSN: None     Source Type: Journal    
DOI: 10.1007/s10107980020a     Document Type: Article
Times cited : (38)
References (3)
  • 1
    • 0042216536 scopus 로고    scopus 로고
    • Convergence of inexact interior-point algorithms for linear programs
    • Bell Laboratories, Murray Hill, New Jersey
    • Freund, R.W., Jarre, F., Mizuno, S. (1996): Convergence of inexact interior-point algorithms for linear programs. Numerical Analysis Manuscript 96-16. Bell Laboratories, Murray Hill, New Jersey
    • (1996) Numerical Analysis Manuscript , vol.96 , Issue.16
    • Freund, R.W.1    Jarre, F.2    Mizuno, S.3
  • 2
    • 51249181779 scopus 로고
    • A new polynomial-time algorithm for linear programming
    • Karmarkar, N. (1984): A new polynomial-time algorithm for linear programming. Combinatorica 4, 373-395
    • (1984) Combinatorica , vol.4 , pp. 373-395
    • Karmarkar, N.1
  • 3
    • 3042932589 scopus 로고
    • A primal-dual infeasible-interior-point algorithm for linear programming
    • Kojima, M.,Megiddo, N., Mizuno, S. (1993): A primal-dual infeasible-interior-point algorithm for linear programming. Math. Program. 61, 261-280
    • (1993) Math. Program. , vol.61 , pp. 261-280
    • Kojima, M.1    Megiddo, N.2    Mizuno, S.3

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