메뉴 건너뛰기




Volumn 73, Issue 3, 1996, Pages 269-289

A superquadratic infeasible-interior-point method for linear complementarity problems

Author keywords

Infeasible interior point methods; Linear complementarity problems; Path following; Superquadratic rates

Indexed keywords


EID: 0001717971     PISSN: 00255610     EISSN: None     Source Type: Journal    
DOI: 10.1007/BF02592215     Document Type: Article
Times cited : (26)

References (21)
  • 1
    • 0041404733 scopus 로고
    • A predictor-corrector method for linear complementarity problems with polynomial complexity and superlinear convergence
    • Department of Mathematics, University of Iowa, Iowa City, IA
    • J. Ji, F.A. Potra and S. Huang, "A predictor-corrector method for linear complementarity problems with polynomial complexity and superlinear convergence," Reports on Computational Mathematics No. 18, Department of Mathematics, University of Iowa, Iowa City, IA (1991).
    • (1991) Reports on Computational Mathematics No. 18 , vol.18
    • Ji, J.1    Potra, F.A.2    Huang, S.3
  • 2
    • 0011364745 scopus 로고
    • An interior-point algorithm with polynomial complexity and superlinear convergence for linear complementarity problems
    • Department of Mathematical Sciences, Rice University, Houston, TX
    • J. Ji, F.A. Potra, R.A. Tapia and Y. Zhang, "An interior-point algorithm with polynomial complexity and superlinear convergence for linear complementarity problems," Report No. 91-23, Department of Mathematical Sciences, Rice University, Houston, TX (1991).
    • (1991) Report No. 91-23
    • Ji, J.1    Potra, F.A.2    Tapia, R.A.3    Zhang, Y.4
  • 4
    • 0026171528 scopus 로고
    • An O(√nL) iteration potential reduction algorithm for linear complementarity problems
    • M. Kojima, S., Mizuno and A. Yoshise, "An O(√nL) iteration potential reduction algorithm for linear complementarity problems," Mathematical Programming 50 (1991) 331-342.
    • (1991) Mathematical Programming , vol.50 , pp. 331-342
    • Kojima, M.1    Mizuno, S.2    Yoshise, A.3
  • 5
    • 0000022796 scopus 로고
    • On implementing Mehrotra's predictor-corrector interior point method for linear programming
    • I.J. Lustig, R.E. Marsten and D.F. Shanno, "On implementing Mehrotra's predictor-corrector interior point method for linear programming," SIAM Journal on Optimization 2 (1992) 435-449.
    • (1992) SIAM Journal on Optimization , vol.2 , pp. 435-449
    • Lustig, I.J.1    Marsten, R.E.2    Shanno, D.F.3
  • 6
    • 34249962654 scopus 로고
    • Error bounds for nondegenerate monotone linear complementarity problems
    • O.L. Mangasarian, "Error bounds for nondegenerate monotone linear complementarity problems," Mathematical Programming 48 (1990) 437-445.
    • (1990) Mathematical Programming , vol.48 , pp. 437-445
    • Mangasarian, O.L.1
  • 7
    • 0039551546 scopus 로고
    • Superlinearly convergent O(√nL)-iteration interior-point algorithms for linear programming and the monotone linear complementarity problem
    • K.A. McShane, "Superlinearly convergent O(√nL)-iteration interior-point algorithms for linear programming and the monotone linear complementarity problem," SIAM Journal on Optimization 4 (1994) 247-261.
    • (1994) SIAM Journal on Optimization , vol.4 , pp. 247-261
    • McShane, K.A.1
  • 8
    • 0040470118 scopus 로고
    • Asymptotic convergence in a generalized predictor-corrector method
    • Dept. of Industrial Engineering and Management Science, North-western University, Evanston, IL
    • S. Mehrotra, "Asymptotic convergence in a generalized predictor-corrector method," Technical Report, Dept. of Industrial Engineering and Management Science, North-western University, Evanston, IL (1992).
    • (1992) Technical Report
    • Mehrotra, S.1
  • 9
    • 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 Journal of Optimization 2 (1992) 575-601.
    • (1992) SIAM Journal of Optimization , vol.2 , pp. 575-601
    • Mehrotra, S.1
  • 10
    • 0000836925 scopus 로고
    • On adaptive step primal-dual interior-point algorithms for linear programming
    • S. Mizuno, M. Todd and Y. Ye, "On adaptive step primal-dual interior-point algorithms for linear programming," Mathematics of Operations Research 18 (1993) 964-981.
    • (1993) Mathematics of Operations Research , vol.18 , pp. 964-981
    • Mizuno, S.1    Todd, M.2    Ye, Y.3
  • 11
    • 0030304768 scopus 로고    scopus 로고
    • A superlinear infeasible-interior-point affine scaling algorithm for LCP
    • R.D.C. Monteiro and S.J. Wright, "A superlinear infeasible-interior-point affine scaling algorithm for LCP," SIAM Journal on Optimization 6 (1996) 1-18.
    • (1996) SIAM Journal on Optimization , vol.6 , pp. 1-18
    • Monteiro, R.D.C.1    Wright, S.J.2
  • 14
    • 0039285299 scopus 로고
    • An o(nL) infeasible-interior-point algorithm for LCP with quadratic convergence
    • Department of Mathematics, University of Iowa, Iowa City, IA
    • F.A. Potra, "An O(nL) infeasible-interior-point algorithm for LCP with quadratic convergence," Reports on Computational Mathematics No. 50, Department of Mathematics, University of Iowa, Iowa City, IA (1994).
    • (1994) Reports on Computational Mathematics No. 50 , vol.50
    • Potra, F.A.1
  • 15
    • 0010831216 scopus 로고
    • *-matrix LCP from arbitrary positive starting points
    • Department of Mathematics, University of Iowa, Iowa City, IA
    • *-matrix LCP from arbitrary positive starting points," Reports on Computational Mathematics No. 58, Department of Mathematics, University of Iowa, Iowa City, IA (1994).
    • (1994) Reports on Computational Mathematics No. 58 , vol.58
    • Potra, F.A.1    Sheng, R.2
  • 16
    • 0027903976 scopus 로고
    • A path-following infeasible-interior-point algorithm for linear complementarity problems
    • S.J. Wright, "A path-following infeasible-interior-point algorithm for linear complementarity problems," Optimization Methods and Software 2 (1993) 79-106.
    • (1993) Optimization Methods and Software , vol.2 , pp. 79-106
    • Wright, S.J.1
  • 17
    • 0028525075 scopus 로고
    • An infeasible-interior-point algorithm for linear complementarity problems
    • S.J. Wright, "An infeasible-interior-point algorithm for linear complementarity problems," Mathematical Programming 67 (1994) 29-52.
    • (1994) Mathematical Programming , vol.67 , pp. 29-52
    • Wright, S.J.1
  • 18
    • 85029973447 scopus 로고    scopus 로고
    • A path-following interior-point algorithm for linear and quadratic optimization problems
    • to appear
    • S.J. Wright, "A path-following interior-point algorithm for linear and quadratic optimization problems," Annals of Operations Research, to appear.
    • Annals of Operations Research
    • Wright, S.J.1
  • 19
    • 0027803251 scopus 로고
    • On quadratic and O(√nL) convergence of a predictor-corrector algorithm for LCP
    • Y. Ye and K. Anstreicher, "On quadratic and O(√nL) convergence of a predictor-corrector algorithm for LCP," Mathematical Programming 62 (1993) 537-552.
    • (1993) Mathematical Programming , vol.62 , pp. 537-552
    • Ye, Y.1    Anstreicher, K.2
  • 20
    • 85029999913 scopus 로고    scopus 로고
    • A mehrotra-type predictor-corrector algorithm with polynomial complexity and Q-subquadratic convergence
    • to appear
    • D. Zhang and Y. Zhang, "A Mehrotra-type predictor-corrector algorithm with polynomial complexity and Q-subquadratic convergence," Annals of Operations Research, to appear.
    • Annals of Operations Research
    • Zhang, D.1    Zhang, Y.2
  • 21
    • 0000252459 scopus 로고
    • On the convergence of a class of infeasible-interior-point methods for the horizontal linear complementarity problem
    • Y. Zhang, "On the convergence of a class of infeasible-interior-point methods for the horizontal linear complementarity problem," SIAM Journal on Optimization 4 (1994) 208-227.
    • (1994) SIAM Journal on Optimization , vol.4 , pp. 208-227
    • Zhang, Y.1


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