A logarithmic-quadratic proximal point scalarization method for multiobjective programming
From MaRDI portal
Publication:625652
Recommendations
- Variants for the logarithmic-quadratic proximal point scalarization method for multiobjective programming
- Logarithmic quasi-distance proximal point scalarization method for multi-objective programming
- A scalarization proximal point method for quasiconvex multiobjective minimization
- A linear scalarization proximal point method for quasiconvex multiobjective minimization
- An inexact scalarization proximal point method for multiobjective quasiconvex minimization
Cites work
- A logarithmic-quadratic proximal method for variational inequalities
- A survey of recent developments in multiobjective optimization
- An Existence Theorem in Vector Optimization
- Nonlinear multiobjective optimization
- Pareto optimality, game theory and equilibria
- Proximal Methods in Vector Optimization
- Steepest descent methods for multicriteria optimization.
Cited in
(8)- The proximal point method for locally Lipschitz functions in multiobjective optimization with application to the compromise problem
- Variants for the logarithmic-quadratic proximal point scalarization method for multiobjective programming
- Quadratic scalarization for decomposed multiobjective optimization
- The proximal point method with a vectorial Bregman regularization in multiobjective DC 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
- A proximal point algorithm with quasi-distance in multi-objective optimization
- Logarithmic quasi-distance proximal point scalarization method for multi-objective programming
This page was built for publication: A logarithmic-quadratic proximal point scalarization method for multiobjective programming
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q625652)