The self regulation problem as an inexact steepest descent method for multicriteria optimization
From MaRDI portal
Publication:2256314
DOI10.1016/j.ejor.2014.01.002zbMath1305.90362arXiv1207.0775OpenAlexW1981843668MaRDI QIDQ2256314
Antoine Soubeyran, Paulo Roberto Oliveira, João Xavier da Cruz Neto, Glaydston C. Bento
Publication date: 19 February 2015
Published in: European Journal of Operational Research (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1207.0775
Related Items
Reduced Jacobian method ⋮ A nonmonotone gradient method for constrained multiobjective optimization problems ⋮ Inexact coordinate descent: complexity and preconditioning ⋮ Convergence analysis of a projected gradient method for multiobjective optimization problems ⋮ A relaxed projection method for solving multiobjective optimization problems ⋮ A proximal point-type method for multicriteria optimization ⋮ 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 ⋮ Convergence of a nonmonotone projected gradient method for nonconvex multiobjective optimization ⋮ Proximal point algorithm for differentiable quasi-convex multiobjective optimization ⋮ Linear convergence of a nonmonotone projected gradient method for multiobjective optimization
Cites Work
- Unnamed Item
- Convergence of the projected gradient method for quasiconvex multiobjective optimization
- Hybrid approximate proximal method with auxiliary variational inequality for vector optimization
- An interior proximal method in vector optimization
- Convergence of a projected gradient method variant for quasiconvex objectives
- Steepest descent methods for multicriteria optimization.
- Unconstrained steepest descent method for multicriteria optimization on Riemannian manifolds
- A steepest descent method for vector optimization
- Inexact projected gradient method for vector optimization
- Box-constrained multi-objective optimization: A gradient-like method without ``a priori scalarization
- Convergence of the steepest descent method for minimizing quasiconvex functions
- Newton's Method for Multiobjective Optimization
- Full convergence of the steepest descent method with inexact line searches
- Proximal Methods in Vector Optimization
This page was built for publication: The self regulation problem as an inexact steepest descent method for multicriteria optimization
