A dynamic gradient approach to Pareto optimization with nonsmooth convex objective functions
From MaRDI portal
(Redirected from Publication:458364)
Abstract: In a general Hilbert framework, we consider continuous gradient-like dynamical systems for constrained multiobjective optimization involving non-smooth convex objective functions. Our approach is in the line of a previous work where was considered the case of convex di erentiable objective functions. Based on the Yosida regularization of the subdi erential operators involved in the system, we obtain the existence of strong global trajectories. We prove a descent property for each objective function, and the convergence of trajectories to weak Pareto minima. This approach provides a dynamical endogenous weighting of the objective functions. Applications are given to cooperative games, inverse problems, and numerical multiobjective optimization.
Recommendations
- A continuous gradient-like dynamical approach to Pareto-optimization in Hilbert spaces
- A nonmonotone gradient method for constrained multiobjective optimization problems
- Publication:3032095
- scientific article; zbMATH DE number 3887449
- Multiple subgradient descent bundle method for convex nonsmooth multiobjective optimization
Cites work
- scientific article; zbMATH DE number 3855514 (Why is no real title available?)
- scientific article; zbMATH DE number 4044567 (Why is no real title available?)
- scientific article; zbMATH DE number 3177945 (Why is no real title available?)
- scientific article; zbMATH DE number 3763618 (Why is no real title available?)
- scientific article; zbMATH DE number 45061 (Why is no real title available?)
- scientific article; zbMATH DE number 3806227 (Why is no real title available?)
- scientific article; zbMATH DE number 3893867 (Why is no real title available?)
- scientific article; zbMATH DE number 3398324 (Why is no real title available?)
- scientific article; zbMATH DE number 3424863 (Why is no real title available?)
- A continuous gradient-like dynamical approach to Pareto-optimization in Hilbert spaces
- A steepest descent method for vector optimization
- An existence theorem for a class of differential equations with multivalued right-hand side
- Asymptotic convergence of nonlinear contraction semigroups in Hilbert space
- Convex analysis and monotone operator theory in Hilbert spaces
- Existence of slow solutions for a class of differential inclusions
- Integrals which are convex functionals
- On evolution equations having monotonicities of opposite sign
- On multivalued evolution equations in Hilbert spaces
- Proximal Methods in Vector Optimization
- Steepest descent methods for multicriteria optimization.
- Sufficient conditions for global weak Pareto solutions in multiobjective optimization
- The gradient and heavy ball with friction dynamical systems: The quasiconvex case
- Variational Analysis
- Variational Analysis in Sobolev andBVSpaces
- Weak convergence of the sequence of successive approximations for nonexpansive mappings
Cited in
(8)- Fast Multiobjective Gradient Methods with Nesterov Acceleration via Inertial Gradient-like Systems
- Multiple reduced gradient method for multiobjective optimization problems
- A unifying convex analysis and switching system approach to consensus with undirected communication graphs
- An efficient descent method for locally Lipschitz multiobjective optimization problems
- Fast convergence of inertial multiobjective gradient-like systems with asymptotic vanishing damping
- Multiobjective optimal control of a non-smooth semilinear elliptic partial differential equation
- A descent method for nonsmooth multiobjective optimization in Hilbert spaces
- A continuous gradient-like dynamical approach to Pareto-optimization in Hilbert spaces
This page was built for publication: A dynamic gradient approach to Pareto optimization with nonsmooth convex objective functions
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q458364)
