A proximal gradient splitting method for solving convex vector optimization problems
From MaRDI portal
Publication:5034925
DOI10.1080/02331934.2020.1800699zbMath1486.90143OpenAlexW3046534822MaRDI QIDQ5034925
Yunier Y. Bello Cruz, Jefferson G. Melo, Ray V. G. Serra
Publication date: 21 February 2022
Published in: Optimization (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1080/02331934.2020.1800699
Numerical mathematical programming methods (65K05) Convex programming (90C25) Methods of reduced gradient type (90C52)
Related Items
Convergence rates analysis of a multiobjective proximal gradient method ⋮ A strongly convergent proximal point method for vector optimization
Cites Work
- Unnamed Item
- A Fast Iterative Shrinkage-Thresholding Algorithm for Linear Inverse Problems
- Subgradient algorithms for solving variable inequalities
- A steepest descent-like method for variable order vector optimization problems
- A subgradient-like algorithm for solving vector convex inequalities
- Convergence of the projected gradient method for quasiconvex multiobjective optimization
- Approximation accuracy, gradient methods, and error bound for structured convex optimization
- A proximal point-type method for multicriteria optimization
- Steepest descent methods for multicriteria optimization.
- Proximal point method for a special class of nonconvex multiobjective optimization functions
- Unconstrained steepest descent method for multicriteria optimization on Riemannian manifolds
- A steepest descent method for vector optimization
- A projected gradient method for vector optimization problems
- A subgradient method for multiobjective optimization
- Proximal gradient methods for multiobjective optimization and their applications
- Robust multiobjective optimization \& applications in portfolio optimization
- On the convergence of the forward–backward splitting method with linesearches
- Inertial forward–backward methods for solving vector optimization problems
- Newton's Method for Multiobjective Optimization
- The Proximal Point Method for Locally Lipschitz Functions in Multiobjective Optimization with Application to the Compromise Problem
- Nonlinear Conjugate Gradient Methods for Vector Optimization
- Entropy-Like Proximal Methods in Convex Programming
- A quadratically convergent Newton method for vector optimization
- Proximal Methods in Vector Optimization
- A Subgradient Method for Vector Optimization Problems
- Convex analysis and monotone operator theory in Hilbert spaces
