An implementable descent method for nonsmooth multiobjective optimization on Riemannian manifolds
From MaRDI portal
Cites work
- 2D decision-making for multicriteria design optimization
- A brief introduction to manifold optimization
- A Broyden class of quasi-Newton methods for Riemannian optimization
- A dynamic gradient approach to Pareto optimization with nonsmooth convex objective functions
- A proximal bundle algorithm for nonsmooth optimization on Riemannian manifolds
- A Riemannian conjugate gradient method for optimization on the Stiefel manifold
- A Riemannian gradient sampling algorithm for nonsmooth optimization on manifolds
- A Robust Gradient Sampling Algorithm for Nonsmooth, Nonconvex Optimization
- A subgradient method for multiobjective optimization on Riemannian manifolds
- A trust region method for solving multicriteria optimization problems on Riemannian manifolds
- Accelerated diagonal steepest descent method for unconstrained multiobjective optimization
- An effective nonsmooth optimization algorithm for locally Lipschitz functions
- An efficient descent method for locally Lipschitz multiobjective optimization problems
- An inexact steepest descent method for multicriteria optimization on Riemannian manifolds
- An Introduction to Optimization on Smooth Manifolds
- Generalized gradients and characterization of epi-Lipschitz sets in Riemannian manifolds
- scientific article; zbMATH DE number 845714 (Why is no real title available?)
- scientific article; zbMATH DE number 5223994 (Why is no real title available?)
- scientific article; zbMATH DE number 2222819 (Why is no real title available?)
- Line search algorithms for locally Lipschitz functions on Riemannian manifolds
- Local convergence of the proximal point method for a special class of nonconvex functions on Hadamard manifolds
- Multicriteria Optimization
- Newton's method for multiobjective optimization
- OLAF -- a general modeling system to evaluate and optimize the location of an air polluting facility
- On Nonsmooth Multiobjective Optimality Conditions with Generalized Convexities
- Optimization and nonsmooth analysis
- Proper efficiency and the theory of vector maximization
- Proximal Methods in Vector Optimization
- Proximal point method for locally Lipschitz functions in multiobjective optimization of Hadamard manifolds
- Quasi-Newton's method for multiobjective optimization
- Riemannian optimization and its applications
- Simultaneous Minimization of Mean and Variation of Flow Time and Waiting Time in Single Machine Systems
- Steepest descent methods for multicriteria optimization.
- Subgradient method for convex feasibility on Riemannian manifolds
- The proximal point method for locally Lipschitz functions in multiobjective optimization with application to the compromise problem
- Theory of multiobjective optimization
- Unconstrained steepest descent method for multicriteria optimization on Riemannian manifolds
This page was built for publication: An implementable descent method for nonsmooth multiobjective optimization on Riemannian manifolds
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6950996)