A relaxed projection method for solving multiobjective optimization problems
From MaRDI portal
Publication:1752157
DOI10.1016/j.ejor.2016.05.026zbMath1394.90510OpenAlexW2404804436MaRDI QIDQ1752157
S. S. Souza, João Xavier da Cruz Neto, A. S. Brito, Paulo Sérgio M. Santos
Publication date: 24 May 2018
Published in: European Journal of Operational Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.ejor.2016.05.026
Numerical mathematical programming methods (65K05) Convex programming (90C25) Multi-objective and goal programming (90C29) Nonlinear programming (90C30) Complementarity and equilibrium problems and variational inequalities (finite dimensions) (aspects of mathematical programming) (90C33)
Related Items
A nonmonotone gradient method for constrained multiobjective optimization problems ⋮ An adaptive nonmonotone line search for multiobjective optimization problems ⋮ Nonmonotone gradient methods for vector optimization with a portfolio optimization application ⋮ A weighting subgradient algorithm for multiobjective optimization ⋮ Extension of Zoutendijk method for solving constrained multiobjective optimization problems ⋮ A proximal Newton-type method for equilibrium problems ⋮ A projected subgradient method for nondifferentiable quasiconvex multiobjective optimization problems ⋮ A proximal point method for difference of convex functions in multi-objective optimization with application to group dynamic problems ⋮ Semi-quasidifferentiability in nonsmooth nonconvex multiobjective optimization ⋮ Linear convergence of a nonmonotone projected gradient method for multiobjective optimization
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- A new algorithm for linearly constrained c-convex vector optimization with a supply chain network risk application
- A subgradient method for multiobjective optimization on Riemannian manifolds
- A steepest descent-like method for variable order vector optimization problems
- An inexact subgradient algorithm for equilibrium problems
- An interior proximal method in vector optimization
- On the convergence of a class of outer approximation algorithms for convex programs
- Strong convergence of projected subgradient methods for nonsmooth and nonstrictly convex minimization
- A multicriteria approach to the location of public facilities
- On the projected subgradient method for nonsmooth convex optimization in a Hilbert space
- Nonlinear multiobjective optimization
- A combined relaxation method for variational inequalities with nonlinear constraints
- Steepest descent methods for multicriteria optimization.
- A steepest descent method for vector optimization
- A projected gradient method for vector optimization problems
- The self regulation problem as an inexact steepest descent method for multicriteria optimization
- Nonsmooth multiobjective programming with quasi-Newton methods
- Approximate proximal methods in vector optimization
- A subgradient method for multiobjective optimization
- Inexact projected gradient method for vector optimization
- An explicit algorithm for monotone variational inequalities
- Newton's Method for Multiobjective Optimization
- A relaxed projection method for variational inequalities
- An Outer Approximation Algorithm for Solving General Convex Programs
- Full convergence of the steepest descent method with inexact line searches
- Proximal Methods in Vector Optimization
- A Subgradient Method for Vector Optimization Problems
- Minimization of unsmooth functionals
