Two-Stage Stochastic Optimization Via Primal-Dual Decomposition and Deep Unrolling

@article{Liu2021TwoStageSO,
  title={Two-Stage Stochastic Optimization Via Primal-Dual Decomposition and Deep Unrolling},
  author={An Liu and Rui Yang and Tony Q. S. Quek and Min-Jian Zhao},
  journal={IEEE Transactions on Signal Processing},
  year={2021},
  volume={69},
  pages={3000-3015}
}
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… 
2 Citations

Figures and Tables from this paper

Generative design of truss systems by the integration of topology and shape optimisation

A novel parameterisation method is proposed to directly integrate topology and shape optimisation to achieve an automated design process suitable for investigating a large number of potential solutions and selecting and refining an optimal design for a given loading condition.

Generative design of truss systems by the integration of topology and shape optimisation

A novel parameterisation method is proposed to directly integrate topology and shape optimisation to achieve an automated design process suitable for investigating a large number of potential solutions and selecting and refining an optimal design for a given loading condition.

References

SHOWING 1-10 OF 41 REFERENCES

Online Successive Convex Approximation for Two-Stage Stochastic Nonconvex Optimization

This paper proposes a two-stage online successive convex approximation (TOSCA) algorithm and customize the algorithmic framework to solve three important application problems and shows that the TOSCA algorithm can achieve superior performance over existing solutions.

A Primal-Dual Decomposition Algorithm for Multistage Stochastic Convex Programming

A new decomposition algorithm for multistage Stochastic programming with a convex objective and stochastic recourse matrices is proposed, based on the path-following interior point method combined with the homogeneous self-dual embedding technique.

A Parallel Decomposition Method for Nonconvex Stochastic Multi-Agent Optimization Problems

Numerical results corroborate that the proposed algorithms can converge faster than state-of-the-art stochastic gradient schemes while achieving the same (or better) sum-rates.

Stochastic Majorization-Minimization Algorithms for Large-Scale Optimization

A stochastic majorization-minimization scheme which is able to deal with large-scale or possibly infinite data sets, and achieves an expected convergence rate of O(1/\sqrt{n}) after $n$ iterations, and of $O( 1/n) for strongly convex functions.

Playing with Duality: An Overview of Recent Primal-Dual Approaches for Solving Large-Scale Optimization Problems

The benefits which can be drawn from primal-dual algo rithms both for solving large-scale convex optimization problems and discrete ones, and the overview of numerical approaches which have been proposed in different contexts are shown.

Stochastic Successive Convex Approximation for Non-Convex Constrained Stochastic Optimization

Simulations show that the CSSCA algorithm can achieve superior performance over existing solutions, and customize the algorithmic framework to solve several important application problems.

Decomposition by Partial Linearization: Parallel Optimization of Multi-Agent Systems

This work proposes a novel decomposition framework for the distributed optimization of general nonconvex sum-utility functions arising naturally in the system design of wireless multi-user interfering systems, and develops the first class of (inexact) Jacobi best-response algorithms with provable convergence.

A New Technique for Nonconvex Primal-Dual Decomposition of a Large-Scale Separable Optimization Problem

The primal-dual approach is quite effective in decomposing a convex separable optimization problem into several subproblems of smaller sizes. In this paper, we present a new technique which extends

Stochastic Decomposition: An Algorithm for Two-Stage Linear Programs with Recourse

A cutting plane algorithm for two-stage stochastic linear programs with recourse that uses randomly generated observations of random variables to construct statistical estimates of supports of the objective function and establishes the convergence of the algorithm under relatively mild assumptions.

Dual methods for nonconvex spectrum optimization of multicarrier systems

  • Wei YuR. Lui
  • Computer Science
    IEEE Transactions on Communications
  • 2006
It is shown that under a certain condition called the time-sharing condition, the duality gap of the optimization problem is always zero, regardless of the convexity of the objective function, which leads to efficient numerical algorithms that solve the nonconvex problem in the dual domain.