Sequential Randomized Algorithms for Robust Convex Optimization
Sequential randomized algorithms are considered for robust convex optimization which minimizes a linear objective function subject to a parameter dependent convex constraint. Employing convex optimization and random sampling of parameter, these algorithms enable us to obtain a suboptimal solution wi...
Gespeichert in:
| Veröffentlicht in: | IEEE transactions on automatic control Jg. 60; H. 12; S. 3356 - 3361 |
|---|---|
| Hauptverfasser: | , |
| Format: | Journal Article |
| Sprache: | Englisch |
| Veröffentlicht: |
New York
IEEE
01.12.2015
The Institute of Electrical and Electronics Engineers, Inc. (IEEE) |
| Schlagworte: | |
| ISSN: | 0018-9286, 1558-2523 |
| Online-Zugang: | Volltext |
| Tags: |
Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
|
| Zusammenfassung: | Sequential randomized algorithms are considered for robust convex optimization which minimizes a linear objective function subject to a parameter dependent convex constraint. Employing convex optimization and random sampling of parameter, these algorithms enable us to obtain a suboptimal solution within reasonable computational time. The suboptimal solution is feasible in a probabilistic sense and the suboptimal value belongs to an interval which contains the optimal value. The maximum of the interval is the optimal value of the robust convex optimization plus a specified tolerance. On the other hand, its minimum is the optimal value of the chance constrained optimization which is a probabilistic relaxation of the robust convex optimization, with high probability. |
|---|---|
| Bibliographie: | ObjectType-Article-1 SourceType-Scholarly Journals-1 ObjectType-Feature-2 content type line 14 |
| ISSN: | 0018-9286 1558-2523 |
| DOI: | 10.1109/TAC.2015.2423871 |