TY - GEN
T1 - Sequential randomized algorithms for sampled convex optimization
AU - Chamanbaz, Mohammadreza
AU - Dabbene, Fabrizio
AU - Tempo, Roberto
AU - Venkataramanan, Venkatakrishnan
AU - Wang, Qing Guo
PY - 2013
Y1 - 2013
N2 - Motivated by the complexity of solving convex scenario problems in one-shot, two new algorithms for the sequential solution of sampled convex optimization problems are presented, for full constraint satisfaction and partial constraint satisfaction, respectively. A rigorous analysis of the theoretical properties of the algorithms is provided, and the related sample complexity is derived. Extensive numerical simulations for a non-trivial example testify the goodness of the proposed solution.
AB - Motivated by the complexity of solving convex scenario problems in one-shot, two new algorithms for the sequential solution of sampled convex optimization problems are presented, for full constraint satisfaction and partial constraint satisfaction, respectively. A rigorous analysis of the theoretical properties of the algorithms is provided, and the related sample complexity is derived. Extensive numerical simulations for a non-trivial example testify the goodness of the proposed solution.
UR - http://www.scopus.com/inward/record.url?scp=84893699226&partnerID=8YFLogxK
U2 - 10.1109/CACSD.2013.6663480
DO - 10.1109/CACSD.2013.6663480
M3 - Conference contribution
AN - SCOPUS:84893699226
SN - 9781479915651
T3 - Proceedings of the IEEE International Symposium on Computer-Aided Control System Design
SP - 182
EP - 187
BT - 2013 IEEE Conference on Computer Aided Control System Design, CACSD 2013
T2 - 2013 IEEE Conference on Computer Aided Control System Design, CACSD 2013
Y2 - 28 August 2013 through 30 August 2013
ER -