Non-Stationary Stochastic Optimization

Omar Besbes
Omar Besbes
[email protected]
Columbia University, New York, New York 10027
Search for more papers by this author
,
Yonatan Gur
Yonatan Gur
[email protected]
Stanford University, Stanford, California 94305
Search for more papers by this author
,
Assaf Zeevi
Assaf Zeevi
[email protected]
Columbia University, New York, New York 10027
Search for more papers by this author

Omar Besbes

[email protected]

Columbia University, New York, New York 10027

Search for more papers by this author

Yonatan Gur

[email protected]

Stanford University, Stanford, California 94305

Search for more papers by this author

Assaf Zeevi

[email protected]

Columbia University, New York, New York 10027

Search for more papers by this author

Published Online:14 Sep 2015https://doi.org/10.1287/opre.2015.1408

Supplemental Material

opre.2015.1408-sm-online-companion.pdf (520 KB)

Cited by
- Risk-averse learning with non-stationary distributions
  Automatica, Vol. 190
- Value-oriented forecast reconciliation for renewables in electricity markets
  European Journal of Operational Research, Vol. 332, No. 2
- Bid Shading in First-Price Auction: Nonstationary Bayesian Multiarmed Bandit Methods for Real-Time Bidding
  Mengzhuo Guo,
  Wuqi Zhang,
  Yiwen Shen,
  Qingpeng Zhang
  1 June 2026 | Information Systems Research, Vol. 0, No. 0
- Revenue Maximization and Learning in Product Ranking
  Ningyuan Chen,
  Anran Li,
  Shuoguang Yang
  5 January 2026 | Operations Research, Vol. 74, No. 3
- Online Planning in Nonstationary Environments
  Wang Chi Cheung,
  Guodong Lyu
  22 September 2025 | Operations Research, Vol. 74, No. 3
- Online Best-Response Algorithm in Open Noncooperative Games
  IEEE Transactions on Automatic Control, Vol. 71, No. 5
- Short-Lived High-Volume Bandits
  Su Jia,
  Andrew Li,
  R. Ravi,
  Nishant Oli,
  Paul Duff,
  Ian Anderson
  21 April 2026 | Operations Research, Vol. 0, No. 0
- Augmenting subspace optimization methods with linear bandits
  14 April 2026 | Optimization Methods and Software, Vol. 3
- Tracking Solutions of Time-Varying Variational Inequalities
  Hedi Hadiji,
  Sarah Sachs,
  Cristóbal Guzmán
  26 March 2026 | Mathematics of Operations Research, Vol. 0, No. 0
- Learning to Price Supply Chain Contracts Against a Learning Retailer
  Xuejun Zhao,
  Ruihao Zhu,
  William B. Haskell
  21 July 2025 | Management Science, Vol. 72, No. 3
- Revenue Management With Nonparametric Demand Learning and Product Returns
  4 February 2026 | Production and Operations Management
- Adaptive Online Convex Optimization: A Survey of Algorithms, Theory, and Modern Applications
  10 February 2026 | Applied Sciences, Vol. 16, No. 4
- The Best Decisions Are Not the Best Advice: Making Adherence-Aware Recommendations
  Julien Grand-Clément,
  Jean Pauphilet
  10 June 2024 | Management Science, Vol. 72, No. 1
- Adaptive Learning in Uncertain and Sequential Competition
  Shukai Li,
  Sanjay Mehrotra
  4 November 2025 | Operations Research, Vol. 74, No. 1
- Dynamic Resource Sharing for Satellite Uplink via Online Convex Optimization
  IEEE Transactions on Networking, Vol. 34
- Decentralized Online Learning With Hard Constraints: A Doubly-Bounded Queue Approach
  IEEE Transactions on Networking, Vol. 34
- A Distributed Online Learning Method Over Time-Varying Unbalanced Directed Graphs via Improved Regret Analysis
  IEEE Transactions on Signal and Information Processing over Networks, Vol. 12
- Dynamic Regret for Byzantine-Robust Online Federated Learning
  IEEE Transactions on Signal Processing, Vol. 74
- Tailored Base-Surge Policies in Dual-Sourcing Inventory Systems with Demand Learning
  1 January 2026 | SSRN Electronic Journal, Vol. 70
