Learning Algorithms for Separable Approximations of Discrete Stochastic Optimization Problems

Authors:
Warren Powell;Andrzej Ruszczynski;Huseyin Topaloglu
Affiliations:
-;-;-
Venue:
Mathematics of Operations Research
Year:
2004

Citing 0
Cited 15

Dynamic-Programming Approximations for Stochastic Time-Staged Integer Multicommodity-Flow Problems

INFORMS Journal on Computing
The optimizing-simulator: merging simulation and optimization using approximate dynamic programming

Proceedings of the 39th conference on Winter simulation: 40 years! The best is yet to come
Dynamic modeling and control of supply chain systems: A review

Computers and Operations Research
A Nonparametric Asymptotic Analysis of Inventory Planning with Censored Demand

Mathematics of Operations Research
An Optimal Approximate Dynamic Programming Algorithm for the Lagged Asset Acquisition Problem

Mathematics of Operations Research
An Adaptive Algorithm for Finding the Optimal Base-Stock Policy in Lost Sales Inventory Systems with Censored Demand

Mathematics of Operations Research
Feature Article---Merging AI and OR to Solve High-Dimensional Stochastic Optimization Problems Using Approximate Dynamic Programming

INFORMS Journal on Computing
Dynamic Programming Models and Algorithms for the Mutual Fund Cash Balance Problem

Management Science
Robust Approximation to Multiperiod Inventory Management

Operations Research
A stochastic approximation method with max-norm projections and its applications to the Q-learning algorithm

ACM Transactions on Modeling and Computer Simulation (TOMACS)
Online algorithms for the newsvendor problem with and without censored demands

FAW'10 Proceedings of the 4th international conference on Frontiers in algorithmics
Adaptive Data-Driven Inventory Control with Censored Demand Based on Kaplan-Meier Estimator

Operations Research
The Effect of Robust Decisions on the Cost of Uncertainty in Military Airlift Operations

ACM Transactions on Modeling and Computer Simulation (TOMACS)
On the convergence of stochastic dual dynamic programming and related methods

Operations Research Letters
SMART: A Stochastic Multiscale Model for the Analysis of Energy Resources, Technology, and Policy

INFORMS Journal on Computing

Quantified Score

Hi-index	0.00

Visualization

Abstract

We propose the use of sequences of separable, piecewise linear approximations for solving nondifferentiable stochastic optimization problems. The approximations are constructed adaptively using a combination of stochastic subgradient information and possibly sample information on the objective function itself. We prove the convergence of several versions of such methods when the objective function is separable and has integer break points, and we illustrate their behavior on numerical examples. We then demonstrate the performance on nonseparable problems that arise in the context of two-stage stochastic programming problems, and demonstrate that these techniques provide near-optimal solutions with a very fast rate of convergence compared with other solution techniques.