Sequential randomized algorithms for sampled convex optimization

Mohammadreza Chamanbaz, Fabrizio Dabbene, Roberto Tempo, Venkatakrishnan Venkataramanan, Qing Guo Wang

Research output: Chapter in Book/Report/Conference proceedingConference contributionpeer-review

6 Citations (Scopus)

Abstract

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.

Original languageEnglish
Title of host publication2013 IEEE Conference on Computer Aided Control System Design, CACSD 2013
Pages182-187
Number of pages6
DOIs
Publication statusPublished - 2013
Externally publishedYes
Event2013 IEEE Conference on Computer Aided Control System Design, CACSD 2013 - Hyderabad, India
Duration: 28 Aug 201330 Aug 2013

Publication series

NameProceedings of the IEEE International Symposium on Computer-Aided Control System Design
ISSN (Print)2165-3011
ISSN (Electronic)2165-302X

Conference

Conference2013 IEEE Conference on Computer Aided Control System Design, CACSD 2013
Country/TerritoryIndia
CityHyderabad
Period28/08/1330/08/13

ASJC Scopus subject areas

  • Control and Systems Engineering
  • Computer Science Applications
  • Control and Optimization

Fingerprint

Dive into the research topics of 'Sequential randomized algorithms for sampled convex optimization'. Together they form a unique fingerprint.

Cite this