KOPS - The Institutional Repository of the University of Konstanz

Performance Bounds for the Scenario Approach and an Extension to a Class of Non-convex Programs

Performance Bounds for the Scenario Approach and an Extension to a Class of Non-convex Programs

Cite This

Files in this item

Files Size Format View

There are no files associated with this item.

MOHAJERIN ESFAHANI, Peyman, Tobias SUTTER, John LYGEROS, 2014. Performance Bounds for the Scenario Approach and an Extension to a Class of Non-convex Programs. In: IEEE Transactions on Automatic Control. IEEE. 60(1), pp. 46-58. ISSN 0018-9286. eISSN 1558-2523. Available under: doi: 10.1109/TAC.2014.2330702

@article{MohajerinEsfahani2014Perfo-55734, title={Performance Bounds for the Scenario Approach and an Extension to a Class of Non-convex Programs}, year={2014}, doi={10.1109/TAC.2014.2330702}, number={1}, volume={60}, issn={0018-9286}, journal={IEEE Transactions on Automatic Control}, pages={46--58}, author={Mohajerin Esfahani, Peyman and Sutter, Tobias and Lygeros, John} }

<rdf:RDF xmlns:dcterms="http://purl.org/dc/terms/" xmlns:dc="http://purl.org/dc/elements/1.1/" xmlns:rdf="http://www.w3.org/1999/02/22-rdf-syntax-ns#" xmlns:bibo="http://purl.org/ontology/bibo/" xmlns:dspace="http://digital-repositories.org/ontologies/dspace/0.1.0#" xmlns:foaf="http://xmlns.com/foaf/0.1/" xmlns:void="http://rdfs.org/ns/void#" xmlns:xsd="http://www.w3.org/2001/XMLSchema#" > <rdf:Description rdf:about="https://kops.uni-konstanz.de/rdf/resource/123456789/55734"> <dc:language>eng</dc:language> <dc:rights>terms-of-use</dc:rights> <dspace:isPartOfCollection rdf:resource="https://kops.uni-konstanz.de/rdf/resource/123456789/36"/> <bibo:uri rdf:resource="https://kops.uni-konstanz.de/handle/123456789/55734"/> <dc:creator>Lygeros, John</dc:creator> <dcterms:issued>2014</dcterms:issued> <foaf:homepage rdf:resource="http://localhost:8080/jspui"/> <dc:date rdf:datatype="http://www.w3.org/2001/XMLSchema#dateTime">2021-12-02T12:20:10Z</dc:date> <dcterms:abstract xml:lang="eng">We consider the Scenario Convex Program (SCP) for two classes of optimization problems that are not tractable in general: Robust Convex Programs (RCPs) and Chance-Constrained Programs (CCPs). We establish a probabilistic bridge from the optimal value of SCP to the optimal values of RCP and CCP in which the uncertainty takes values in a general, possibly infinite dimensional, metric space. We then extend our results to a certain class of non-convex problems that includes, for example, binary decision variables. In the process, we also settle a measurability issue for a general class of scenario programs, which to date has been addressed by an assumption. Finally, we demonstrate the applicability of our results on a benchmark problem and a problem in fault detection and isolation.</dcterms:abstract> <dcterms:available rdf:datatype="http://www.w3.org/2001/XMLSchema#dateTime">2021-12-02T12:20:10Z</dcterms:available> <dc:creator>Mohajerin Esfahani, Peyman</dc:creator> <dc:creator>Sutter, Tobias</dc:creator> <dc:contributor>Sutter, Tobias</dc:contributor> <dcterms:title>Performance Bounds for the Scenario Approach and an Extension to a Class of Non-convex Programs</dcterms:title> <dc:contributor>Mohajerin Esfahani, Peyman</dc:contributor> <dc:contributor>Lygeros, John</dc:contributor> <dcterms:isPartOf rdf:resource="https://kops.uni-konstanz.de/rdf/resource/123456789/36"/> <void:sparqlEndpoint rdf:resource="http://localhost/fuseki/dspace/sparql"/> <dcterms:rights rdf:resource="https://rightsstatements.org/page/InC/1.0/"/> </rdf:Description> </rdf:RDF>

This item appears in the following Collection(s)

Search KOPS


Browse

My Account