A logarithmic-quadratic proximal point scalarization method for multiobjective programming
From MaRDI portal
Publication:625652
DOI10.1007/s10898-010-9544-6zbMath1209.90312OpenAlexW2081186095MaRDI QIDQ625652
Paulo Roberto Oliveira, Ronaldo M. Gregório
Publication date: 25 February 2011
Published in: Journal of Global Optimization (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10898-010-9544-6
Multi-objective and goal programming (90C29) Approximation methods and heuristics in mathematical programming (90C59)
Related Items (7)
The proximal point method with a vectorial Bregman regularization in multiobjective DC programming ⋮ Variants for the logarithmic-quadratic proximal point scalarization method for multiobjective programming ⋮ Pareto solutions as limits of collective traps: an inexact multiobjective proximal point algorithm ⋮ Inexact proximal point methods for multiobjective quasiconvex minimization on Hadamard manifolds ⋮ Logarithmic quasi-distance proximal point scalarization method for multi-objective programming ⋮ The Proximal Point Method for Locally Lipschitz Functions in Multiobjective Optimization with Application to the Compromise Problem ⋮ A proximal point algorithm with quasi-distance in multi-objective optimization
Cites Work
- Pareto optimality, game theory and equilibria
- A logarithmic-quadratic proximal method for variational inequalities
- Nonlinear multiobjective optimization
- Steepest descent methods for multicriteria optimization.
- A survey of recent developments in multiobjective optimization
- An Existence Theorem in Vector Optimization
- Proximal Methods in Vector Optimization
This page was built for publication: A logarithmic-quadratic proximal point scalarization method for multiobjective programming
