Two-Stage Stochastic Optimization via Primal-Dual Decomposition and Deep Unrolling
An Liu, Rui Yang, Tony Q. S. Quek, Min-Jian Zhao

TL;DR
This paper introduces a novel primal-dual decomposition and deep unrolling framework for two-stage stochastic optimization with coupled variables, enabling efficient solution of complex problems with convergence guarantees.
Contribution
It develops a PDD-SSCA algorithm that combines primal-dual decomposition, deep unrolling, and stochastic approximation to solve coupled two-stage stochastic problems effectively.
Findings
PDD-SSCA converges almost surely to KKT solutions.
The method outperforms existing solutions in simulations.
It effectively handles tightly coupled stochastic constraints.
Abstract
We consider a two-stage stochastic optimization problem, in which a long-term optimization variable is coupled with a set of short-term optimization variables in both objective and constraint functions. Despite that two-stage stochastic optimization plays a critical role in various engineering and scientific applications, there still lack efficient algorithms, especially when the long-term and short-term variables are coupled in the constraints. To overcome the challenge caused by tightly coupled stochastic constraints, we first establish a two-stage primal-dual decomposition (PDD) method to decompose the two-stage problem into a long-term problem and a family of short-term subproblems. Then we propose a PDD-based stochastic successive convex approximation (PDD-SSCA) algorithmic framework to find KKT solutions for two-stage stochastic optimization problems. At each iteration, PDD-SSCA…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
