.png){kind=icon}
.png){kind=icon}
Return
Sequential Randomized Algorithms for Robust Convex Optimization
.png){kind=icon}
PRE
AI
DOI：10.1109/TAC.2015.2423871.png)
.png){kind=icon}
Original request for help.png){kind=icon}
Share.png){kind=icon}
Save
Abstract
En 中文
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.
Keywords:
Optimization algorithms
randomized algorithms
robust control
AI Summary
Key information extracted from the uploaded paper, including a brief overview, abstract, background, key highlights, visual analysis, and future outlook.
Journal
IF:
7
Papers:
1.3W
Citations:
6.7W