Online Sequential Optimization with Biased Gradients: Theory and Applications to Censored Demand
From MaRDI portal
Publication:2967620
DOI10.1287/ijoc.2013.0553zbMath1356.90106MaRDI QIDQ2967620
Paat Rusmevichientong, Woonghee Tim Huh
Publication date: 1 March 2017
Published in: INFORMS Journal on Computing (Search for Journal in Brave)
Full work available at URL: https://semanticscholar.org/paper/5e855a7bfb2e16ff157f6f680160e2548370eb26
online optimization; sequentially convex functions; biased gradients; inventory control with censored demand
Related Items
Cites Work
- A practical inventory control policy using operational statistics
- Dynamic Inventory Policy with Varying Stochastic Demands
- Adaptive Data-Driven Inventory Control with Censored Demand Based on Kaplan-Meier Estimator
- An Adaptive, Distribution-Free Algorithm for the Newsvendor Problem with Censored Demands, with Applications to Inventory and Distribution
- Revenue Management Without Forecasting or Optimization: An Adaptive Algorithm for Determining Airline Seat Protection Levels
- A Nonparametric Asymptotic Analysis of Inventory Planning with Censored Demand
- An Adaptive Algorithm for Finding the Optimal Base-Stock Policy in Lost Sales Inventory Systems with Censored Demand
- Bayes Solutions of the Statistical Inventory Problem
- Some remarks on bayes solutions to the inventory problem
- Regret in the Newsvendor Model with Partial Information
- Using Stochastic Approximation Methods to Compute Optimal Base-Stock Levels in Inventory Control Problems
- Technical Note—Minimax Procedure for a Class of Linear Programs under Uncertainty
- The Distribution Free Newsboy Problem: Review and Extensions
- Optimal and Approximate Control Policies for Airline Booking with Sequential Nonmonotonic Fare Classes
- Airline Seat Allocation with Multiple Nested Fare Classes
- Inventory Control in a Fluctuating Demand Environment
- Logarithmic Regret Algorithms for Online Convex Optimization
- An Adaptive Sampling Algorithm for Solving Markov Decision Processes
- Provably Near-Optimal Sampling-Based Policies for Stochastic Inventory Control Models
- Optimal Policy for a Multi-Product, Dynamic, Nonstationary Inventory Problem
- Learning Algorithms for Separable Approximations of Discrete Stochastic Optimization Problems
- Unnamed Item
- Unnamed Item
