메뉴 건너뛰기




Volumn 52, Issue 8, 2009, Pages 1769-1784

Path-following interior point algorithms for the Cartesian P*(κ)-LCP over symmetric cones

Author keywords

Cartesian P*( ) property; Complexity; Global convergence; Path following interior point algorithm; Symmetric cone linear complementarity problem

Indexed keywords


EID: 70349987376     PISSN: 10069283     EISSN: None     Source Type: Journal    
DOI: 10.1007/s11425-008-0174-0     Document Type: Article
Times cited : (42)

References (23)
  • 1
    • 0007637669 scopus 로고    scopus 로고
    • Euclidean Jordan algebras and interior-point algorithms
    • Faybusovich L. Euclidean Jordan algebras and interior-point algorithms. Positivity, 1: 331-357 (1997)
    • (1997) Positivity , vol.1 , pp. 331-357
    • Faybusovich, L.1
  • 2
    • 0031269040 scopus 로고    scopus 로고
    • Linear systems in Jordan algebras and primal-dual interior-point algorithms
    • Faybusovich L. Linear systems in Jordan algebras and primal-dual interior-point algorithms. J Comput Appl Math, 86: 149-175 (1997)
    • (1997) J Comput Appl Math , vol.86 , pp. 149-175
    • Faybusovich, L.1
  • 4
    • 39449113661 scopus 로고    scopus 로고
    • An interior-point trust region algorithm for general symmetric cone programming
    • Lu Y, Yuan Y. An interior-point trust region algorithm for general symmetric cone programming. SIAM J Optim, 18: 65-86 (2007)
    • (2007) SIAM J Optim , vol.18 , pp. 65-86
    • Lu, Y.1    Yuan, Y.2
  • 5
    • 0036104052 scopus 로고    scopus 로고
    • On a commutative class of search directions for linear programming over symmetric cones
    • Muramatsu M. On a commutative class of search directions for linear programming over symmetric cones. J Optim Theory Appl, 112: 595-625 (2002)
    • (2002) J Optim Theory Appl , vol.112 , pp. 595-625
    • Muramatsu, M.1
  • 6
    • 33750901458 scopus 로고    scopus 로고
    • Polynomial convergence of infeasible-interior-point methods over symmetric cones
    • Rangarajan B K. Polynomial convergence of infeasible-interior-point methods over symmetric cones. SIAM J Optim, 16: 1221-1229 (2006)
    • (2006) SIAM J Optim , vol.16 , pp. 1221-1229
    • Rangarajan, B.K.1
  • 7
    • 0035435165 scopus 로고    scopus 로고
    • Associative and Jordan algebras, and polynomial time interior-point algorithms for symmetric cones
    • Schmieta S H, Alizadeh F. Associative and Jordan algebras, and polynomial time interior-point algorithms for symmetric cones. Math Oper Res, 26: 543-564 (2001)
    • (2001) Math Oper Res , vol.26 , pp. 543-564
    • Schmieta, S.H.1    Alizadeh, F.2
  • 8
    • 7444236751 scopus 로고    scopus 로고
    • Extension of primal-dual interior point algorithm to symmetric cones
    • Schmieta S H, Alizadeh F. Extension of primal-dual interior point algorithm to symmetric cones. Math Program, 96: 409-438 (2003)
    • (2003) Math Program , vol.96 , pp. 409-438
    • Schmieta, S.H.1    Alizadeh, F.2
  • 9
    • 0348006618 scopus 로고    scopus 로고
    • On implementing a primal-dual interior-point method for conic quadratic optimization
    • Andersen E D, Roos C, Terlaky T. On implementing a primal-dual interior-point method for conic quadratic optimization. Math Program, 95: 249-277 (2003)
    • (2003) Math Program , vol.95 , pp. 249-277
    • Andersen, E.D.1    Roos, C.2    Terlaky, T.3
  • 10
    • 33645907534 scopus 로고    scopus 로고
    • Jordan-algebraic aspects of nonconvex optimization over symmetric cones
    • Faybusovich L, Lu Y. Jordan-algebraic aspects of nonconvex optimization over symmetric cones. Appl Math Optim, 53: 67-77 (2006)
    • (2006) Appl Math Optim , vol.53 , pp. 67-77
    • Faybusovich, L.1    Lu, Y.2
  • 11
    • 40249101583 scopus 로고    scopus 로고
    • An interior-point trust-region polynomial algorithm for convex quadratic minimization subject to convex constraints
    • Lu Y, Yuan Y. An interior-point trust-region polynomial algorithm for convex quadratic minimization subject to convex constraints. Optim Methods Softw, 23: 251-258 (2008)
    • (2008) Optim Methods Softw , vol.23 , pp. 251-258
    • Lu, Y.1    Yuan, Y.2
  • 12
    • 36248962181 scopus 로고    scopus 로고
    • Interior point trajectories and a homogeneous model for nonlinear complementarity problems over symmetric cones
    • Yoshise A. Interior point trajectories and a homogeneous model for nonlinear complementarity problems over symmetric cones. SIAM J Optim, 17: 1129-1153 (2006)
    • (2006) SIAM J Optim , vol.17 , pp. 1129-1153
    • Yoshise, A.1
  • 13
    • 70349981481 scopus 로고    scopus 로고
    • A homogeneous algorithm for complementarity problems over symmetric cones
    • Graduate School of Systems and Information Engineering University of Tsukuba
    • Yoshise A. A homogeneous algorithm for complementarity problems over symmetric cones. Technical Report, Graduate School of Systems and Information Engineering University of Tsukuba, 2007
    • (2007) Technical Report
    • Yoshise, A.A.1
  • 14
    • 29144505119 scopus 로고    scopus 로고
    • Cartesian P-property and its applications to the semidefinite linear complementarity problem
    • Chen X, Qi H D. Cartesian P-property and its applications to the semidefinite linear complementarity problem. Math Program, 106: 177-201 (2006)
    • (2006) Math Program , vol.106 , pp. 177-201
    • Chen, X.1    Qi, H.D.2
  • 15
    • 70349984867 scopus 로고    scopus 로고
    • Vector-valued implicit lagrangian for symmetric cone complementarity problems
    • Department of Combinatorics and Optimization, University of Waterloo, Waterloo, Ontario, Canada
    • Kong L C, Tuņcel, L., Xiu N H. Vector-valued implicit lagrangian for symmetric cone complementarity problems. Research Report CORR 2006-24, Department of Combinatorics and Optimization, University of Waterloo, Waterloo, Ontario, Canada, 2006
    • (2006) Research Report CORR 2006-24
    • Kong, L.C.1    Tuņcel, L.2    Xiu, N.H.3
  • 16
    • 0003783955 scopus 로고
    • A Unified Approach to Interior Point Algorithms for Linear Complementarity Problems
    • Berlin: Springer-Verlag
    • Kojima M, Megiddo N, Noma T, et al. A Unified Approach to Interior Point Algorithms for Linear Complementarity Problems. Lecture Notes in Computer Science, 538. Berlin: Springer-Verlag, 1991
    • (1991) Lecture Notes in Computer Science, 538
    • Kojima, M.1    Megiddo, N.2    Noma, T.3
  • 17
    • 0039285297 scopus 로고
    • An infeasible-interior-point method for the P*-matrix LCP
    • Department of Mathematics, University of Iowa, Iowa City, IA
    • Ji J, Potra F A. An infeasible-interior-point method for the P*-matrix LCP. Reports on Comput Math 52, Department of Mathematics, University of Iowa, Iowa City, IA, 1994
    • (1994) Reports on Comput Math 52
    • Ji, J.1    Potra, F.A.2
  • 18
    • 0007508344 scopus 로고
    • A predictor-corrector method for the P*-matrix LCP from infeasible starting points
    • Ji J, Potra F A, Sheng R. A predictor-corrector method for the P*-matrix LCP from infeasible starting points. Optim Mehods Softw, 6: 109-126 (1995)
    • (1995) Optim Mehods Softw , vol.6 , pp. 109-126
    • Ji, J.1    Potra, F.A.2    Sheng, R.3
  • 19
    • 0000075062 scopus 로고
    • A quadratically convergent O((κ+1) √ nL)-iteration algorithm for the P*(κ)-matrix linear complementarity problem
    • Miao J. A quadratically convergent O((κ+1) √ nL)-iteration algorithm for the P*(κ)-matrix linear complementarity problem Math Program, 69: 355-368 (1995)
    • (1995) Math Program , vol.69 , pp. 355-368
    • Miao, J.1
  • 20
    • 0001402013 scopus 로고    scopus 로고
    • Predictor-corrector algorithm for solving P*(κ)-matrix LCP from arbitrary positive starting points
    • Potra F A, Sheng R. Predictor-corrector algorithm for solving P*(κ)-matrix LCP from arbitrary positive starting points. Math Program, 76: 223-244 (1996)
    • (1996) Math Program , vol.76 , pp. 223-244
    • Potra, F.A.1    Sheng, R.2


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