http://www.cnr.it/ontology/cnr/individuo/prodotto/ID20707
Reduced Vertex Set Results for Interval Semidefinite Optimization Problems (Articolo in rivista)
- Type
- Label
- Reduced Vertex Set Results for Interval Semidefinite Optimization Problems (Articolo in rivista) (literal)
- Anno
- 2008-01-01T00:00:00+01:00 (literal)
- Http://www.cnr.it/ontology/cnr/pubblicazioni.owl#doi
- 10.1007/s10957-008-9423-1 (literal)
- Alternative label
- Http://www.cnr.it/ontology/cnr/pubblicazioni.owl#autori
- G. Calafiore, F. Dabbene (literal)
- Pagina inizio
- Pagina fine
- Http://www.cnr.it/ontology/cnr/pubblicazioni.owl#numeroVolume
- Rivista
- Http://www.cnr.it/ontology/cnr/pubblicazioni.owl#numeroFascicolo
- Note
- ISI Web of Science (WOS) (literal)
- Http://www.cnr.it/ontology/cnr/pubblicazioni.owl#affiliazioni
- G. Calafiore : Dipartimento di Automatica e Informatica Politecnico di Torino
F. Dabbene : CNR-IEIIT (literal)
- Titolo
- Reduced Vertex Set Results for Interval Semidefinite Optimization Problems (literal)
- Abstract
- In this paper we propose a reduced vertex result for the robust solution of uncertain semidefinite optimization problems subject to interval uncertainty. If the number of decision variables is m and the size of the coefficient matrices in the linear matrix inequality constraints is nxn, a direct vertex approach would require satisfaction of 2(n(m+1)(n+1)/2) vertex constraints: a huge number, even for small values of n and m. The conditions derived here are instead based on the introduction of m slack variables and a subset of vertex coefficient matrices of cardinality 2(n-1), thus reducing the problem to a practically manageable size, at least for small n. A similar size reduction is also obtained for a class of problems with affinely dependent interval uncertainty. (literal)
- Prodotto di
- Autore CNR
- Insieme di parole chiave
Incoming links:
- Prodotto
- Autore CNR di
- Http://www.cnr.it/ontology/cnr/pubblicazioni.owl#rivistaDi
- Insieme di parole chiave di