- A continuous training approach for risk informed supplier selection and order allocation
  27 December 2024 | Production & Manufacturing Research, Vol. 13, No. 1
- Approximately Stationary Bandits with Knapsacks
  Giannis Fikioris,
  Éva Tardos
  18 December 2025 | Mathematics of Operations Research, Vol. 0, No. 0
- Distributed Online Algorithms for Economic Power Dispatch
- Competitive Pricing Using Model-Based Bandits
  4 February 2025 | Computational Economics, Vol. 66, No. 6
- Technical Note: Maximum Likelihood Optimization via Parallel Estimating Gradient Ascent
  27 January 2025 | Computational Economics, Vol. 66, No. 6
- Online distributed optimization with clipped stochastic gradients: High probability bound of regrets
  Automatica, Vol. 182
- Delayed feedback in online non-convex optimization: A non-stationary approach with applications
  29 November 2025 | Numerical Algorithms, Vol. 63
- Online Stochastic Optimization with Wasserstein-Based Nonstationarity
  Jiashuo Jiang,
  Xiaocheng Li,
  Jiawei Zhang
  3 March 2025 | Management Science, Vol. 71, No. 11
- A Stability Principle for Learning Under Nonstationarity
  Chengpiao Huang,
  Kaizheng Wang
  10 June 2025 | Operations Research, Vol. 73, No. 6
- Distributed mirror descent for online bandit saddle point problem
  Automatica, Vol. 181
- Network Revenue Management with Nonparametric Demand Learning: T-Regret and Polynomial Dimension Dependency
  Sentao Miao,
  Yining Wang
  10 October 2025 | Mathematics of Operations Research, Vol. 0, No. 0
- Tracking Nonstationary Streaming Data via Exponentially Weighted Moving Average Stochastic Gradient Descent
  20 June 2024 | Journal of Systems Science and Complexity, Vol. 38, No. 5
- Distributed online stochastic gradient tracking
  Journal of the Franklin Institute, Vol. 362, No. 14
- Continual Learning as Computationally Constrained Reinforcement Learning
  26 August 2025 | Foundations and Trends® in Machine Learning, Vol. 18, No. 5
- Bridging Adversarial and Nonstationary Multi-Armed Bandit
  21 February 2025 | Production and Operations Management, Vol. 34, No. 8
- A Minibatch Stochastic Gradient Descent-Based Learning Metapolicy for Inventory Systems with Myopic Optimal Policy
  Jiameng Lyu,
  Jinxing Xie,
  Shilin Yuan,
  Yuan Zhou
  9 October 2024 | Management Science, Vol. 71, No. 7
- Tailored Base-Surge Policies in Dual-Sourcing Inventory Systems with Demand Learning
  Boxiao Chen,
  Cong Shi
  20 December 2024 | Operations Research, Vol. 73, No. 4
- An Integrated Framework for Internal Replenishment Processes of Warehouses Using Approximate Dynamic Programming
  10 July 2025 | Applied Sciences, Vol. 15, No. 14
- Online Allocation of Reusable Resources in Nonstationary Environments
  Xilin Zhang,
  Wang Chi Cheung
  27 June 2025 | Mathematics of Operations Research, Vol. 0, No. 0
- CB-RML: Dynamic Regret Minimization via Coin-Betting Regularization and Meta-Learning
- Q-DADAM: A Quantized Distributed Online Optimization Algorithm With Adaptive Momentum
  IEEE Transactions on Control of Network Systems, Vol. 12, No. 2
- The Nonstationary Newsvendor with (and Without) Predictions
  Lin An,
  Andrew A. Li,
  Benjamin Moseley,
  R. Ravi
  4 March 2025 | Manufacturing & Service Operations Management, Vol. 27, No. 3
- Adaptive, Doubly Optimal No-Regret Learning in Strongly Monotone and Exp-Concave Games with Gradient Feedback
  Michael Jordan; ,
  Tianyi Lin; ,
  Zhengyuan Zhou
  23 May 2024 | Operations Research, Vol. 73, No. 3
- Improved Bounds For Online Convex Optimization
- Online Learning With Non-convex Losses: New Condition To Achieve Small Dynamic Regret
- Stochastic approach for price optimization problems with decision-dependent uncertainty
  European Journal of Operational Research, Vol. 322, No. 2
