Copertina

Linear programming for finite-horizon vector-valued Markov decision processes

Fuente: arXiv

Salvato in:

Dettagli Bibliografici
Autori principali:	Mifrani, Anas, Noll, Dominikus
Natura:	Preprint
Pubblicazione:	2025
Soggetti:	Optimization and Control 90C40, 90C29, 90C05
Accesso online:	Acceder al recurso
Tags:	Aggiungi Tag Nessun Tag, puoi essere il primo ad aggiungerne!!

Documenti analoghi

Multiple objective linear programming over the probability simplex
di: Mifrani, Anas
Pubblicazione: (2024)

Efficient points in a sum of sets of alternatives
di: Mifrani, Anas
Pubblicazione: (2024)

On a conjecture with implications for multicriteria decision making
di: Mifrani, Anas
Pubblicazione: (2025)

Low-Rank Multi-Objective Linear Programming
di: Löhne, Andreas, et al.
Pubblicazione: (2025)

Existence of solutions for polyhedral convex set optimization problems
di: Löhne, Andreas
Pubblicazione: (2023)

A solution method for arbitrary polyhedral convex set optimization problems
di: Löhne, Andreas
Pubblicazione: (2023)

Some optimality conditions of set-valued optimization problems in locally convex topological vector spaces
di: Zeng, Renying
Pubblicazione: (2024)

A three-term Polak-Ribière-Polyak conjugate gradient method for vector optimization
di: Lin, Guangxuan, et al.
Pubblicazione: (2025)

Equivalence between polyhedral projection, multiple objective linear programming and vector linear programming
di: Löhne, Andreas, et al.
Pubblicazione: (2015)

The vector linear program solver Bensolve -- notes on theoretical background
di: Löhne, Andreas, et al.
Pubblicazione: (2015)

Scaled Proximal Gradient Methods for Multiobjective Optimization: Improved Linear Convergence and Nesterov's Acceleration
di: Chen, Jian, et al.
Pubblicazione: (2024)

On the Relationship Between the Value Function and the Efficient Frontier of a Mixed Integer Linear Optimization Problem
di: Fallah, Samira, et al.
Pubblicazione: (2023)

A study of column generation embedded in scalarization methods for the bi-objective cutting stock problem
di: Borges, Jennifer C., et al.
Pubblicazione: (2026)

Minimizing transients via the Kreiss system norm
di: Apkarian, Pierre, et al.
Pubblicazione: (2023)

Warm-starting outer approximation for parametrized convex MINLP
di: Tamm, Erik, et al.
Pubblicazione: (2025)

Biobjective optimization with M-convex functions
di: Fukuda, Ellen H., et al.
Pubblicazione: (2025)

Generalized Reduced Jacobian Method
di: Maghri, M. El, et al.
Pubblicazione: (2025)

Characterization of Highly Robust Solutions in Multi-Objective Programming in Banach Spaces
di: Rahimi, Morteza, et al.
Pubblicazione: (2025)

Worst-case complexity analysis of derivative-free methods for multi-objective optimization
di: Liuzzi, Giampaolo, et al.
Pubblicazione: (2025)

Effective Front-Descent Algorithms with Convergence Guarantees
di: Lapucci, Matteo, et al.
Pubblicazione: (2024)

Cardinality-Constrained Multi-Objective Optimization: Novel Optimality Conditions and Algorithms
di: Lapucci, Matteo, et al.
Pubblicazione: (2023)

Projected Gradient Methods with Momentum
di: Lapucci, Matteo, et al.
Pubblicazione: (2026)

Stochastic block coordinate and function alternation for multi-objective optimization and learning
di: Tran, Trang H., et al.
Pubblicazione: (2026)

Objective-Function Free Multi-Objective Optimization: Rate of Convergence and Performance of an Adagrad-like algorithm
di: De Santis, Marianna, et al.
Pubblicazione: (2026)

A Refined Proximal Algorithm for Nonconvex Multiobjective Optimization in Hilbert Spaces
di: Bento, G. C., et al.
Pubblicazione: (2024)

Lagrange Multipliers, Duality, and Sensitivity in Set-Valued Convex Programming via Pointed Closed Convex Processes
di: García-Castaño, Fernando, et al.
Pubblicazione: (2024)

A Set-Valued Lagrange Theorem based on a Process for Convex Vector Programming
di: García-Castaño, Fernando, et al.
Pubblicazione: (2024)

Optimal Rates of Convergence for Entropy Regularization in Discounted Markov Decision Processes
di: Müller, Johannes, et al.
Pubblicazione: (2024)

A Benson-Type Algorithm for Bounded Convex Vector Optimization Problems with Vertex Selection
di: Dörfler, Daniel, et al.
Pubblicazione: (2020)

Stochastic dynamic programming under recursive Epstein-Zin preferences
di: Jaśkiewicz, Anna, et al.
Pubblicazione: (2024)

Multi-objective stochastic linear programming with recourse and flexible decision making
di: Hamel, Andreas H., et al.
Pubblicazione: (2024)

A Fisher-Rao gradient flow for entropy-regularised Markov decision processes in Polish spaces
di: Kerimkulov, Bekzhan, et al.
Pubblicazione: (2023)

A Nonmonotone Front Descent Method for Bound-Constrained Multi-Objective Optimization
di: Mansueto, Pierluigi
Pubblicazione: (2025)

A Subspace Minimization Barzilai-Borwein Method for Multiobjective Optimization Problems
di: Chen, Jian, et al.
Pubblicazione: (2024)

New merit functions for multiobjective optimization and their properties
di: Tanabe, Hiroki, et al.
Pubblicazione: (2020)

First-order Methods for Unconstrained Vector Optimization Problems: A Unified Majorization-Minimization Perspective
di: Chen, Jian, et al.
Pubblicazione: (2024)

Bi-Objective Optimization over the Efficient Set of Multi-Objective Integer Quadratic Problem
di: Bencheikh, Ali, et al.
Pubblicazione: (2024)

Linear Convergence and Error Bounds for Optimization Without Strong Convexity
di: van Treek, Kira, et al.
Pubblicazione: (2025)

Exact Solution Procedure for the Log-Linear Continuous Knapsack Problem
di: Lahiri, Somdeb
Pubblicazione: (2024)

On the facet pivot simplex method for linear programming
di: Yang, Yaguang
Pubblicazione: (2021)