Scenario approach for minmax optimization with emphasis on the nonconvex case: positive results and caveats
Fuente:
arXiv
Saved in:
| Main Authors: | , , |
|---|---|
| Format: | Preprint |
| Published: |
2019
|
| Subjects: | |
| Online Access: | |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| _version_ | 1866910614597664768 |
|---|---|
| author | K, Mishal Assif P Chatterjee, Debasish Banavar, Ravi |
| author_facet | K, Mishal Assif P Chatterjee, Debasish Banavar, Ravi |
| contents | We treat the so-called scenario approach, a popular probabilistic approximation method for robust minmax optimization problems via independent and indentically distributed (i.i.d) sampling from the uncertainty set, from various perspectives. The scenario approach is well-studied in the important case of convex robust optimization problems, and here we examine how the phenomenon of concentration of measures affects the i.i.d sampling aspect of the scenario approach in high dimensions and its relation with the optimal values. Moreover, we perform a detailed study of both the asymptotic behaviour (consistency) and finite time behaviour of the scenario approach in the more general setting of nonconvex minmax optimization problems. In the direction of the asymptotic behaviour of the scenario approach, we present an obstruction to consistency that arises when the decision set is noncompact. In the direction of finite sample guarantees, we establish a general methodology for extracting `probably approximately correct' type estimates for the finite sample behaviour of the scenario approach for a large class of nonconvex problems. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_1906_01476 |
| institution | arXiv |
| publishDate | 2019 |
| record_format | arxiv |
| spellingShingle | Scenario approach for minmax optimization with emphasis on the nonconvex case: positive results and caveats K, Mishal Assif P Chatterjee, Debasish Banavar, Ravi Optimization and Control Systems and Control Probability Machine Learning 90C47, 90C26, We treat the so-called scenario approach, a popular probabilistic approximation method for robust minmax optimization problems via independent and indentically distributed (i.i.d) sampling from the uncertainty set, from various perspectives. The scenario approach is well-studied in the important case of convex robust optimization problems, and here we examine how the phenomenon of concentration of measures affects the i.i.d sampling aspect of the scenario approach in high dimensions and its relation with the optimal values. Moreover, we perform a detailed study of both the asymptotic behaviour (consistency) and finite time behaviour of the scenario approach in the more general setting of nonconvex minmax optimization problems. In the direction of the asymptotic behaviour of the scenario approach, we present an obstruction to consistency that arises when the decision set is noncompact. In the direction of finite sample guarantees, we establish a general methodology for extracting `probably approximately correct' type estimates for the finite sample behaviour of the scenario approach for a large class of nonconvex problems. |
| title | Scenario approach for minmax optimization with emphasis on the nonconvex case: positive results and caveats |
| topic | Optimization and Control Systems and Control Probability Machine Learning 90C47, 90C26, |
| url | https://arxiv.org/abs/1906.01476 |