- Smoothed Online Decision Making in Communication: Algorithms and Applications
  IEEE Transactions on Networking, Vol. 33, No. 2
- Technical Note—Improved Sample-Complexity Bounds in Stochastic Optimization
  Alok Baveja; ,
  Amit Chavan; ,
  Andrei Nikiforov; ,
  Aravind Srinivasan; ,
  Pan Xu
  17 October 2023 | Operations Research, Vol. 73, No. 2
- Technical Note—On Adaptivity in Nonstationary Stochastic Optimization with Bandit Feedback
  Yining Wang
  31 July 2023 | Operations Research, Vol. 73, No. 2
- Learning and Optimization with Seasonal Patterns
  Ningyuan Chen; ,
  Chun Wang; ,
  Longlin Wang
  4 October 2023 | Operations Research, Vol. 73, No. 2
- Dynamic regret for decentralized online bandit gradient descent with local steps
  Journal of the Franklin Institute, Vol. 362, No. 4
- Combinatorial-restless-bandit-based transmitter–receiver online selection of distributed MIMO radar with non-stationary channels
  Signal Processing, Vol. 227
- Technical Note—Online Matching with Bayesian Rewards
  David Simchi-Levi; ,
  Rui Sun; ,
  Xinshang Wang
  28 July 2023 | Operations Research, Vol. 73, No. 1
- Dynamic Regret for Online Proximal Newton’s Method
  5 June 2025
- Implicit Online Saddle Point Optimization
  9 April 2025
- ROPU: A robust online positive-unlabeled learning algorithm
  Knowledge-Based Systems, Vol. 309
- Distributed Online Optimization Based on One-Step Gradient Descent and Multi-Step Consensus
- Online distributed nonconvex optimization with stochastic objective functions: High probability bound analysis of dynamic regrets
  Automatica, Vol. 170
- Optimality and duality for nonconvex fuzzy optimization using granular differentiability method
  Information Sciences, Vol. 684
- Improved dynamic regret of distributed online multiple Frank-Wolfe convex optimization
  9 October 2024 | Science China Information Sciences, Vol. 67, No. 11
- Distributed constrained online convex optimization with adaptive quantization
  Automatica, Vol. 169
- Distributed online constrained convex optimization with event-triggered communication
  European Journal of Control, Vol. 80
- Nonparametric multi-product dynamic pricing with demand learning via simultaneous price perturbation
  European Journal of Operational Research, Vol. 319, No. 1
- Dynamic Pricing with External Information and Inventory Constraint
  Xiaocheng Li,
  Zeyu Zheng
  19 October 2023 | Management Science, Vol. 70, No. 9
- Nonlinear optimization filters for stochastic time‐varying convex optimization
  25 April 2024 | International Journal of Robust and Nonlinear Control, Vol. 34, No. 12
- Does Online Gradient Descent (and Variants) Still Work with Biased Gradient and Variance?
- Online composite optimization with time-varying regularizers
  Journal of the Franklin Institute, Vol. 361, No. 10
- First Order Online Optimisation Using Forward Gradients in Over-Parameterised Systems
- Concept drift adaptation with continuous kernel learning
  Information Sciences, Vol. 670
- Universal Online Convex Optimization With Minimax Optimal Second-Order Dynamic Regret
  IEEE Transactions on Automatic Control, Vol. 69, No. 6
- Online Learning and Pricing for Service Systems with Reusable Resources
  Huiwen Jia,
  Cong Shi,
  Siqian Shen
  10 November 2022 | Operations Research, Vol. 72, No. 3
- On the Hardness of Learning from Censored and Nonstationary Demand
  Gábor Lugosi,
  Mihalis G. Markakis,
  Gergely Neu
  28 September 2023 | INFORMS Journal on Optimization, Vol. 6, No. 2
- Dynamic Regret of Distributed Online Saddle Point Problem
  IEEE Transactions on Automatic Control, Vol. 69, No. 4
- Dynamic regret of adaptive gradient methods for strongly convex problems
  23 August 2022 | Optimization, Vol. 73, No. 3
