Algebraic optimization of sequential decision problems

DOI10.1016/j.jsc.2023.102241arXiv2211.09439MaRDI QIDQ6051114

No author found.

Publication date: 19 September 2023

Published in: Journal of Symbolic Computation (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/2211.09439

zbMATH Keywords

polynomial optimizationalgebraic degreestate aggregationpartially observable Markov decision processstate-action frequencies

Mathematics Subject Classification ID

Markov and semi-Markov decision processes (90C40) Algebraic statistics (62R01) Polynomial optimization (90C23)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Optimality conditions and finite convergence of Lasserre's hierarchy
• HomotopyContinuation.jl: a package for homotopy continuation in Julia
• Geometry of policy improvement
• Certifying convergence of Lasserre's hierarchy via flat truncation
• On the implementation of an interior-point filter line-search algorithm for large-scale nonlinear programming
• Finite state Markovian decision processes
• Global Optimization with Polynomials and the Problem of Moments
• On the Computational Complexity of Stochastic Controller Optimization in POMDPs
• Julia: A Fresh Approach to Numerical Computing
• GloptiPoly 3: moments, optimization and semidefinite programming
• Survey of linear programming for standard and nonstandard Markovian control problems. Part I: Theory
• Detecting Global Optimality and Extracting Solutions in GloptiPoly
• Algebraic Degree of Polynomial Optimization
• Nonlinear Optimal Control via Occupation Measures and LMI-Relaxations
• Nonlinear Programming

This page was built for publication: Algebraic optimization of sequential decision problems