Convex relaxations for quadratic distance problems

被引：1
|
作者：
Garulli, Andrea [1 ]
Masi, Alfio [1 ]
Vicino, Antonio [1 ]
机构：
[1] Univ Siena, Dipartimento Ingn Informaz, I-53100 Siena, Italy
来源：
47TH IEEE CONFERENCE ON DECISION AND CONTROL, 2008 (CDC 2008) | 2008年
关键词：
POSITIVE POLYNOMIALS; GLOBAL OPTIMIZATION; SQUARES;
D O I：
10.1109/CDC.2008.4739051
中图分类号：
TP [自动化技术、计算机技术];
学科分类号：
0812 ;
摘要：
Convex relaxations of nonconvex problems are a powerful tool for the analysis and design of control systems. An important family of nonconvex problems that are relevant to the control field is that of quadratic distance problems. In this paper, several convex relaxations are presented for quadratic distance problems which are based on the sum-of squares representation of positive polynomials. Relationships among the considered relaxations are discussed and numerical comparisons are presented, in order to highlight their degree of conservatism.
引用
收藏
页码：5444 / 5449
页数：6
相关论文
共 50 条
  • [21] Convex Relaxations for Nonconvex Optimal Control Problems
    Scott, Joseph K.
    Barton, Paul I.
    2011 50TH IEEE CONFERENCE ON DECISION AND CONTROL AND EUROPEAN CONTROL CONFERENCE (CDC-ECC), 2011, : 1042 - 1047
  • [22] On the convex hull of convex quadratic optimization problems with indicators
    Wei, Linchuan
    Atamturk, Alper
    Gomez, Andres
    Kucukyavuz, Simge
    MATHEMATICAL PROGRAMMING, 2024, 204 (1-2) : 703 - 737
  • [23] On the convex hull of convex quadratic optimization problems with indicators
    Linchuan Wei
    Alper Atamtürk
    Andrés Gómez
    Simge Küçükyavuz
    Mathematical Programming, 2024, 204 : 703 - 737
  • [24] Positive semidefinite relaxations for distance geometry problems
    Yasutoshi Yajima
    Japan Journal of Industrial and Applied Mathematics, 2002, 19 : 87 - 112
  • [25] Convex Relaxations for Quadratic On/Off Constraints and Applications to Optimal Transmission Switching
    Bestuzheva, Ksenia
    Hijazi, Hassan
    Coffrin, Carleton
    INFORMS JOURNAL ON COMPUTING, 2020, 32 (03) : 682 - 696
  • [26] Quadratic 0-1 programming: Tightening linear or quadratic convex reformulation by use of relaxations
    Billionnet, Alain
    Elloumi, Sourour
    Plateau, Marie-Christine
    RAIRO-OPERATIONS RESEARCH, 2008, 42 (02) : 103 - 121
  • [27] Positive semidefinite relaxations for distance geometry problems
    Yajima, Y
    JAPAN JOURNAL OF INDUSTRIAL AND APPLIED MATHEMATICS, 2002, 19 (01) : 87 - 112
  • [28] A repository of convex quadratic programming problems
    Maros, I
    Mészáros, C
    OPTIMIZATION METHODS & SOFTWARE, 1999, 11-2 (1-4): : 671 - 681
  • [29] Quadratic and Convex Minimax Classification problems
    Kitahara, Tomonari
    Mizuno, Shinji
    Nakata, Kazuhide
    JOURNAL OF THE OPERATIONS RESEARCH SOCIETY OF JAPAN, 2008, 51 (02) : 191 - 201
  • [30] Exact relaxations of non-convex variational problems
    Meziat, Rene
    Patino, Diego
    OPTIMIZATION LETTERS, 2008, 2 (04) : 505 - 519
12345