- Online Learning for Dual-Index Policies in Dual-Sourcing Systems
  Jingwen Tang,
  Boxiao Chen,
  Cong Shi
  12 December 2023 | Manufacturing & Service Operations Management, Vol. 26, No. 2
- Online Distributed Stochastic Gradient Algorithm for Nonconvex Optimization With Compressed Communication
  IEEE Transactions on Automatic Control, Vol. 69, No. 2
- Nearly Dimension-Independent Sparse Linear Bandit over Small Action Spaces via Best Subset Selection
  27 September 2022 | Journal of the American Statistical Association, Vol. 119, No. 545
- Optimization algorithms as robust feedback controllers
  Annual Reviews in Control, Vol. 57
- Nonstationary online convex optimization with multiple predictions
  Information Sciences, Vol. 654
- Causal Inference From Slowly Varying Nonstationary Processes
  IEEE Transactions on Signal and Information Processing over Networks, Vol. 10
- Online Optimization Under Randomly Corrupted Attacks
  IEEE Transactions on Signal Processing, Vol. 72
- Competitive Insurance Pricing Using Model-Based Bandits
  1 January 2024 | SSRN Electronic Journal, Vol. 8
- An Online Mirror Descent Learning Algorithm for Multiproduct Inventory Systems
  1 January 2024 | SSRN Electronic Journal, Vol. 70
- Efficient Online Learning with Memory via Frank-Wolfe Optimization: Algorithms with Bounded Dynamic Regret and Applications to Control
- Online decision making for trading wind energy
  28 June 2023 | Computational Management Science, Vol. 20, No. 1
- Near Optimal Memory-Regret Tradeoff for Online Learning
- Online convex optimization with switching cost and delayed gradients
  Performance Evaluation, Vol. 162
- Online Distributed Optimization With Nonconvex Objective Functions via Dynamic Regrets
  IEEE Transactions on Automatic Control, Vol. 68, No. 11
- Data-Driven Distributionally Robust Optimization over Time
  Kevin-Martin Aigner,
  Andreas Bärmann,
  Kristin Braun,
  Frauke Liers,
  Sebastian Pokutta,
  Oskar Schneider,
  Kartikey Sharma,
  Sebastian Tschuppik
  26 May 2023 | INFORMS Journal on Optimization, Vol. 5, No. 4
- Decentralized online convex optimization with compressed communications
  Automatica, Vol. 156
- Online Convex Optimization for Dynamic RAN Slicing with Quality of Service
- Robust Dynamic Pricing with Demand Learning in the Presence of Outlier Customers
  Xi Chen,
  Yining Wang
  14 April 2022 | Operations Research, Vol. 71, No. 4
- Contextual Search in the Presence of Adversarial Corruptions
  Akshay Krishnamurthy,
  Thodoris Lykouris,
  Chara Podimata,
  Robert Schapire
  4 November 2022 | Operations Research, Vol. 71, No. 4
- Learning Product Rankings Robust to Fake Users
  Negin Golrezaei,
  Vahideh Manshadi,
  Jon Schneider,
  Shreyas Sekar
  13 October 2022 | Operations Research, Vol. 71, No. 4
- Improved Simultaneous Perturbation Stochastic Approximation-based Consensus Algorithm for Tracking*
- Optimization Filters for Stochastic Time-Varying Convex Optimization
- A relaxation-based probabilistic approach for PDE-constrained optimization under uncertainty with pointwise state constraints
  27 February 2023 | Computational Optimization and Applications, Vol. 85, No. 2
- Dynamic Regret Bounds for Constrained Online Nonconvex Optimization Based on Polyak–Lojasiewicz Regions
  IEEE Transactions on Control of Network Systems, Vol. 10, No. 2
- Multiagent Online Learning in Time-Varying Games
  Benoit Duvocelle,
  Panayotis Mertikopoulos,
  Mathias Staudigl,
  Dries Vermeulen
  1 July 2022 | Mathematics of Operations Research, Vol. 48, No. 2
- Stochastic Optimization with Decision-Dependent Distributions
  Dmitriy Drusvyatskiy,
  Lin Xiao
  10 August 2022 | Mathematics of Operations Research, Vol. 48, No. 2
- Adaptive Composite Online Optimization: Predictions in Static and Dynamic Environments
  IEEE Transactions on Automatic Control, Vol. 68, No. 5
