Proximal gradient methods for multiobjective optimization and their applications
From MaRDI portal
Recommendations
- A Newton-type proximal gradient method for nonlinear multi-objective optimization problems
- Convergence rates analysis of a multiobjective proximal gradient method
- Multiple subgradient descent bundle method for convex nonsmooth multiobjective optimization
- A nonmonotone gradient method for constrained multiobjective optimization problems
- Multiple reduced gradient method for multiobjective optimization problems
Cites work
- scientific article; zbMATH DE number 1818892 (Why is no real title available?)
- scientific article; zbMATH DE number 2121575 (Why is no real title available?)
- A Fast Iterative Shrinkage-Thresholding Algorithm for Linear Inverse Problems
- A projected gradient method for vector optimization problems
- A subgradient method for multiobjective optimization
- Approximation accuracy, gradient methods, and error bound for structured convex optimization
- Convergence Analysis of a Proximal-Like Minimization Algorithm Using Bregman Functions
- Minmax robustness for multi-objective optimization problems
- Newton's method for multiobjective optimization
- Point-to-Set Maps in Mathematical Programming
- Proper efficiency and the theory of vector maximization
- Proximal Methods in Vector Optimization
- Robust convex optimization
- Robust multiobjective optimization \& applications in portfolio optimization
- Second-order cone programming
- Steepest descent methods for multicriteria optimization.
- Strong Duality in Nonconvex Quadratic Optimization with Two Quadratic Constraints
- Using SeDuMi 1.02, A Matlab toolbox for optimization over symmetric cones
Cited in
(32)- An efficient descent method for locally Lipschitz multiobjective optimization problems
- Accelerated diagonal steepest descent method for unconstrained multiobjective optimization
- A line search technique for a class of multi-objective optimization problems using subgradient
- Gradient-based algorithms for multi-objective bi-level optimization
- An away-step Frank-Wolfe algorithm for constrained multiobjective optimization
- A proximal gradient splitting method for solving convex vector optimization problems
- Multiobjective BFGS method for optimization on Riemannian manifolds
- Multiple reduced gradient method for multiobjective optimization problems
- An accelerated proximal gradient method for multiobjective optimization
- An incremental descent method for multi-objective optimization
- A Newton-type proximal gradient method for nonlinear multi-objective optimization problems
- Conditional gradient method for multiobjective optimization
- Convergence analysis of a generalized proximal algorithm for multiobjective quasiconvex minimization on Hadamard manifolds
- The generalized conditional gradient method for composite multiobjective optimization problems on Riemannian manifolds
- Convergence rates of the stochastic alternating algorithm for bi-objective optimization
- A strongly convergent proximal point method for vector optimization
- MONOTONICITY FOR MULTIOBJECTIVE ACCELERATED PROXIMAL GRADIENT METHODS
- Approximations for Pareto and proper Pareto solutions and their KKT conditions
- Proximal point method for a special class of nonconvex multiobjective optimization functions
- A family of conjugate gradient methods with guaranteed positiveness and descent for vector optimization
- New merit functions for multiobjective optimization and their properties
- Proximal Newton methods for multiobjective optimization problems
- Proximal quasi-Newton methods for the composite multiobjective optimization problems
- An augmented Lagrangian algorithm for multi-objective optimization
- Cardinality-Constrained Multi-objective Optimization: Novel Optimality Conditions and Algorithms
- Convergence rates analysis of a multiobjective proximal gradient method
- Improved front steepest descent for multi-objective optimization
- A new scheme for approximating the weakly efficient solution set of vector rational optimization problems
- A proximal gradient method with Bregman distance in multi-objective optimization
- A non-monotone proximal gradient algorithm for solving nonsmooth multiobjective optimization problems with an extending application to robust multiobjective optimization
- Generalized proximal point algorithms for multiobjective optimization problems
- A conjugate directions-type procedure for quadratic multiobjective optimization
This page was built for publication: Proximal gradient methods for multiobjective optimization and their applications
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2419509)
