Inexact multi-objective local search proximal algorithms: application to group dynamic and distributive justice problems

DOI10.1007/s10957-018-1258-9zbMath1419.90104OpenAlexW2790759438MaRDI QIDQ1637356

Antoine Soubeyran, Valdinês Leite de Sousa Júnior, Glaydston~de Carvalho Bento, Orizon P. Ferreira

Publication date: 8 June 2018

Published in: Journal of Optimization Theory and Applications (Search for Journal in Brave)

Full work available at URL: https://hal-amu.archives-ouvertes.fr/hal-01985329/file/Bento%20et%20al%20Valdines%20Distributive%20justice.pdf

zbMATH Keywords

multi-objectiveinexact proximaldistributive justicevariational rationalitybehavioral sciencesgroup dynamic

Mathematics Subject Classification ID

Multi-objective and goal programming (90C29) Nonlinear programming (90C30)

Related Items

Pareto solutions as limits of collective traps: an inexact multiobjective proximal point algorithm

Cites Work

• Local search proximal algorithms as decision dynamics with costs to move
• Dual descent methods as tension reduction systems
• Proximal point method for a special class of nonconvex multiobjective optimization functions
• Generalized proximal point algorithms for multiobjective optimization problems
• Inexact Proximal Point Methods for Variational Inequality Problems
• Direct Multisearch for Multiobjective Optimization
• Variational Analysis
• Proximal Methods in Vector Optimization
• Interior Gradient and Proximal Methods for Convex and Conic Optimization
• Convex Analysis
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item