- The optimal dynamic regret for smoothed online convex optimization with squared l2 norm switching costs
  Journal of the Franklin Institute, Vol. 360, No. 6
- Delay-Tolerant OCO With Long-Term Constraints: Algorithm and Its Application to Network Resource Allocation
  IEEE/ACM Transactions on Networking, Vol. 31, No. 1
- The Best of Many Worlds: Dual Mirror Descent for Online Allocation Problems
  Santiago R. Balseiro,
  Haihao Lu,
  Vahab Mirrokni
  23 May 2022 | Operations Research, Vol. 71, No. 1
- Quantized Distributed Online Projection-Free Convex Optimization
  IEEE Control Systems Letters, Vol. 7
- Sparse Online Learning With Kernels Using Random Features for Estimating Nonlinear Dynamic Graphs
  IEEE Transactions on Signal Processing, Vol. 71
- Non-stationary Experimental Design under Structured Trends
  1 January 2023 | SSRN Electronic Journal, Vol. 113
- Learning to Price Under Competition for Multinomial Logit Demand
  1 January 2023 | SSRN Electronic Journal, Vol. 59
- Buyout Price Optimization in the Rent-to-Own Business
  1 January 2023 | SSRN Electronic Journal, Vol. 54
- Dynamic Learning Policy for Multi-Warehouse Multi-Store Systems with Censored Demands
  1 January 2023 | SSRN Electronic Journal, Vol. 67
- A (mathematical) definition of algorithmic collusion
  1 January 2023 | SSRN Electronic Journal, Vol. 62
- Online Stochastic Gradient Methods Under Sub-Weibull Noise and the Polyak-Łojasiewicz Condition
- Proximal Online Gradient Is Optimum for Dynamic Regret: A General Lower Bound
  IEEE Transactions on Neural Networks and Learning Systems, Vol. 33, No. 12
- Universal Caching
- Distributed Online Non-convex Optimization with Composite Regret
- On Dynamic Regret and Constraint Violations in Constrained Online Convex Optimization
- Context‐based dynamic pricing with online clustering
  1 September 2022 | Production and Operations Management, Vol. 31, No. 9
- Dynamic Regret Bounds without Lipschitz Continuity: Online Convex Optimization with Multiple Mirror Descent Steps
- Optimal Dynamic Regret for Online Convex Optimization with Squared l 2 Norm Switching Cost
- Accelerated Simultaneous Perturbation Stochastic Approximation for Tracking Under Unknown-but-Bounded Disturbances
- Decentralized Online Convex Optimization With Feedback Delays
  IEEE Transactions on Automatic Control, Vol. 67, No. 6
- Tracking and Regret Bounds for Online Zeroth-Order Euclidean and Riemannian Optimization
  21 April 2022 | SIAM Journal on Optimization, Vol. 32, No. 2
- Semi-Online Precoding with Information Parsing for Cooperative MIMO Wireless Networks
- Learning in Structured MDPs with Convex Cost Functions: Improved Regret Bounds for Inventory Management
  Shipra Agrawal,
  Randy Jia
  25 March 2022 | Operations Research, Vol. 70, No. 3
- An Asynchronous Online Negotiation Mechanism for Real-Time Peer-to-Peer Electricity Markets
  IEEE Transactions on Power Systems, Vol. 37, No. 3
- Hedging the Drift: Learning to Optimize Under Nonstationarity
  Wang Chi Cheung,
  David Simchi-Levi,
  Ruihao Zhu
  12 November 2021 | Management Science, Vol. 68, No. 3
- Data-Driven Pricing for a New Product
  Mengzhenyu Zhang,
  Hyun-Soo Ahn,
  Joline Uichanco
  19 January 2022 | Operations Research, Vol. 70, No. 2
- Dynamic Regret of Online Mirror Descent for Relatively Smooth Convex Cost Functions
  IEEE Control Systems Letters, Vol. 6
- Periodic Updates for Constrained OCO with Application to Large-Scale Multi-Antenna Systems
  IEEE Transactions on Mobile Computing, Vol. 13
- Finite-Time Error Bounds of Biased Stochastic Approximation With Application to TD-Learning
  IEEE Transactions on Signal Processing, Vol. 70
