Abstract
Based on a successive convex programming method, an alternating iteration algorithm is proposed for solving a parameter-dependent distributionally robust optimization. Under the Slater-type condition, the convergence analysis of the algorithm is obtained. When the objective function is convex, a modified algorithm is proposed and a less-conservative solution is obtained. Lastly, some numerical tests results are illustrated to show the efficiency of the algorithm.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have