On approximate robust counterparts of uncertain semidefinite and conic quadratic programs

被引:0
|
作者
Ben-Tal, A [1 ]
Nemirovski, A [1 ]
机构
[1] Technion Israel Inst Technol, Fac Ind Engn & Management, IL-32000 Haifa, Israel
来源
关键词
D O I
暂无
中图分类号
C93 [管理学]; O22 [运筹学];
学科分类号
070105 ; 12 ; 1201 ; 1202 ; 120202 ;
摘要
We present efficiently verifiable-sufficient conditions for the validity of specific NP-hard semi-infinite systems of semidefinite and conic quadratic constraints arising in the framework of Robust Convex Programming and demonstrate that these conditions are "tight" up to an absolute constant factor. We discuss applications in Control on the construction of a quadratic Lyapunov function for linear dynamic system under interval uncertainty.
引用
收藏
页码:1 / 22
页数:22
相关论文
共 50 条
  • [31] Semidefinite approximations for quadratic programs over orthogonal matrices
    Povh, Janez
    [J]. JOURNAL OF GLOBAL OPTIMIZATION, 2010, 48 (03) : 447 - 463
  • [32] Acyclic Semidefinite Approximations of Quadratically Constrained Quadratic Programs
    Louca, Raphael
    Bitar, Eilyan
    [J]. 2015 AMERICAN CONTROL CONFERENCE (ACC), 2015, : 5925 - 5930
  • [33] Semidefinite approximations for quadratic programs over orthogonal matrices
    Janez Povh
    [J]. Journal of Global Optimization, 2010, 48 : 447 - 463
  • [34] A Hierarchy of Polyhedral Approximations of Robust Semidefinite Programs
    Louca, Raphael
    Bitar, Eilyan
    [J]. 2016 IEEE 55TH CONFERENCE ON DECISION AND CONTROL (CDC), 2016, : 7056 - 7062
  • [35] Agent independent probabilistic robustness certificates for robust optimization programs with uncertain quadratic cost
    Pantazis, George
    Fele, Filiberto
    Margellos, Kostas
    [J]. 2020 59TH IEEE CONFERENCE ON DECISION AND CONTROL (CDC), 2020, : 554 - 559
  • [36] On approximate solutions for robust convex semidefinite optimization problems
    Lee, Jae Hyoung
    Lee, Gue Myung
    [J]. POSITIVITY, 2018, 22 (03) : 845 - 857
  • [37] Extending Scope of Robust Optimization: Comprehensive Robust Counterparts of Uncertain Problems
    Aharon Ben-Tal
    Stephen Boyd
    Arkadi Nemirovski
    [J]. Mathematical Programming, 2006, 107 : 63 - 89
  • [38] Extending scope of robust optimization: Comprehensive robust counterparts of uncertain problems
    Ben-Tal, A
    Boyd, S
    Nemirovski, A
    [J]. MATHEMATICAL PROGRAMMING, 2006, 107 (1-2) : 63 - 89
  • [39] On approximate solutions for robust convex semidefinite optimization problems
    Jae Hyoung Lee
    Gue Myung Lee
    [J]. Positivity, 2018, 22 : 845 - 857
  • [40] Decompositions of semidefinite matrices and the perspective reformulation of nonseparable quadratic programs
    Frangioni, Antonio
    Gentile, Claudio
    Hungerford, James
    [J]. Mathematics of Operations Research, 2020, 45 (01): : 15 - 33