Optimization Online


On regularization with normal solutions in decomposition methods for multistage stochastic programming

Wim van Ackooij(wim.van.ackooij***at***gmail.com)
Welington de Oliveira(welington***at***ime.uerj.br)
Yongjia Song(ysong3***at***vcu.edu)

Abstract: We consider well-known decomposition techniques for multistage stochastic programming and a new scheme based on normal solutions for stabilizing calculations as the iteration process progresses. The given algorithms combine ideas from finite perturbation of convex programs and level bundle methods to regularize the so-called forward step of these decomposition methods. In contrast to other regularized approaches for multistage programs, the given algorithms do not suffer from the effect of bad quality incumbent points. We also improve the backward step (that generates cuts, approximating the cost-to-go functions) by employing an adaptive partition-based approach to reduce the computational burden. Numerical experiments on a hydrothermal scheduling problem indicate that our second algorithm exhibits significantly faster convergence than the classical Stochastic Dual Dynamic Programming algorithm.

Keywords: Normal Solution, SDDP algorithm, Stochastic Optimization, Nonsmooth optimization

Category 1: Stochastic Programming

Category 2: Convex and Nonsmooth Optimization (Nonsmooth Optimization )

Citation: submitted paper

Download: [PDF]

Entry Submitted: 01/10/2017
Entry Accepted: 01/10/2017
Entry Last Modified: 01/10/2017

Modify/Update this entry

  Visitors Authors More about us Links
  Subscribe, Unsubscribe
Digest Archive
Search, Browse the Repository


Coordinator's Board
Classification Scheme
Give us feedback
Optimization Journals, Sites, Societies
Mathematical Optimization Society