메뉴 건너뛰기




Volumn 7, Issue 2, 1997, Pages 318-335

A large-step infeasible-interior-point method for the P*-matrix LCP

Author keywords

Infeasible interior point algorithm; Linear complementarity problems; P* matrices; Polynomiality; Superlinear convergence

Indexed keywords


EID: 0031493116     PISSN: 10526234     EISSN: None     Source Type: Journal    
DOI: 10.1137/S1052623495279359     Document Type: Article
Times cited : (40)

References (22)
  • 1
    • 85033104542 scopus 로고
    • On the equivalence between different formulations and algorithms for the P* (κ)-LCP
    • Department of Mathematics, The University of Iowa, Iowa City, IA, June
    • M. ANITESCU, G. LESAJA, AND F. A. POTRA, On the Equivalence Between Different Formulations and Algorithms for the P* (κ)-LCP, Reports on computational mathematics 71, Department of Mathematics, The University of Iowa, Iowa City, IA, June, 1995.
    • (1995) Reports on Computational Mathematics , vol.71
    • Anitescu, M.1    Lesaja, G.2    Potra, F.A.3
  • 3
    • 0039285297 scopus 로고
    • An infeasible-interior-point method for the P*-matrix LCP
    • Department of Mathematics, The University of Iowa, Iowa City, IA, February
    • J. JI AND F. A. POTRA, An Infeasible-Interior-Point Method for the P*-Matrix LCP, Reports on computational mathematics 52, Department of Mathematics, The University of Iowa, Iowa City, IA, February, 1994.
    • (1994) Reports on Computational Mathematics , vol.52
    • Ji, J.1    Potra, F.A.2
  • 4
    • 0007508344 scopus 로고
    • A predictor-corrector method for solving the P* (κ)-matrix LCP from infeasible starting points
    • J. JI, F. A. POTRA, AND R. SHENG, A predictor-corrector method for solving the P* (κ)-matrix LCP from infeasible starting points, Optim. Methods Software, 6 (1995), pp. 109-126.
    • (1995) Optim. Methods Software , vol.6 , pp. 109-126
    • Ji, J.1    Potra, F.A.2    Sheng, R.3
  • 5
    • 0003212154 scopus 로고
    • A unified approach to interior point algorithms for linear complementarity problems
    • Springer-Verlag, Berlin, New York
    • M. KOJIMA, N. MEGIDDO, T. NOMA, AND A. YOSHISE, A unified approach to interior point algorithms for linear complementarity problems, Lecture Notes in Computer Science 538, Springer-Verlag, Berlin, New York, 1991.
    • (1991) Lecture Notes in Computer Science , vol.538
    • Kojima, M.1    Megiddo, N.2    Noma, T.3    Yoshise, A.4
  • 6
    • 0040470118 scopus 로고
    • Technical report, Department of Industrial Engineering and Management Science, Northwestern University, Evanston, IL, October
    • S. MEHROTRA, Asymptotic Convergence in a Generalized-Predictor-Corrector Method, Technical report, Department of Industrial Engineering and Management Science, Northwestern University, Evanston, IL, October, 1992.
    • (1992) Asymptotic Convergence in a Generalized-predictor-corrector Method
    • Mehrotra, S.1
  • 7
    • 58149365648 scopus 로고
    • A quadratically convergent O((1 + κ)√nL)-iteration algorithm for the P*(κ)-matrix linear complementarity problem
    • J. MIAO, A quadratically convergent O((1 + κ)√nL)-iteration algorithm for the P*(κ)-matrix linear complementarity problem, Math. Programming, 69 (1995), pp. 355-368.
    • (1995) Math. Programming , vol.69 , pp. 355-368
    • Miao, J.1
  • 8
    • 0030150291 scopus 로고    scopus 로고
    • A unified approach to infeasible-interior-point algorithms via geometrical linear complementarity problems
    • S. MIZUNO, F. JARRE, AND J. STOER, A unified approach to infeasible-interior-point algorithms via geometrical linear complementarity problems, Appl. Math. Optim., 33 (1996), pp. 315-341.
    • (1996) Appl. Math. Optim. , vol.33 , pp. 315-341
    • Mizuno, S.1    Jarre, F.2    Stoer, J.3
  • 10
    • 0000367866 scopus 로고
    • On Q-order and R-order of convergence
    • F. A. POTRA, On Q-order and R-order of convergence, J. Optim. Theory Appl., 63 (1989), pp. 415-431.
    • (1989) J. Optim. Theory Appl. , vol.63 , pp. 415-431
    • Potra, F.A.1
  • 11
    • 0039285299 scopus 로고
    • An O(nL) infeasible-interior-point algorithm for LCP with quadratic convergence
    • Department of Mathematics, The University of Iowa, Iowa City, IA, January
    • 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, January, 1994.
    • (1994) Reports on Computational Mathematics , vol.50
    • Potra, F.A.1
  • 12
    • 0040195285 scopus 로고
    • Nondiscrete induction and iterative processes
    • Pitman, Boston, MA
    • F. A. POTRA AND V. PTAK, Nondiscrete induction and iterative processes, Research Notes in Mathematics 103, Pitman, Boston, MA, 1984.
    • (1984) Research Notes in Mathematics , vol.103
    • Potra, F.A.1    Ptak, V.2
  • 13
    • 0010831216 scopus 로고
    • Predictor-corrector algorithms for solving P*(κ)-matrix LCP from arbitrary positive starting points
    • Department of Mathematics, The University of Iowa, Iowa City, IA, August
    • F. A. POTRA AND R. SHENG, Predictor-Corrector Algorithms for Solving P*(κ)-Matrix LCP from Arbitrary Positive Starting Points, Reports on computational mathematics 58, Department of Mathematics, The University of Iowa, Iowa City, IA, August 1994.
    • (1994) Reports on Computational Mathematics , vol.58
    • Potra, F.A.1    Sheng, R.2
  • 14
    • 0000323205 scopus 로고
    • On a modification of Newton's method
    • in Russian
    • V. E. SHAMANSKII, On a modification of Newton's method, Ukrainian Math. J., 19 (1967), pp 133-138, (in Russian).
    • (1967) Ukrainian Math. J. , vol.19 , pp. 133-138
    • Shamanskii, V.E.1
  • 15
    • 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, SIAM J. Optim., 7 (1997), pp. 304-317.
    • (1997) SIAM J. Optim. , vol.7 , pp. 304-317
    • Sheng, R.1    Potra, F.A.2
  • 17
    • 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, Optim. Methods Software, 2 (1993), pp. 79-106.
    • (1993) Optim. Methods Software , vol.2 , pp. 79-106
    • Wright, S.J.1
  • 18
    • 21344446747 scopus 로고    scopus 로고
    • A path-following interior-point algorithm for linear and quadratic problems
    • S. J. WRIGHT, A path-following interior-point algorithm for linear and quadratic problems, Ann Oper. Res., 62 (1996), pp. 103-130.
    • (1996) Ann Oper. Res. , vol.62 , pp. 103-130
    • Wright, S.J.1
  • 19
    • 0028525075 scopus 로고
    • An infeasible-interior-point algorithm for linear complementarity problems
    • S. J. WRIGHT, An infeasible-interior-point algorithm for linear complementarity problems, Math Programming, 67 (1994), pp. 29-52.
    • (1994) Math Programming , vol.67 , pp. 29-52
    • Wright, S.J.1
  • 20
    • 0001717971 scopus 로고    scopus 로고
    • A superquadratic infeasible-interior-point algorithm for linear complementarity problems
    • S. J. WRIGHT AND Y. ZHANG, A superquadratic infeasible-interior-point algorithm for linear complementarity problems, Math. Programming, 73 (1996), pp. 269-289.
    • (1996) Math. Programming , vol.73 , pp. 269-289
    • Wright, S.J.1    Zhang, Y.2
  • 22
    • 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. Optim., 4 (1994), pp. 208-227.
    • (1994) SIAM J. Optim. , vol.4 , pp. 208-227
    • Zhang, Y.1


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