메뉴 건너뛰기




Volumn 14, Issue 3, 1999, Pages 309-330

Primal-dual path-following algorithms for determinant maximization problems with linear matrix inequalities

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; COMPUTATIONAL COMPLEXITY; MATRIX ALGEBRA; PROBLEM SOLVING;

EID: 0032595819     PISSN: 09266003     EISSN: None     Source Type: Journal    
DOI: 10.1023/A:1026400522929     Document Type: Article
Times cited : (24)

References (20)
  • 1
    • 0032327612 scopus 로고    scopus 로고
    • Primal-dual interior-point methods for semidefinite programming: Convergence results, stability and numerical results
    • F. Alizadeh, J.-P.A. Haeberly, and M. Overton, "Primal-dual interior-point methods for semidefinite programming: Convergence results, stability and numerical results," SIAM J. Optimization, vol. 8, pp. 746-768, 1998.
    • (1998) SIAM J. Optimization , vol.8 , pp. 746-768
    • Alizadeh, F.1    Haeberly, J.-P.A.2    Overton, M.3
  • 2
    • 0031141136 scopus 로고    scopus 로고
    • Complementarity and nondegeneracy in semidefinite programming
    • F. Alizadeh, J.-P.A. Haeberly, and M. Overton, "Complementarity and nondegeneracy in semidefinite programming," Math. Programming, vol. 77, pp. 111-128, 1997.
    • (1997) Math. Programming , vol.77 , pp. 111-128
    • Alizadeh, F.1    Haeberly, J.-P.A.2    Overton, M.3
  • 4
    • 0000609227 scopus 로고    scopus 로고
    • Exploiting sparsity in primal-dual interior-point methods for semidefinite programming
    • K. Fujisawa, M. Kojima, and K. Nakata, "Exploiting sparsity in primal-dual interior-point methods for semidefinite programming," Mathematical Programming, vol. 79, pp. 235-253, 1997.
    • (1997) Mathematical Programming , vol.79 , pp. 235-253
    • Fujisawa, K.1    Kojima, M.2    Nakata, K.3
  • 5
    • 0003694452 scopus 로고    scopus 로고
    • SDPA (semidefinite programming algorithm) - User's manual
    • Department of Mathematical and Computing Science, Tokyo Institute of Technology, Tokyo
    • K. Fujisawa, M. Kojima, and K. Nakata, "SDPA (semidefinite programming algorithm) - User's manual," Research Report, Department of Mathematical and Computing Science, Tokyo Institute of Technology, Tokyo.
    • Research Report
    • Fujisawa, K.1    Kojima, M.2    Nakata, K.3
  • 8
    • 0031542833 scopus 로고    scopus 로고
    • Interior-point methods for the monotone linear complementarity problem in symmetric matrices
    • M. Kojima, S. Shindoh, and S. Hara, "Interior-point methods for the monotone linear complementarity problem in symmetric matrices," SIAM J. Optimization, vol. 7, pp. 86-125, 1997.
    • (1997) SIAM J. Optimization , vol.7 , pp. 86-125
    • Kojima, M.1    Shindoh, S.2    Hara, S.3
  • 10
    • 0031285899 scopus 로고    scopus 로고
    • Primal-dual path following algorithms for semidefinite programming
    • R.D.C. Monteiro, "Primal-dual path following algorithms for semidefinite programming," SIAM J. Optimization, vol. 7, pp. 663-678, 1997.
    • (1997) SIAM J. Optimization , vol.7 , pp. 663-678
    • Monteiro, R.D.C.1
  • 11
    • 0001343365 scopus 로고    scopus 로고
    • A unified analysis of path-following primal-dual interior-point algorithms for semidefinite programming
    • R.D.C. Monteiro and Y. Zhang, "A unified analysis of path-following primal-dual interior-point algorithms for semidefinite programming," Mathematical Programming, vol. 81, pp. 281-299, 1998.
    • (1998) Mathematical Programming , vol.81 , pp. 281-299
    • Monteiro, R.D.C.1    Zhang, Y.2
  • 12
    • 0003254248 scopus 로고
    • Interior-Point Polynomial Algorithms in Convex Programming
    • SIAM: Philadelphia, PA
    • Y. Nesterov and A. Nemirovsky, "Interior-Point Polynomial Algorithms in Convex Programming," vol. 13 of Studies in Applied Mathematics, SIAM: Philadelphia, PA, 1994.
    • (1994) Studies in Applied Mathematics , vol.13
    • Nesterov, Y.1    Nemirovsky, A.2
  • 13
    • 0032222088 scopus 로고    scopus 로고
    • Primal-dual interior-point methods for self-scaled cones
    • Y. Nesterov and M.J. Todd, "Primal-dual interior-point methods for self-scaled cones," SIAM J. Optimization, vol. 8, pp. 324-364, 1998.
    • (1998) SIAM J. Optimization , vol.8 , pp. 324-364
    • Nesterov, Y.1    Todd, M.J.2
  • 15
    • 0032359979 scopus 로고    scopus 로고
    • On the Nesterov-Todd direction in semidefinite programming
    • M.J. Todd, K.C. Toh, and R.H. Tütüncü, "On the Nesterov-Todd direction in semidefinite programming," SIAM J. Optimization vol. 8, pp. 769-796, 1998.
    • (1998) SIAM J. Optimization , vol.8 , pp. 769-796
    • Todd, M.J.1    Toh, K.C.2    Tütüncü, R.H.3
  • 16
    • 0012053741 scopus 로고    scopus 로고
    • Search directions for primal-dual interior point methods in semidefinite programming
    • Department of Mathematics, National University of Singapore, Singapore, July, Revised in March
    • K.C. Toh, "Search directions for primal-dual interior point methods in semidefinite programming," Technical Report 722, Department of Mathematics, National University of Singapore, Singapore, July, 1997. Revised in March 1998.
    • (1997) Technical Report , vol.722
    • Toh, K.C.1
  • 18
    • 0030106462 scopus 로고    scopus 로고
    • Semidefinite programming
    • L. Vandenberghe and S. Boyd, "Semidefinite programming," SIAM Review, vol. 38, pp. 49-95, 1996.
    • (1996) SIAM Review , vol.38 , pp. 49-95
    • Vandenberghe, L.1    Boyd, S.2
  • 20
    • 0032081158 scopus 로고    scopus 로고
    • On extending some primal-dual interior-point algorithms from linear programming to semidefinite programming
    • Y. Zhang, "On extending some primal-dual interior-point algorithms from linear programming to semidefinite programming," SIAM J. Optimization, vol. 8, pp. 365-386, 1998.
    • (1998) SIAM J. Optimization , vol.8 , pp. 365-386
    • Zhang, Y.1


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