Unconstrained steepest descent method for multicriteria optimization on Riemannian manifolds

DOI10.1007/s10957-011-9984-2zbMath1263.90082arXiv1011.0010WikidataQ115382578 ScholiaQ115382578MaRDI QIDQ1762393

Orizon P. Ferreira, Paulo Roberto Oliveira, Glaydston C. Bento

Publication date: 26 November 2012

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

Full work available at URL: https://arxiv.org/abs/1011.0010

zbMATH Keywords

vector optimization; quasiconvexity; Riemannian manifolds; Pareto optimality; steepest descent; quasi-Fejér convergence

Mathematics Subject Classification ID

90C29: Multi-objective and goal programming

Related Items

Proximal point method for a special class of nonconvex functions on Hadamard manifolds, A proximal gradient splitting method for solving convex vector optimization problems, Convergence Analysis of Gradient Algorithms on Riemannian Manifolds without Curvature Constraints and Application to Riemannian Mass, Finite termination of the proximal point method for convex functions on Hadamard manifolds, Convergence of inexact steepest descent algorithm for multiobjective optimizations on Riemannian manifolds without curvature constraints, Multiobjective conjugate gradient methods on Riemannian manifolds, \(\varepsilon\)-subgradient algorithms for locally Lipschitz functions on Riemannian manifolds, An inexact steepest descent method for multicriteria optimization on Riemannian manifolds, A subgradient method for multiobjective optimization on Riemannian manifolds, A proximal point-type method for multicriteria optimization, Semivectorial bilevel optimization on Riemannian manifolds, A proximal point algorithm for DC functions on Hadamard manifolds, Proximal point methods for Lipschitz functions on Hadamard manifolds: scalar and vectorial cases, The identification of convex function on Riemannian manifold, Proximal point method for locally Lipschitz functions in multiobjective optimization of Hadamard manifolds, An incremental subgradient method on Riemannian manifolds, A strongly convergent proximal point method for vector optimization, Limiting subdifferential calculus and perturbed distance function in Riemannian manifolds, Inexact proximal point methods for multiobjective quasiconvex minimization on Hadamard manifolds, The self regulation problem as an inexact steepest descent method for multicriteria optimization, Iteration-complexity and asymptotic analysis of steepest descent method for multiobjective optimization on Riemannian manifolds, Riemannian optimization and multidisciplinary design optimization, Proximal point method for vector optimization on Hadamard manifolds, Nash-type equilibria on Riemannian manifolds: a variational approach, 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

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Subgradient method for convex feasibility on Riemannian manifolds
• 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 convergence of the proximal point method for a special class of nonconvex functions on Hadamard manifolds
• Invariant monotone vector fields on Riemannian manifolds
• Minimizing a differentiable function over a differential manifold
• Subgradient algorithm on Riemannian manifolds
• Smooth nonlinear optimization of \(\mathbb R^n\)
• Steepest descent methods for multicriteria optimization.
• Kantorovich's theorem on Newton's method in Riemannian manifolds
• A steepest descent method for vector optimization
• Nonsmooth analysis and Hamilton--Jacobi equations on Riemannian manifolds
• On the Riemannian geometry defined by self-concordant barriers and interior-point methods.
• A projected gradient method for vector optimization problems
• Approximation of functions on the Sobolev space on the sphere in the average case setting
• 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
• New self-concordant barrier for the hypercube
• 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
• Convergence of the steepest descent method for minimizing quasiconvex functions
• Kantorovich's theorems for Newton's method for mappings and optimization problems on Lie groups
• Nonsmooth analysis on smooth manifolds
• Newton's Method for Multiobjective Optimization
• Monotone vector fields and the proximal point algorithm on Hadamard manifolds
• An Existence Theorem in Vector Optimization
• Optimization Techniques on Riemannian Manifolds
• Singular Riemannian barrier methods and gradient-projection dynamical systems for constrained optimization
• Full convergence of the steepest descent method with inexact line searches
• Proximal Methods in Vector Optimization
• Newton's method on Riemannian manifolds: Smale's point estimate theory under the γ-condition
• Domains of positivity