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.

Garulli, A., A., M., Vicino, A. (2008). Convex relaxations for quadratic distance problems. In Proceedings of the 47th IEEE Conference on Decision and Control (pp.5444-5449) [10.1109/CDC.2008.4739051].

Convex relaxations for quadratic distance problems

GARULLI, ANDREA;VICINO, ANTONIO
2008-01-01

Abstract

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.
2008
Garulli, A., A., M., Vicino, A. (2008). Convex relaxations for quadratic distance problems. In Proceedings of the 47th IEEE Conference on Decision and Control (pp.5444-5449) [10.1109/CDC.2008.4739051].
File in questo prodotto:
Non ci sono file associati a questo prodotto.

I documenti in IRIS sono protetti da copyright e tutti i diritti sono riservati, salvo diversa indicazione.

Utilizza questo identificativo per citare o creare un link a questo documento: https://hdl.handle.net/11365/25241
 Attenzione

Attenzione! I dati visualizzati non sono stati sottoposti a validazione da parte dell'ateneo