Please use this identifier to cite or link to this item: https://doi.org/10.1137/060665506
DC FieldValue
dc.titleSuccessive linear approximation solution of infinite-horizon dynamic stochastic programs
dc.contributor.authorBirge, J.R.
dc.contributor.authorZhao, G.
dc.date.accessioned2014-10-28T02:46:39Z
dc.date.available2014-10-28T02:46:39Z
dc.date.issued2007
dc.identifier.citationBirge, J.R., Zhao, G. (2007). Successive linear approximation solution of infinite-horizon dynamic stochastic programs. SIAM Journal on Optimization 18 (4) : 1165-1186. ScholarBank@NUS Repository. https://doi.org/10.1137/060665506
dc.identifier.issn10526234
dc.identifier.urihttp://scholarbank.nus.edu.sg/handle/10635/104216
dc.description.abstractModels for long-term planning often lead to infinite-horizon stochastic programs that offer significant challenges for computation. Finite-horizon approximations are often used in these cases, but they may also become computationally difficult. In this paper, we directly solve for value functions of infinite-horizon stochastic programs. We show that a successive linear approximation method converges to an optimal value function for the case with convex objective, linear dynamics, and feasible continuation. © 2007 Society for Industrial and Applied Mathematics.
dc.description.urihttp://libproxy1.nus.edu.sg/login?url=http://dx.doi.org/10.1137/060665506
dc.sourceScopus
dc.subjectCutting planes
dc.subjectDynamic programming
dc.subjectInfinite horizon
dc.subjectLinear approximation
dc.subjectStochastic programming
dc.typeArticle
dc.contributor.departmentMATHEMATICS
dc.description.doi10.1137/060665506
dc.description.sourcetitleSIAM Journal on Optimization
dc.description.volume18
dc.description.issue4
dc.description.page1165-1186
dc.identifier.isiut000207940400002
Appears in Collections:Staff Publications

Show simple item record
Files in This Item:
There are no files associated with this item.

Google ScholarTM

Check

Altmetric


Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.