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 条
  • [31] Exact relaxations of non-convex variational problems
    René Meziat
    Diego Patiño
    Optimization Letters, 2008, 2 : 505 - 519
  • [32] Convex Relaxations for Nonlinear Stochastic Optimal Control Problems
    Shao, Yuanxun
    Robertson, Dillard
    Scott, Joseph K.
    2018 ANNUAL AMERICAN CONTROL CONFERENCE (ACC), 2018, : 3955 - 3960
  • [33] Generalized Relaxations of Nonexpansive Operators and Convex Feasibility Problems
    Cegielski, Andrzej
    NONLINEAR ANALYSIS AND OPTIMIZATION I: NONLINEAR ANALYSIS, 2010, 513 : 111 - 123
  • [34] Quadratic convex reformulations for a class of complex quadratic programming problems
    Lu, Cheng
    Kang, Gaojian
    Qu, Guangtai
    Deng, Zhibin
    COMPUTATIONAL OPTIMIZATION AND APPLICATIONS, 2025, 91 (01) : 125 - 144
  • [35] A Framework for Quadratic Form Maximization over Convex Sets through Nonconvex Relaxations
    Bhattiprolu, Vijay
    Lee, Euiwoong
    Naor, Assaf
    STOC '21: PROCEEDINGS OF THE 53RD ANNUAL ACM SIGACT SYMPOSIUM ON THEORY OF COMPUTING, 2021, : 870 - 881
  • [36] Using dual relaxations in multiobjective mixed-integer convex quadratic programming
    De Santis, Marianna
    Eichfelder, Gabriele
    Patria, Daniele
    Warnow, Leo
    JOURNAL OF GLOBAL OPTIMIZATION, 2024,
  • [37] SDP RELAXATIONS FOR QUADRATIC OPTIMIZATION PROBLEMS DERIVED FROM POLYNOMIAL OPTIMIZATION PROBLEMS
    Mevissen, Martin
    Kojima, Masakazu
    ASIA-PACIFIC JOURNAL OF OPERATIONAL RESEARCH, 2010, 27 (01) : 15 - 38
  • [38] Convex quadratic relaxations for mixed-integer nonlinear programs in power systems
    Hijazi H.
    Coffrin C.
    Hentenryck P.V.
    Mathematical Programming Computation, 2017, 9 (3) : 321 - 367
  • [39] Semidefinite relaxations for non-convex quadratic mixed-integer programming
    Buchheim, Christoph
    Wiegele, Angelika
    MATHEMATICAL PROGRAMMING, 2013, 141 (1-2) : 435 - 452
  • [40] Semidefinite relaxations for non-convex quadratic mixed-integer programming
    Christoph Buchheim
    Angelika Wiegele
    Mathematical Programming, 2013, 141 : 435 - 452
12345