메뉴 건너뛰기




Volumn 76, Issue 1, 1997, Pages 223-244

Predictor-corrector algorithm for solving P* (κ) -matrix LCP from arbitrary positive starting points

Author keywords

Interior point algorithm; Linear complementarity problems; P* matrices; Superlinear convergence

Indexed keywords


EID: 0001402013     PISSN: 00255610     EISSN: None     Source Type: Journal    
DOI: 10.1007/BF02614385     Document Type: Article
Times cited : (34)

References (14)
  • 1
    • 0039285297 scopus 로고
    • *-matrix LCP
    • Department of Mathematics, University of Iowa, Iowa City, IA
    • *-matrix LCP, Reports on Computational Mathematics 52, Department of Mathematics, University of Iowa, Iowa City, IA (1994).
    • (1994) Reports on Computational Mathematics , pp. 52
    • Ji, J.1    Potra, F.A.2
  • 3
    • 0003212154 scopus 로고
    • A unified approach to interior point algorithms for linear complementarity problems
    • Lecture Notes
    • M. Kojima, N. Megiddo, T. Noma and A. Yoshise, A unified approach to interior point algorithms for linear complementarity problems, Lecture Notes in: Comput. Sci. 538 (1991).
    • (1991) Comput. Sci. , vol.538
    • Kojima, M.1    Megiddo, N.2    Noma, T.3    Yoshise, A.4
  • 4
    • 0000075062 scopus 로고
    • *(κ)-matrix linear complementarity problem
    • *(κ)-matrix linear complementarity problem, Mathematical Programming 69 (1995) 355-368.
    • (1995) Mathematical Programming , vol.69 , pp. 355-368
    • Miao, J.1
  • 5
    • 0042216513 scopus 로고
    • A superlinearly convergent infeasible-interior-point algorithm for geometrical LCPs without a strictly complementary condition
    • Mathematische Institute der Universität Würzburg, 97074 Würzburg, Germany
    • S. Mizuno, A superlinearly convergent infeasible-interior-point algorithm for geometrical LCPs without a strictly complementary condition, Technical Report Nr. 214, Mathematische Institute der Universität Würzburg, 97074 Würzburg, Germany (1994).
    • (1994) Technical Report , vol.214
    • Mizuno, S.1
  • 8
    • 0039285299 scopus 로고
    • An O(nL) infeasible-interior-point algorithm for LCP with quadratic convergence
    • Department of Mathematics, The 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 50, Department of Mathematics, The University of Iowa, Iowa City, IA (1994).
    • (1994) Reports on Computational Mathematics , pp. 50
    • Potra, F.A.1
  • 9
    • 0031536467 scopus 로고    scopus 로고
    • A quadratically convergent infeasible-interior-point algorithm for LCP with polynomial complexity
    • R. Sheng and F.A. Potra, A quadratically convergent infeasible-interior-point algorithm for LCP with polynomial complexity, to appear in: SIAM Journal on Optimization.
    • SIAM Journal on Optimization
    • Sheng, R.1    Potra, F.A.2
  • 10
    • 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 (1) (1994) 29-52.
    • (1994) Mathematical Programming , vol.67 , Issue.1 , pp. 29-52
    • Wright, S.J.1
  • 11
    • 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
  • 14
    • 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 J. Optimization 4 (1) (1994) 208-227.
    • (1994) SIAM J. Optimization , vol.4 , Issue.1 , pp. 208-227
    • Zhang, Y.1


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