메뉴 건너뛰기




Volumn 9, Issue PART 1, 2007, Pages 227-231

A randomized method for solving semidefinite programs

Author keywords

Center of mass; Linear matrix inequalities; Optimization; Random walk

Indexed keywords

LINEAR MATRIX INEQUALITIES; OPTIMIZATION; RANDOM PROCESSES; SIGNAL PROCESSING;

EID: 79961073187     PISSN: 14746670     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.3182/20070829-3-ru-4911.00037     Document Type: Conference Paper
Times cited : (2)

References (12)
  • 1
    • 0036353423 scopus 로고    scopus 로고
    • On tractable approximations of uncertain linear matrix inequalities affected by interval uncertainty
    • A. Ben-Tal and A. Nemirovski. On tractable approximations of uncertain linear matrix inequalities affected by interval uncertainty. SIAM J. Optimiz., 12(3):811-833, 2002.
    • (2002) SIAM J. Optimiz. , vol.12 , Issue.3 , pp. 811-833
    • Ben-Tal, A.1    Nemirovski, A.2
  • 2
    • 4243173687 scopus 로고    scopus 로고
    • Solving convex programs by random walks
    • 2004
    • D. Bertsimas and S. Vempala. Solving convex programs by random walks. J. ACM, 51(4):540-556, 2004.
    • J. ACM , vol.51 , Issue.4 , pp. 540-556
    • Bertsimas, D.1    Vempala, S.2
  • 3
    • 0037856528 scopus 로고
    • Linear matrix inequalities in system and control theory
    • Philadelphia
    • S. P. Boyd, L. El Ghaoui, E. Feron, and V. Balakrishnan. Linear Matrix Inequalities in System and Control Theory, SIAM, Philadelphia, 1994.
    • (1994) SIAM
    • Boyd, S.P.1    Ghaoui, L.E.2    Feron, E.3    Balakrishnan, V.4
  • 4
    • 3843062491 scopus 로고    scopus 로고
    • Fast construction of robustness degradation function
    • X. Chen, K. Zhou, and J. Aravena. Fast construction of robustness degradation function. SIAM J. Control Optimiz., 46(6):1960-1971, 2004.
    • (2004) SIAM J. Control Optimiz. , vol.46 , Issue.6 , pp. 1960-1971
    • Chen, X.1    Zhou, K.2    Aravena, J.3
  • 5
    • 0032252302 scopus 로고    scopus 로고
    • Robust solutions to uncertain semidefinite programs
    • L. El-Ghaoui, F. Oustry, and H. Lebret. Robust solutions to uncertain semidefinite programs. SIAM J. Optimiz., 9(1):33-52, 1998.
    • (1998) SIAM J. Optimiz. , vol.9 , Issue.1 , pp. 33-52
    • El-Ghaoui, L.1    Oustry, F.2    Lebret, H.3
  • 6
    • 0005342311 scopus 로고    scopus 로고
    • Hit-and-run mixes fast
    • L. Lovász. Hit-and-run mixes fast. Math. Progr., 86:443- 461, 1999.
    • (1999) Math. Progr. , vol.86 , pp. 443-461
    • Lovász, L.1
  • 7
    • 0003254250 scopus 로고
    • Interior-Point polynomial algorithms in convex programming
    • Philadelphia
    • Yu. Nesterov and A. Nemirovskii. Interior-Point Polynomial Algorithms in Convex Programming. SIAM, Philadelphia, 1994.
    • (1994) SIAM
    • Nesterov, Yu.1    Nemirovskii, A.2
  • 8
    • 2942690830 scopus 로고    scopus 로고
    • Robust linear algebra and robust aperiodicity
    • A. Rantzer and C. I. Byrnes, editors, Springer
    • B. T. Polyak. Robust linear algebra and robust aperiodicity. In A. Rantzer and C. I. Byrnes, editors, Directions in Mathematical Systems Theory and Optimization, pages 249-260. Springer, 2003.
    • (2003) Directions in Mathematical Systems Theory and Optimization , pp. 249-260
    • Polyak, B.T.1
  • 9
    • 33751502452 scopus 로고    scopus 로고
    • The D-decomposition technique for linear matrix inequalities
    • B. T. Polyak and P. S. Shcherbakov. The D-decomposition technique for linear matrix inequalities. Automat. Remote Control, 67(11):159-174, 2006.
    • (2006) Automat. Remote Control , vol.67 , Issue.11 , pp. 159-174
    • Polyak, B.T.1    Shcherbakov, P.S.2
  • 11
    • 0021517318 scopus 로고
    • Efficient Monte Carlo procedures for generating points uniformly distributed over bounded regions
    • R. L. Smith. Efficient Monte Carlo procedures for generating points uniformly distributed over bounded regions. Operations Research, 32(6):1296-1308, 1984.
    • (1984) Operations Research , vol.32 , Issue.6 , pp. 1296-1308
    • Smith, R.L.1


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