메뉴 건너뛰기




Volumn , Issue , 2007, Pages 6184-6189

New results on the scenario design approach

Author keywords

Probabilistic robustness; Randomized algorithms; Robust control; Robust convex optimization; Scenario design

Indexed keywords

COMPUTATIONAL COMPLEXITY; OPTIMIZATION; PROBLEM SOLVING; ROBUSTNESS (CONTROL SYSTEMS); SYSTEMS ANALYSIS; THEOREM PROVING;

EID: 62749088946     PISSN: 07431546     EISSN: 25762370     Source Type: Conference Proceeding    
DOI: 10.1109/CDC.2007.4434039     Document Type: Conference Paper
Times cited : (3)

References (12)
  • 4
    • 0035508269 scopus 로고    scopus 로고
    • Stochastic algorithms for exact and approximate feasibility of robust LMIs
    • G. Calafiore and B.T. Polyak. Stochastic algorithms for exact and approximate feasibility of robust LMIs. IEEE Transactions on Automatic Control, 46:1755-1759, 2001.
    • (2001) IEEE Transactions on Automatic Control , vol.46 , pp. 1755-1759
    • Calafiore, G.1    Polyak, B.T.2
  • 5
    • 0038729656 scopus 로고    scopus 로고
    • An ellipsoid algorithm for probabilistic robust controller design
    • S. Kanev, B. De Schutter, and M. Verhaegen. An ellipsoid algorithm for probabilistic robust controller design. Systems & Control Letters, 49:365-375, 2003.
    • (2003) Systems & Control Letters , vol.49 , pp. 365-375
    • Kanev, S.1    De Schutter, B.2    Verhaegen, M.3
  • 7
    • 36248992411 scopus 로고    scopus 로고
    • Convex approximations of chance constrained programs
    • to appear in
    • A. Nemirovski and A. Shapiro. Convex approximations of chance constrained programs, to appear in SIAM Journal on Optimization, 2006.
    • (2006) SIAM Journal on Optimization
    • Nemirovski, A.1    Shapiro, A.2
  • 8
    • 34547436607 scopus 로고    scopus 로고
    • Scenario approximations of chance constraints
    • G.C. Calafiore and F. Dabbene, editors, Springer-Verlag, London
    • A. Nemirovski and A. Shapiro. Scenario approximations of chance constraints. In G.C. Calafiore and F. Dabbene, editors, Probabilistic and Randomized Methods for Design under Uncertainty, pages 3-47. Springer-Verlag, London, 2006.
    • (2006) Probabilistic and Randomized Methods for Design under Uncertainty , pp. 3-47
    • Nemirovski, A.1    Shapiro, A.2
  • 9
    • 33846781128 scopus 로고    scopus 로고
    • Polynomial-time algorithms for probabilistic solutions of parameter-dependent linear matrix inequalities
    • Y. Oishi. Polynomial-time algorithms for probabilistic solutions of parameter-dependent linear matrix inequalities. Automatica, 43:538-545, 2007.
    • (2007) Automatica , vol.43 , pp. 538-545
    • Oishi, Y.1
  • 10
    • 0034916989 scopus 로고    scopus 로고
    • Probabilistic robust design with linear quadratic regulators
    • B.T. Polyak and R. Tempo. Probabilistic robust design with linear quadratic regulators. Systems & Control Letters, 43:343-353, 2001.
    • (2001) Systems & Control Letters , vol.43 , pp. 343-353
    • Polyak, B.T.1    Tempo, R.2
  • 11
    • 0000872569 scopus 로고    scopus 로고
    • Probabilistic robustness analysis: Explicit bounds for the minimum number of samples
    • R. Tempo, E.-W. Bai, and F. Dabbene. Probabilistic robustness analysis: Explicit bounds for the minimum number of samples. Systems & Control Letters, 30:237-242, 1997.
    • (1997) Systems & Control Letters , vol.30 , pp. 237-242
    • Tempo, R.1    Bai, E.-W.2    Dabbene, F.3


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