메뉴 건너뛰기




Volumn 11, Issue 1, 1999, Pages 625-653

Using SeDuMi 1.02, a MATLAB toolbox for optimization over symmetric cones

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTATIONAL COMPLEXITY; COMPUTER SOFTWARE; CONSTRAINT THEORY; LINEAR PROGRAMMING; QUADRATIC PROGRAMMING;

EID: 0033296299     PISSN: 10556788     EISSN: None     Source Type: Journal    
DOI: 10.1080/10556789908805766     Document Type: Article
Times cited : (6360)

References (30)
  • 5
    • 0002178207 scopus 로고    scopus 로고
    • Technical report, Department of Mathematical Sciences, Northern Illinois University, DeKalb, Illinois, USA
    • Deng, S. and Hu, H. (1996). Computable error bounds for semidefinite programming. Technical report, Department of Mathematical Sciences, Northern Illinois University, DeKalb, Illinois, USA.
    • (1996) Computable Error Bounds for Semidefinite Programming
    • Deng, S.1    Hu, H.2
  • 7
  • 10
    • 0000609227 scopus 로고    scopus 로고
    • Exploiting sparsity in primal-dual interior-point methods for semidefinite programming
    • Fujisawa, K., Kojima, M. and Nakata, K. (1997). Exploiting sparsity in primal-dual interior-point methods for semidefinite programming, Mathematical Programming, 79, 235-253.
    • (1997) Mathematical Programming , vol.79 , pp. 235-253
    • Fujisawa, K.1    Kojima, M.2    Nakata, K.3
  • 13
    • 33747810136 scopus 로고    scopus 로고
    • Applications of second-order cone programming
    • Technical report, Information Systems Lab, Stanford University. To appear
    • Lobo, M. S., Vandenberghe, L., Boyd, S. and Lebret, H. (1997). Applications of second-order cone programming. Technical report, Information Systems Lab, Stanford University. To appear in Linear Algebra and Applications.
    • (1997) Linear Algebra and Applications
    • Lobo, M.S.1    Vandenberghe, L.2    Boyd, S.3    Lebret, H.4
  • 14
  • 15
    • 0003493479 scopus 로고    scopus 로고
    • Technical Report 9719/A, Econometric Institute, Erasmus University Rotterdam, Rotterdam, The Netherlands
    • Luo, Z.-Q., Sturm, J. F. and Zhang, S. (1997). Duality results for conic convex programming. Technical Report 9719/A, Econometric Institute, Erasmus University Rotterdam, Rotterdam, The Netherlands.
    • (1997) Duality Results for Conic Convex Programming
    • Luo, Z.-Q.1    Sturm, J.F.2    Zhang, S.3
  • 16
    • 0000561116 scopus 로고
    • On the implementation of a primal-dual interior point method
    • Mehrotra, S. (1992). On the implementation of a primal-dual interior point method, SIAM Journal on Optimization, 2, 575-601.
    • (1992) SIAM Journal on Optimization , vol.2 , pp. 575-601
    • Mehrotra, S.1
  • 17
    • 34250077538 scopus 로고
    • Finding an interior point in the optimal face of linear programs
    • Mehrotra, S. and Ye, Y. (1993). Finding an interior point in the optimal face of linear programs, Mathematical Programming, 62, 497-515.
    • (1993) Mathematical Programming , vol.62 , pp. 497-515
    • Mehrotra, S.1    Ye, Y.2
  • 19
    • 0002760301 scopus 로고    scopus 로고
    • A general parametric analysis approach and its implication to sensitivity analysis in interior point methods
    • Monteiro, R. D. C. and Mehrotra, S. (1996). A general parametric analysis approach and its implication to sensitivity analysis in interior point methods, Mathematical Programming, 72, 65-82.
    • (1996) Mathematical Programming , vol.72 , pp. 65-82
    • Monteiro, R.D.C.1    Mehrotra, S.2
  • 20
    • 0031073753 scopus 로고    scopus 로고
    • Self-scaled barriers and interior-point methods for convex programming
    • Nesterov, Y. and Todd, M. J. (1997). Self-scaled barriers and interior-point methods for convex programming, Mathematics of Operations Research, 22(1), 1-42.
    • (1997) Mathematics of Operations Research , vol.22 , Issue.1 , pp. 1-42
    • Nesterov, Y.1    Todd, M.J.2
  • 22
    • 85037787755 scopus 로고    scopus 로고
    • Technical Report 1998-10-22, Department IEOR, University of California at Berkeley
    • Ross, A. M. (1998). Optimization over cones: SDPpack versus SeDuMi. Technical Report 1998-10-22, Department IEOR, University of California at Berkeley.
    • (1998) Optimization over Cones: SDPpack Versus SeDuMi
    • Ross, A.M.1
  • 24
    • 0031146060 scopus 로고    scopus 로고
    • On a wide region of centers and primal-dual interior point algorithms for linear programming
    • Sturm, J. F. and Zhang, S. (1997). On a wide region of centers and primal-dual interior point algorithms for linear programming, Mathematics of Operations Research, 22(2), 408-431.
    • (1997) Mathematics of Operations Research , vol.22 , Issue.2 , pp. 408-431
    • Sturm, J.F.1    Zhang, S.2
  • 25
    • 0040707227 scopus 로고    scopus 로고
    • Approximate Farkas lemmas and stopping rules for iterative infeasible-point algorithms for linear programming
    • Todd, M. J. and Ye, Y. (1998). Approximate Farkas lemmas and stopping rules for iterative infeasible-point algorithms for linear programming, Mathematical Programming, 81, 1-21.
    • (1998) Mathematical Programming , vol.81 , pp. 1-21
    • Todd, M.J.1    Ye, Y.2
  • 26
  • 27
    • 0003870519 scopus 로고
    • Information Systems Laboratory, Electrical Engineering Department, Stanford University, Stanford, USA
    • Vandenberghe, L. and Boyd, S. (1994). SP: Software for semidefinite programming. Information Systems Laboratory, Electrical Engineering Department, Stanford University, Stanford, USA.
    • (1994) SP: Software for Semidefinite Programming
    • Vandenberghe, L.1    Boyd, S.2
  • 29
    • 0003058678 scopus 로고
    • An O(√ηL)-iteration homogeneous and self-dual linear programming algorithm
    • Ye, Y., Todd, M. J. and Mizuno S. (1994). An O(√ηL)-iteration homogeneous and self-dual linear programming algorithm, Mathematics of Operations Research, 19, 53-67.
    • (1994) Mathematics of Operations Research , vol.19 , pp. 53-67
    • Ye, Y.1    Todd, M.J.2    Mizuno, S.3


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