Correction to: ``Complexity of stochastic dual dynamic programming
From MaRDI portal
Publication:2149581
DOI10.1007/S10107-022-01798-4zbMATH Open1496.90044OpenAlexW4220948163MaRDI QIDQ2149581FDOQ2149581
Publication date: 29 June 2022
Published in: Mathematical Programming. Series A. Series B (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10107-022-01798-4
Convex programming (90C25) Numerical methods based on nonlinear programming (49M37) Semidefinite programming (90C22) Stochastic programming (90C15) Decentralized systems (93A14)
Cited In (4)
Recommendations
- On the convergence of stochastic dual dynamic programming and related methods π π
- Duality in stochastic linear and dynamic programming π π
- Corrigendum: Lagrange Multipliers in Stochastic Programming π π
- A comment on ``Computational complexity of stochastic programming problems π π
- Corrigendum to ``Dual random utility maximisation π π
- Improving the performance of stochastic dual dynamic programming π π
- Erratum to: ``Computational complexity of stochastic programming problems π π
- Complexity of stochastic dual dynamic programming π π
- Erratum to ``Risk-averse dynamic programming for Markov decision processes π π
- Correction to: ``Parallel and distributed computing for stochastic dual dynamic programming π π
This page was built for publication: Correction to: ``Complexity of stochastic dual dynamic programming
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2149581)