Solving the Pareto front for multiobjective Markov chains using the minimum Euclidean distance gradient-based optimization method

DOI10.1016/j.matcom.2015.08.004OpenAlexW1437181184MaRDI QIDQ2228731

Alexander S. Poznyak, Julio B. Clempner

Publication date: 19 February 2021

Published in: Mathematics and Computers in Simulation (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.matcom.2015.08.004

zbMATH Keywords

multi-objective optimizationMarkov chainsPareto frontEuclidean distancestrong Pareto policies

Mathematics Subject Classification ID

Numerical analysis (65-XX) Partial differential equations (35-XX)

Related Items (8)

Necessary and sufficient Karush-Kuhn-Tucker conditions for multiobjective Markov chains optimality ⋮ Constructing the Pareto front for multi-objective Markov chains handling a strong Pareto policy approach ⋮ On Lyapunov Game Theory Equilibrium: Static and Dynamic Approaches ⋮ A Tikhonov regularized penalty function approach for solving polylinear programming problems ⋮ Finding the strong Nash equilibrium: computation, existence and characterization for Markov games ⋮ Dr. Alexander Semionovich Poznyak Gorbatch: Biography ⋮ Computing multiobjective Markov chains handled by the extraproximal method ⋮ Using the Manhattan distance for computing the multiobjective Markov chains problem

Uses Software

• SPEA2

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Stochastic method for the solution of unconstrained vector optimization problems
• Fast computation of equispaced Pareto manifolds and Pareto fronts for multiobjective optimization problems
• Nonlinear multiobjective optimization
• Covering Pareto sets by multilevel subdivision techniques
• A method for generating a well-distributed Pareto set in nonlinear multiobjective optimization
• Equispaced Pareto front construction for constrained bi-objective optimization
• Multi-Objective Control-Structure Optimization via Homotopy Methods
• Normal-Boundary Intersection: A New Method for Generating the Pareto Surface in Nonlinear Multicriteria Optimization Problems

This page was built for publication: Solving the Pareto front for multiobjective Markov chains using the minimum Euclidean distance gradient-based optimization method