- Distributed Constrained Online Convex Optimization Over Multiple Access Fading Channels
  IEEE Transactions on Signal Processing, Vol. 70
- DAdam: A Consensus-Based Distributed Adaptive Gradient Method for Online Optimization
  IEEE Transactions on Signal Processing, Vol. 70
- Adaptive, Doubly Optimal No-Regret Learning in Games with Gradient Feedback
  SSRN Electronic Journal, Vol. 408
- Dynamic Pricing With Infrequent Inventory Replenishments
  SSRN Electronic Journal, Vol. 24
- Regret Minimization with Dynamic Benchmarks in Repeated Games
  SSRN Electronic Journal, Vol. 112
- Online Learning Over Dynamic Graphs via Distributed Proximal Gradient Algorithm
  IEEE Transactions on Automatic Control, Vol. 66, No. 11
- On Distributed Online Convex Optimization with Sublinear Dynamic Regret and Fit
- Learning and Information in Stochastic Networks and Queues
  Neil Walton,
  Kuang Xu
  18 October 2021
- Online Optimization With Predictions and Switching Costs: Fast Algorithms and the Fundamental Limit
  IEEE Transactions on Automatic Control, Vol. 66, No. 10
- Second-Order Online Nonconvex Optimization
  IEEE Transactions on Automatic Control, Vol. 66, No. 10
- Adaptive online distributed optimization in dynamic environments
  12 August 2019 | Optimization Methods and Software, Vol. 36, No. 5
- Online Optimization for Real-Time Peer-to-Peer Electricity Market Mechanisms
  IEEE Transactions on Smart Grid, Vol. 12, No. 5
- Decentralized online convex optimization based on signs of relative states
  Automatica, Vol. 129
- An online convex optimization algorithm for controlling linear systems with state and input constraints
- Diminishing Regret for Online Nonconvex Optimization
- Dynamically Choosing the Candidate Algorithm with Ostasos in Online Optimization
- Delay-Tolerant Constrained OCO with Application to Network Resource Allocation
- Bounds for the Tracking Error of First-Order Online Optimization Methods
  16 March 2021 | Journal of Optimization Theory and Applications, Vol. 189, No. 2
- Data‐Driven Inventory Control with Shifting Demand
  1 May 2021 | Production and Operations Management, Vol. 30, No. 5
- Online Learning Algorithms
  Annual Review of Statistics and Its Application, Vol. 8, No. 1
- Decentralized Online Convex Optimization With Event-Triggered Communications
  IEEE Transactions on Signal Processing, Vol. 69
- Dynamic Online Learning via Frank-Wolfe Algorithm
  IEEE Transactions on Signal Processing, Vol. 69
- A Simplex Method for Countably Infinite Linear Programs
  13 December 2021 | SIAM Journal on Optimization, Vol. 31, No. 4
- The Nonstationary Newsvendor: Data-Driven Nonparametric Learning
  SSRN Electronic Journal, Vol. 70
- Dynamic Pricing with Fairness Constraints
  SSRN Electronic Journal, Vol. 29
- Network Revenue Management with Nonparametric Demand Learning: \sqrt{T}-regret and Polynomial Dimension Dependency
  SSRN Electronic Journal, Vol. 23
- Reinforcement with Fading Memories
  Kuang Xu,
  Se-Young Yun
  18 June 2020 | Mathematics of Operations Research, Vol. 45, No. 4
- Time-Varying Convex Optimization: Time-Structured Algorithms and Applications
  Proceedings of the IEEE, Vol. 108, No. 11
- Stochastic approximation with nondecaying gain: Error bound and data‐driven gain‐tuning
  25 September 2020 | International Journal of Robust and Nonlinear Control, Vol. 30, No. 15
- Nonstationary Bandits with Habituation and Recovery Dynamics
  Yonatan Mintz,
  Anil Aswani,
  Philip Kaminsky,
  Elena Flowers,
  Yoshimi Fukuoka
  9 July 2020 | Operations Research, Vol. 68, No. 5
- An Online Mechanism for Resource Allocation in Networks
  IEEE Transactions on Control of Network Systems, Vol. 7, No. 3
