A subgradient method for multiobjective optimization on Riemannian manifolds

DOI10.1007/s10957-013-0307-7zbMath1295.90066OpenAlexW2136320557WikidataQ115382572 ScholiaQ115382572MaRDI QIDQ382921

João Xavier da Cruz Neto, Glaydston C. Bento

Publication date: 22 November 2013

Published in: Journal of Optimization Theory and Applications (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s10957-013-0307-7

zbMATH Keywords

subgradient methodmultiobjective optimizationPareto critical pointPareto optimal pointquasi-Féjer convergenceweak Pareto optimal point

Mathematics Subject Classification ID

Multi-objective and goal programming (90C29) Programming in abstract spaces (90C48)

Related Items

Iteration-complexity of gradient, subgradient and proximal point methods on Riemannian manifolds, A new approach to the proximal point method: convergence on general Riemannian manifolds, Proximal point methods for Lipschitz functions on Hadamard manifolds: scalar and vectorial cases, An extragradient method for equilibrium problems on Hadamard manifolds, Proximal point method for vector optimization on Hadamard manifolds, Pareto solutions as limits of collective traps: an inexact multiobjective proximal point algorithm, A trust region method for solving multicriteria optimization problems on Riemannian manifolds, Semivectorial bilevel optimization on Riemannian manifolds, Convergence rates of the stochastic alternating algorithm for bi-objective optimization, Multiobjective BFGS method for optimization on Riemannian manifolds, Multiobjective conjugate gradient methods on Riemannian manifolds, On the convergence rate of a proximal point algorithm for vector function on Hadamard manifolds, Inexact proximal point methods for multiobjective quasiconvex minimization on Hadamard manifolds, Proximal point method for locally Lipschitz functions in multiobjective optimization of Hadamard manifolds, Iteration-complexity of the subgradient method on Riemannian manifolds with lower bounded curvature, First Order Methods for Optimization on Riemannian Manifolds, A weighting subgradient algorithm for multiobjective optimization, Optimality and duality on Riemannian manifolds, A relaxed projection method for solving multiobjective optimization problems, An incremental subgradient method on Riemannian manifolds, A proximal point-type method for multicriteria optimization, Parallel proximal point methods for systems of vector optimization problems on Hadamard manifolds without convexity, Path-based incremental target level algorithm on Riemannian manifolds, A projection algorithm for set-valued variational inequalities on Hadamard manifolds

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Subgradient method for convex feasibility on Riemannian manifolds
• Gauss-Newton method for convex composite optimizations on Riemannian manifolds
• Singularities of monotone vector fields and an extragradient-type algorithm
• Monotone and accretive vector fields on Riemannian manifolds
• Convergence of Newton's method for sections on Riemannian manifolds
• Existence of solutions for variational inequalities on Riemannian manifolds
• Proximal subgradient and a characterization of Lipschitz function on Riemannian manifolds
• Newton's method for sections on Riemannian manifolds: Generalized covariant \(\alpha \)-theory
• A unifying local convergence result for Newton's method in Riemannian manifolds
• Local convexity on smooth manifolds
• Local convergence of the proximal point method for a special class of nonconvex functions on Hadamard manifolds
• Invariant monotone vector fields on Riemannian manifolds
• Subgradient algorithm on Riemannian manifolds
• On the projected subgradient method for nonsmooth convex optimization in a Hilbert space
• Steepest descent methods for multicriteria optimization.
• Kantorovich's theorem on Newton's method in Riemannian manifolds
• Unconstrained steepest descent method for multicriteria optimization on Riemannian manifolds
• A steepest descent method for vector optimization
• Nonsmooth analysis and Hamilton--Jacobi equations on Riemannian manifolds
• Variational inequalities on Hadamard manifolds
• A projected gradient method for vector optimization problems
• Korpelevich's method for variational inequality problems on Hadamard manifolds
• A primal dual modified subgradient algorithm with sharp Lagrangian
• Extended Newton's method for mappings on Riemannian manifolds with values in a cone
• Steepest descent method with a generalized Armijo search for quasiconvex functions on Riemannian manifolds
• Convex- and monotone-transformable mathematical programming problems and a proximal-like point method
• Uniqueness of the singular points of vector fields on Riemannian manifolds under the \(\gamma\)-condition
• Incremental Subgradient Methods for Nondifferentiable Optimization
• Weak Sharp Minima on Riemannian Manifolds
• Nonsmooth analysis on smooth manifolds
• A Bibliography on the Applications of Mathematical Programming Multiple-objective Methods
• Newton's Method for Multiobjective Optimization
• Monotone vector fields and the proximal point algorithm on Hadamard manifolds
• Local convergence of Newton's method under a majorant condition in Riemannian manifolds
• Singular Riemannian barrier methods and gradient-projection dynamical systems for constrained optimization
• Proximal Methods in Vector Optimization
• Newton's method on Riemannian manifolds: Smale's point estimate theory under the γ-condition
• Minimization of unsmooth functionals