Learning Algorithms for Separable Approximations of Discrete Stochastic Optimization Problems
From MaRDI portal
Recommendations
- scientific article; zbMATH DE number 1985665
- Stochastic learning and optimization. A sensitivity-based approach.
- Stochastic algorithm for optimization and statistical learning
- A randomized stochastic approximation algorithm for self-learning
- Approximation algorithms for stochastic and risk-averse optimization
- scientific article; zbMATH DE number 6381764
- Approximative solutions of stochastic optimization problems
- A Method for Discrete Stochastic Optimization
- A Stochastic Approximation Framework for a Class of Randomized Optimization Algorithms
- Solving stochastic optimization models with learning and rational expectations
Cited in
(23)- Risk-averse approximate dynamic programming with quantile-based risk measures
- Shape constraints in economics and operations research
- An approximate dynamic programming algorithm for monotone value functions
- Gradient-Based Discrete-Time Concurrent Learning for Standalone Function Approximation
- On the convergence of stochastic dual dynamic programming and related methods
- A new separable piecewise linear learning algorithm for the stochastic empty container repositioning problem
- Online sequential optimization with biased gradients: theory and applications to censored demand
- A new convergent hybrid learning algorithm for two-stage stochastic programs
- Benchmarking a scalable approximate dynamic programming algorithm for stochastic control of grid-level energy storage
- Technical note: Nonparametric data-driven algorithms for multiproduct inventory systems with censored demand
- Technical note: Perishable inventory systems: convexity results for base-stock policies and learning algorithms under censored demand
- A reinforcement learning approach to distribution-free capacity allocation for sea cargo revenue management
- Confidence intervals for data-driven inventory policies with demand censoring
- Multi-commodity vehicle routing problem with pickup and delivery for electric micromobility devices rebalancing and battery swapping
- Optimal hour-ahead bidding in the real-time electricity market with battery storage using approximate dynamic programming
- Variational Bayesian analysis of survival data using a log-logistic accelerated failure time model
- Nonparametric learning algorithms for joint pricing and inventory control with lost sales and censored demand
- A parallelizable dynamic fleet management model with random travel times
- SMART: A stochastic multiscale model for the analysis of energy resources, technology, and policy
- Fully polynomial time (,)-approximation schemes for continuous nonlinear newsvendor and continuous stochastic dynamic programs
- Dynamic modeling and control of supply chain systems: A review
- The big data newsvendor: practical insights from machine learning
- A unified framework for stochastic optimization
This page was built for publication: Learning Algorithms for Separable Approximations of Discrete Stochastic Optimization Problems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5704200)
