Articoli correlati a Numerical Methods for Convex Multistage Stochastic...
Sinossi
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.
Le informazioni nella sezione "Riassunto" possono far riferimento a edizioni diverse di questo titolo.
Compra nuovo
Visualizza questo articolo
EUR 66,77
EUR 7,68 per la spedizione da U.S.A. a Italia
Destinazione, tempi e costiRisultati della ricerca per Numerical Methods for Convex Multistage Stochastic...
Foto dell'editore
Numerical Methods for Convex Multistage Stochastic Optimization
Da: GreatBookPrices, Columbia, MD, U.S.A.
Valutazione del venditore 5 su 5 stelle
Condizione: As New. Unread book in perfect condition. Codice articolo 47759531
Quantità: Più di 20 disponibili
Foto dell'editore
Numerical Methods for Convex Multistage Stochastic Optimization (Foundations and Trends(r) in Optimization)
Da: California Books, Miami, FL, U.S.A.
Valutazione del venditore 5 su 5 stelle
Condizione: New. Codice articolo I-9781638283508
Quantità: Più di 20 disponibili
Foto dell'editore
Numerical Methods for Convex Multistage Stochastic Optimization
Print on DemandDa: PBShop.store US, Wood Dale, IL, U.S.A.
Valutazione del venditore 5 su 5 stelle
PAP. Condizione: New. New Book. Shipped from UK. THIS BOOK IS PRINTED ON DEMAND. Established seller since 2000. Codice articolo L0-9781638283508
Quantità: Più di 20 disponibili
Foto dell'editore
Numerical Methods for Convex Multistage Stochastic Optimization
Print on DemandDa: PBShop.store UK, Fairford, GLOS, Regno Unito
Valutazione del venditore 5 su 5 stelle
PAP. Condizione: New. New Book. Delivered from our UK warehouse in 4 to 14 business days. THIS BOOK IS PRINTED ON DEMAND. Established seller since 2000. Codice articolo L0-9781638283508
Quantità: Più di 20 disponibili
Foto dell'editore
Numerical Methods for Convex Multistage Stochastic Optimization
Da: GreatBookPrices, Columbia, MD, U.S.A.
Valutazione del venditore 5 su 5 stelle
Condizione: New. Codice articolo 47759531-n
Quantità: Più di 20 disponibili
Foto dell'editore
Numerical Methods for Convex Multistage Stochastic Optimization (Foundations and Trends(r) in Optimization)
Da: Ria Christie Collections, Uxbridge, Regno Unito
Valutazione del venditore 5 su 5 stelle
Condizione: New. In. Codice articolo ria9781638283508_new
Quantità: Più di 20 disponibili
Foto dell'editore
Numerical Methods for Convex Multistage Stochastic Optimization
Editore:
now publishers Inc, 2024
ISBN 10: 1638283508
ISBN 13: 9781638283508
Nuovo
Paperback / softback
Da: THE SAINT BOOKSTORE, Southport, Regno Unito
Valutazione del venditore 5 su 5 stelle
Paperback / softback. Condizione: New. This item is printed on demand. New copy - Usually dispatched within 5-9 working days 146. Codice articolo C9781638283508
Quantità: Più di 20 disponibili
Immagini fornite dal venditore
Numerical Methods for Convex Multistage Stochastic Optimization
Da: Rarewaves.com UK, London, Regno Unito
Valutazione del venditore 4 su 5 stelle
Paperback. Condizione: 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. Codice articolo LU-9781638283508
Quantità: Più di 20 disponibili
Foto dell'editore
Numerical Methods for Convex Multistage Stochastic Optimization
Da: GreatBookPricesUK, Woodford Green, Regno Unito
Valutazione del venditore 5 su 5 stelle
Condizione: New. Codice articolo 47759531-n
Quantità: Più di 20 disponibili
Immagini fornite dal venditore
Numerical Methods for Convex Multistage Stochastic Optimization
Da: Rarewaves.com USA, London, LONDO, Regno Unito
Valutazione del venditore 4 su 5 stelle
Paperback. Condizione: 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. Codice articolo LU-9781638283508
Quantità: Più di 20 disponibili