A Globally Convergent Line-Search Quasi-Newton Method for Discounted Markov Decision Processes
math.OC
Submitted: 2026-11-08
Updated: 2026-11-08
Code: https://github.com/wang-zhizhou/LSQN
Terminology
Sources
- Dynamic Programming Through the Lens of Semismooth Newton-Type Methods (Extended Version)
- Inexact Policy Iteration Methods for Large-Scale Markov Decision Processes
- From Convex Optimization to MDPs: A Review of First-Order, Second-Order and Quasi-Newton Methods for MDPs
- Gymnasium: A Standard Interface for Reinforcement Learning Environments
Related papers
- An Accelerated Proximal Gradient Method for Bures-Wasserstein Space
- FOMTools: Development and AI-Assisted Code Generation for First-Order Methods
- Lions and Muons: Optimization via Stochastic Frank-Wolfe under Heavy-Tailed Noise
- Dynamic Service Recommendation with Congestion-Dependent Joining: Near-Optimal and Constant-Factor Approximation Algorithms
- Integrating Learning and Optimization for Open Transport Capacity Pooling under Disruption
- Zeroth-Order Gradient Estimators under Decision-Dependent Noise