- Technical note: Finite‐time regret analysis of Kiefer‐Wolfowitz stochastic approximation algorithm and nonparametric multi‐product dynamic pricing with unknown demand
  24 April 2020 | Naval Research Logistics (NRL), Vol. 67, No. 5
- Online Distributed Constrained Optimization Over General Unbalanced Digraphs
- Trading Dynamic Regret for Model Complexity in Nonstationary Nonparametric Optimization
- Projection Free Dynamic Online Learning
- Optimization and Learning With Information Streams: Time-varying algorithms and applications
  IEEE Signal Processing Magazine, Vol. 37, No. 3
- Distributed Mirror-Prox Optimization for Multi-Access Edge Computing
  IEEE Transactions on Communications, Vol. 68, No. 5
- Handling concept drift via model reuse
  10 October 2019 | Machine Learning, Vol. 109, No. 3
- Online Gradient Descent for Linear Dynamical Systems
  IFAC-PapersOnLine, Vol. 53, No. 2
- Online Optimization Using Zeroth Order Oracles
  IEEE Control Systems Letters, Vol. 4, No. 1
- Online Distributed Optimization With Strongly Pseudoconvex-Sum Cost Functions
  IEEE Transactions on Automatic Control, Vol. 65, No. 1
- An Online Learning Algorithm for Distributed Task Offloading in Multi-Access Edge Computing
  IEEE Transactions on Signal Processing, Vol. 68
- Online Trajectory Optimization Using Inexact Gradient Feedback for Time-Varying Environments
  IEEE Transactions on Signal Processing, Vol. 68
- Robust Dynamic Pricing with Demand Learning in the Presence of Outlier Customers
  SSRN Electronic Journal, Vol. 57
- Learning Product Rankings Robust to Fake Users
  SSRN Electronic Journal, Vol. 10
- Self-adapting Robustness in Demand Learning
  SSRN Electronic Journal, Vol. 63
- Online Learning and Pricing for Service Systems with Reusable Resources
  SSRN Electronic Journal, Vol. 2
- Optimal Exploration–Exploitation in a Multi-armed Bandit Problem with Non-stationary Rewards
  Omar Besbes,
  Yonatan Gur,
  Assaf Zeevi
  31 October 2019 | Stochastic Systems, Vol. 9, No. 4
- Distributed Online Learning over Time-varying Graphs via Proximal Gradient Descent
- Prediction in Online Convex Optimization for Parametrizable Objective Functions
- Technical Note—Nonstationary Stochastic Optimization Under Lp,q-Variation Measures
  Xi Chen,
  Yining Wang,
  Yu-Xiang Wang
  23 September 2019 | Operations Research, Vol. 67, No. 6
- Impact of Delays on Constrained Online Convex Optimization
- Learning in Repeated Auctions with Budgets: Regret Minimization and Equilibrium
  Santiago R. Balseiro,
  Yonatan Gur
  1 August 2019 | Management Science, Vol. 65, No. 9
- Bus transit network design with uncertainties on the basis of a metro network: A two-step model framework
  Transportation Research Part B: Methodological, Vol. 126
- Online Convex Optimization With Time-Varying Constraints and Bandit Feedback
  IEEE Transactions on Automatic Control, Vol. 64, No. 7
- Online Utility-Optimal Trajectory Design for Time-Varying Ocean Environments
- Online Primal-Dual Methods With Measurement Feedback for Time-Varying Convex Optimization
  IEEE Transactions on Signal Processing, Vol. 67, No. 8
- Learning in Wireless Control Systems Over Nonstationary Channels
  IEEE Transactions on Signal Processing, Vol. 67, No. 5
- Online Learning With Inexact Proximal Online Gradient Descent Algorithms
  IEEE Transactions on Signal Processing, Vol. 67, No. 5
- Bandit Convex Optimization for Scalable and Dynamic IoT Management
  IEEE Internet of Things Journal, Vol. 6, No. 1
- Online Learning
  15 August 2019
- Linear Programming Based Near-Optimal Pricing for Laminar Bayesian Online Selection
  SSRN Electronic Journal, Vol. 62
- Dynamic Pricing with External Information and Inventory Constraint
  SSRN Electronic Journal, Vol. 57
- Data-Driven Inventory Control in a Changing Environment
  SSRN Electronic Journal, Vol. 21
