A Stochastic Conjugate Subgradient Algorithm for Two-stage Stochastic Programming

Stochastic Optimization is a cornerstone of operations research, providing a framework to solve optimization problems under uncertainty. Despite the development of numerous algorithms to tackle these problems, several persistent challenges remain, including: (i) selecting an appropriate sample size, (ii) determining an effective search direction, and (iii) choosing a proper step size. This paper introduces a comprehensive framework, the Stochastic Conjugate Subgradient (SCS) framework, designed to systematically address these challenges. Specifically, The SCS framework offers structured approaches to determining the sample size, the search direction, and the step size. By integrating various stochastic algorithms within the SCS framework, we have developed a novel stochastic algorithm for two-stage stochastic programming. The convergence and convergence rates of the algorithm have been rigorously established, with preliminary computational results support the theoretical analysis.