Two-Stage Stochastic Optimization Via Primal-Dual Decomposition and Deep Unrolling
- 13 May 2021
- journal article
- research article
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Signal Processing
- Vol. 69 (1053587X) , 3000-3015
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 first runs a short-term sub-algorithm to find stationary points of the short-term subproblems associated with a mini-batch of the state samples. Then it constructs a convex surrogate for the long-term problem based on the deep unrolling of the short-term sub-algorithm and the back propagation method. Finally, the optimal solution of the convex surrogate problem is solved to generate the next iterate. We establish the almost sure convergence of PDD-SSCA and customize the algorithmic framework to solve two important application problems. Simulations show that PDD-SSCA can achieve superior performance over existing solutions.Keywords
All Related Versions
Funding Information
- National Natural Science Foundation of China (62071416)
- National Research Foundation, Singapore, and Infocomm Media Development Authority
- SUTD Growth Plan Grant
- SUTD-ZJU Seed Grant SUTD-ZJU (201909)
This publication has 34 references indexed in Scilit:
- A Parallel Decomposition Method for Nonconvex Stochastic Multi-Agent Optimization ProblemsIEEE Transactions on Signal Processing, 2016
- Playing with Duality: An overview of recent primal?dual approaches for solving large-scale optimization problemsIEEE Signal Processing Magazine, 2015
- Two-Stage Constant-Envelope Precoding for Low-Cost Massive MIMO SystemsIEEE Transactions on Signal Processing, 2015
- Two Timescale Joint Beamforming and Routing for Multi-Antenna D2D Networks via Stochastic Cutting PlaneIEEE Transactions on Signal Processing, 2015
- Phase Only RF Precoding for Massive MIMO Systems With Limited RF ChainsIEEE Transactions on Signal Processing, 2014
- A Primal-Dual Decomposition Algorithm for Multistage Stochastic Convex ProgrammingMathematical Programming, 2005
- A Vector-Perturbation Technique for Near-Capacity Multiantenna Multiuser Communication—Part I: Channel Inversion and RegularizationIEEE Transactions on Communications, 2005
- Stochastic Decomposition: An Algorithm for Two-Stage Linear Programs with RecourseMathematics of Operations Research, 1991
- Feature Article—The Ellipsoid Method: A SurveyOperations Research, 1981
- Feasible direction methods for stochastic programming problemsMathematical Programming, 1980