Articles liés à Numerical Methods for Convex Multistage Stochastic...
Synopsis
Optimization problems involving sequential decisions in a stochastic environment were studied in Stochastic Programming (SP), Stochastic Optimal Control (SOC) and Markov Decision Processes (MDP). This monograph concentrates on SP and SOC modeling approaches. In these frameworks, there are natural situations when the considered problems are convex. The classical approach to sequential optimization is based on dynamic programming. It has the problem of the so-called "curse of dimensionality", in that its computational complexity increases exponentially with respect to the dimension of state variables. Recent progress in solving convex multistage stochastic problems is based on cutting plane approximations of the cost-to-go (value) functions of dynamic programming equations. Cutting plane type algorithms in dynamical settings is one of the main topics of this monograph. Also discussed in this work are stochastic approximation type methods applied to multistage stochastic optimization problems. From the computational complexity point of view, these two types of methods seem to be complimentary to each other. Cutting plane type methods can handle multistage problems with a large number of stages but a relatively smaller number of state (decision) variables. On the other hand, stochastic approximation type methods can only deal with a small number of stages but a large number of decision variables.
Les informations fournies dans la section « Synopsis » peuvent faire référence à une autre édition de ce titre.
Acheter neuf
Afficher cet article
EUR 66,93
EUR 6,84 expédition depuis Etats-Unis vers France
Destinations, frais et délaisRésultats de recherche pour Numerical Methods for Convex Multistage Stochastic...
Image d'archives
Numerical Methods for Convex Multistage Stochastic Optimization
Edité par
Now Publishers, 2024
ISBN 10 : 1638283508
ISBN 13 : 9781638283508
Ancien ou d'occasion
Couverture souple
Vendeur : GreatBookPrices, Columbia, MD, Etats-Unis
Évaluation du vendeur 5 sur 5 étoiles
Etat : As New. Unread book in perfect condition. N° de réf. du vendeur 47759531
Quantité disponible : Plus de 20 disponibles
Image d'archives
Numerical Methods for Convex Multistage Stochastic Optimization (Foundations and Trends(r) in Optimization)
Vendeur : California Books, Miami, FL, Etats-Unis
Évaluation du vendeur 5 sur 5 étoiles
Etat : New. N° de réf. du vendeur I-9781638283508
Quantité disponible : Plus de 20 disponibles
Image d'archives
Numerical Methods for Convex Multistage Stochastic Optimization (Foundations and Trends(r) in Optimization)
Vendeur : Ria Christie Collections, Uxbridge, Royaume-Uni
Évaluation du vendeur 5 sur 5 étoiles
Etat : New. In. N° de réf. du vendeur ria9781638283508_new
Quantité disponible : Plus de 20 disponibles
Image d'archives
Numerical Methods for Convex Multistage Stochastic Optimization
impression à la demandeVendeur : PBShop.store US, Wood Dale, IL, Etats-Unis
Évaluation du vendeur 5 sur 5 étoiles
PAP. Etat : New. New Book. Shipped from UK. THIS BOOK IS PRINTED ON DEMAND. Established seller since 2000. N° de réf. du vendeur L0-9781638283508
Quantité disponible : Plus de 20 disponibles
Image d'archives
Numerical Methods for Convex Multistage Stochastic Optimization
impression à la demandeVendeur : PBShop.store UK, Fairford, GLOS, Royaume-Uni
Évaluation du vendeur 5 sur 5 étoiles
PAP. Etat : New. New Book. Delivered from our UK warehouse in 4 to 14 business days. THIS BOOK IS PRINTED ON DEMAND. Established seller since 2000. N° de réf. du vendeur L0-9781638283508
Quantité disponible : Plus de 20 disponibles
Image d'archives
Numerical Methods for Convex Multistage Stochastic Optimization
Vendeur : GreatBookPrices, Columbia, MD, Etats-Unis
Évaluation du vendeur 5 sur 5 étoiles
Etat : New. N° de réf. du vendeur 47759531-n
Quantité disponible : Plus de 20 disponibles
Image d'archives
Numerical Methods for Convex Multistage Stochastic Optimization
Edité par
now publishers Inc, 2024
ISBN 10 : 1638283508
ISBN 13 : 9781638283508
Neuf
Paperback / softback
Vendeur : THE SAINT BOOKSTORE, Southport, Royaume-Uni
Évaluation du vendeur 5 sur 5 étoiles
Paperback / softback. Etat : New. This item is printed on demand. New copy - Usually dispatched within 5-9 working days 146. N° de réf. du vendeur C9781638283508
Quantité disponible : Plus de 20 disponibles
Image fournie par le vendeur
Numerical Methods for Convex Multistage Stochastic Optimization
Vendeur : Rarewaves.com UK, London, Royaume-Uni
Évaluation du vendeur 4 sur 5 étoiles
Paperback. Etat : New. Optimization problems involving sequential decisions in a stochastic environment were studied in Stochastic Programming (SP), Stochastic Optimal Control (SOC) and Markov Decision Processes (MDP). This monograph concentrates on SP and SOC modeling approaches. In these frameworks, there are natural situations when the considered problems are convex. The classical approach to sequential optimization is based on dynamic programming. It has the problem of the so-called "curse of dimensionality", in that its computational complexity increases exponentially with respect to the dimension of state variables.Recent progress in solving convex multistage stochastic problems is based on cutting plane approximations of the cost-to-go (value) functions of dynamic programming equations. Cutting plane type algorithms in dynamical settings is one of the main topics of this monograph. Also discussed in this work are stochastic approximation type methods applied to multistage stochastic optimization problems. From the computational complexity point of view, these two types of methods seem to be complimentary to each other. Cutting plane type methods can handle multistage problems with a large number of stages but a relatively smaller number of state (decision) variables. On the other hand, stochastic approximation type methods can only deal with a small number of stages but a large number of decision variables. N° de réf. du vendeur LU-9781638283508
Quantité disponible : Plus de 20 disponibles
Image d'archives
Numerical Methods for Convex Multistage Stochastic Optimization
Vendeur : GreatBookPricesUK, Woodford Green, Royaume-Uni
Évaluation du vendeur 5 sur 5 étoiles
Etat : New. N° de réf. du vendeur 47759531-n
Quantité disponible : Plus de 20 disponibles
Image fournie par le vendeur
Numerical Methods for Convex Multistage Stochastic Optimization
Vendeur : Rarewaves.com USA, London, LONDO, Royaume-Uni
Évaluation du vendeur 4 sur 5 étoiles
Paperback. Etat : New. Optimization problems involving sequential decisions in a stochastic environment were studied in Stochastic Programming (SP), Stochastic Optimal Control (SOC) and Markov Decision Processes (MDP). This monograph concentrates on SP and SOC modeling approaches. In these frameworks, there are natural situations when the considered problems are convex. The classical approach to sequential optimization is based on dynamic programming. It has the problem of the so-called "curse of dimensionality", in that its computational complexity increases exponentially with respect to the dimension of state variables.Recent progress in solving convex multistage stochastic problems is based on cutting plane approximations of the cost-to-go (value) functions of dynamic programming equations. Cutting plane type algorithms in dynamical settings is one of the main topics of this monograph. Also discussed in this work are stochastic approximation type methods applied to multistage stochastic optimization problems. From the computational complexity point of view, these two types of methods seem to be complimentary to each other. Cutting plane type methods can handle multistage problems with a large number of stages but a relatively smaller number of state (decision) variables. On the other hand, stochastic approximation type methods can only deal with a small number of stages but a large number of decision variables. N° de réf. du vendeur LU-9781638283508
Quantité disponible : Plus de 20 disponibles