- Probabilistic Bounds in Tracking a Discrete-Time Varying Process
- Heterogeneous Online Learning for “Thing-Adaptive” Fog Computing in IoT
  IEEE Internet of Things Journal, Vol. 5, No. 6
- Technical Note—Perishable Inventory Systems: Convexity Results for Base-Stock Policies and Learning Algorithms Under Censored Demand
  Huanan Zhang,
  Xiuli Chao,
  Cong Shi
  27 July 2018 | Operations Research, Vol. 66, No. 5
- Time Varying optimization via Inexact Proximal Online Gradient Descent
- Dynamic Ensemble Active Learning: A Non-Stationary Bandit with Expert Advice
- A Virtual-Queue-Based Algorithm for Constrained Online Convex Optimization With Applications to Data Center Resource Allocation
  IEEE Journal of Selected Topics in Signal Processing, Vol. 12, No. 4
- Online Learning Adaptive to Dynamic and Adversarial Environments
- Using Predictions in Online Optimization with Switching Costs: A Fast Algorithm and A Fundamental Limit
- On the Time-Varying Constraints and Bandit Feedback of Online Convex Optimization
- A Novel Online Convex Optimization Algorithm Based on Virtual Queues
- Adversarial Multi-Agent Target Tracking with Inexact Online Gradient Descent
- Distributed Online Optimization in Dynamic Environments Using Mirror Descent
  IEEE Transactions on Automatic Control, Vol. 63, No. 3
- Tracking Moving Agents via Inexact Online Gradient Descent Algorithm
  IEEE Journal of Selected Topics in Signal Processing, Vol. 12, No. 1
- Learning to Optimize Under Non-Stationarity
  SSRN Electronic Journal, Vol. 32
- An Online Convex Optimization Approach to Proactive Network Resource Allocation
  IEEE Transactions on Signal Processing, Vol. 65, No. 24
- Online learning for “thing-adaptive” Fog Computing in IoT
- Distributed Learning for Stochastic Generalized Nash Equilibrium Problems
  IEEE Transactions on Signal Processing, Vol. 65, No. 15
- Online convex optimization for dynamic network resource allocation
- Chasing Demand: Learning and Earning in a Changing Environment
  N. Bora Keskin,
  Assaf Zeevi
  11 November 2016 | Mathematics of Operations Research, Vol. 42, No. 2
- Persistent surveillance of events with unknown, time-varying statistics
- An online optimization approach for multi-agent tracking of dynamic parameters in the presence of adversarial noise
- Learning in Repeated Auctions with Budgets: Regret Minimization and Equilibrium
  SSRN Electronic Journal, Vol. 35
- Non-Stationary Stochastic Optimization with Local Spatial and Temporal Changes
  SSRN Electronic Journal, Vol. 58
- Tracking capability of stochastic gradient algorithm with constant gain
- Online optimization in dynamic environments: Improved regret rates for strongly convex problems
- Reinforcement with Fading Memories
  SSRN Electronic Journal, Vol. 197
- Optimal Exploration-Exploitation in a Multi-Armed-Bandit Problem with Non-Stationary Rewards
  SSRN Electronic Journal, Vol. 47
- Near-Optimal Bisection Search for Nonparametric Dynamic Pricing with Inventory Constraint
  SSRN Electronic Journal, Vol. 33
- Non-Stationary Stochastic Optimization
  SSRN Electronic Journal, Vol. 23

Volume 63, Issue 5

September-October 2015

Pages ii-iv, 979-1244

Article Information

Supplemental Material

Metrics

Information

Published Online:September 14, 2015

Cite as

Omar Besbes, Yonatan Gur, Assaf Zeevi (2015) Non-Stationary Stochastic Optimization. Operations Research 63(5):1227-1244.

https://doi.org/10.1287/opre.2015.1408

Keywords

PDF download

Available Issues

Available Issues

Available Issues

Available Issues

Available Issues

Available Issues

Available Issues

Available Issues

Available Issues

Non-Stationary Stochastic Optimization

Supplemental Material

Volume 63, Issue 5

Article Information

Supplemental Material

Metrics

Information

Cite as

Keywords

Sign Up for INFORMS Publications Updates and News