We discuss fast randomized algorithms for determining an admissible solution for robust linear matrix inequalities (LMIs) of the form F(x, Δ)⩽0, where x is the optimization variable and Δ is the uncertainty, which belongs to a given set Δ. The proposed algorithm is based on uncertainty randomization: it finds a solution in a finite number of iterations with probability one, if a strong feasibility condition holds. Otherwise, it computes a candidate solution which minimizes the expected value of a suitably selected feasibility indicator function. The theory is illustrated by examples of application to uncertain linear inequalities and quadratic stability of interval matrices
Fast Algorithms for Exact and Approximate Feasibility of Uncertain LMIs / Calafiore, Giuseppe Carlo; B., Polyak. - STAMPA. - 5:(2000), pp. 5035-5040. (Intervento presentato al convegno IEEE Conference on Decision and Control tenutosi a Sydney nel 12-15 Dec 2000) [10.1109/CDC.2001.914736].
Fast Algorithms for Exact and Approximate Feasibility of Uncertain LMIs
CALAFIORE, Giuseppe Carlo;
2000
Abstract
We discuss fast randomized algorithms for determining an admissible solution for robust linear matrix inequalities (LMIs) of the form F(x, Δ)⩽0, where x is the optimization variable and Δ is the uncertainty, which belongs to a given set Δ. The proposed algorithm is based on uncertainty randomization: it finds a solution in a finite number of iterations with probability one, if a strong feasibility condition holds. Otherwise, it computes a candidate solution which minimizes the expected value of a suitably selected feasibility indicator function. The theory is illustrated by examples of application to uncertain linear inequalities and quadratic stability of interval matricesPubblicazioni consigliate
I documenti in IRIS sono protetti da copyright e tutti i diritti sono riservati, salvo diversa indicazione.
https://hdl.handle.net/11583/1408985
Attenzione
Attenzione! I dati visualizzati non sono stati sottoposti a validazione da parte dell'ateneo