Convergence of inexact steepest descent algorithm for multiobjective optimizations on Riemannian manifolds without curvature constraints

DOI10.1007/S10957-023-02235-YMaRDI QIDQ6108979zbMATH OpenOpenAlexFDO

Authors Xiangmei Wang, J. H. Wang, C. Li

Publication date 26 July 2023

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

Full work available at URL https://doi.org/10.1007/s10957-023-02235-y

zbMATH Keywords

convergence ratefull convergenceinexact descent algorithmmultiobjective optimizationRiemannian manifoldsectional curvature

Mathematics Subject Classification ID

Numerical mathematical programming methods (65K05) Multi-objective and goal programming (90C29)

Recommendations

• An inexact descent algorithm for multicriteria optimizations on general Riemannian manifolds
• An inexact steepest descent method for multicriteria optimization on Riemannian manifolds
• Convergence analysis of a nonmonotone projected gradient method for multiobjective optimization problems on Riemannian manifolds
• Unconstrained steepest descent method for multicriteria optimization on Riemannian manifolds
• Iteration-complexity and asymptotic analysis of steepest descent method for multiobjective optimization on Riemannian manifolds

Cites work

• A derivative-free trust-region method for biobjective optimization
• A projected gradient method for vector optimization problems
• A steepest descent method for vector optimization
• An inexact descent algorithm for multicriteria optimizations on general Riemannian manifolds
• An inexact steepest descent method for multicriteria optimization on Riemannian manifolds
• Convergence Analysis of Gradient Algorithms on Riemannian Manifolds without Curvature Constraints and Application to Riemannian Mass
• Convergence of the Iterates of Descent Methods for Analytic Cost Functions
• Convergence rates analysis of a multiobjective proximal gradient method
• Existence of solutions for variational inequalities on Riemannian manifolds
• Extended Newton methods for multiobjective optimization: majorizing function technique and convergence analysis
• Globally convergent optimization algorithms on Riemannian manifolds: Uniform framework for unconstrained and constrained optimization
• scientific article; zbMATH DE number 4063877 (Why is no real title available?)
• scientific article; zbMATH DE number 681023 (Why is no real title available?)
• scientific article; zbMATH DE number 909255 (Why is no real title available?)
• scientific article; zbMATH DE number 3214233 (Why is no real title available?)
• scientific article; zbMATH DE number 5223994 (Why is no real title available?)
• Inexact projected gradient method for vector optimization
• Iteration-complexity and asymptotic analysis of steepest descent method for multiobjective optimization on Riemannian manifolds
• Locally Geodesically Quasiconvex Functions on Complete Riemannian Manifolds
• Monotone and accretive vector fields on Riemannian manifolds
• Newton methods for nonsmooth convex minimization: connections among \(\mathcal U\)-Lagrangian, Riemannian Newton and SQP methods
• Newton's method for multiobjective optimization
• Nonlinear multiobjective optimization
• Normal-Boundary Intersection: A New Method for Generating the Pareto Surface in Nonlinear Multicriteria Optimization Problems
• On the choice of parameters for the weighting method in vector optimization
• On the convergence of the projected gradient method for vector optimization
• Proper efficiency and the theory of vector maximization
• Proximal Methods in Vector Optimization
• Scalarization in vector optimization
• Singularities of monotone vector fields and an extragradient-type algorithm
• Steepest descent method with a generalized Armijo search for quasiconvex functions on Riemannian manifolds
• Steepest descent methods for multicriteria optimization.
• Subgradient algorithms on Riemannian manifolds of lower bounded curvatures
• The constrained Newton method on a Lie group and the symmetric eigenvalue problem
• Unconstrained steepest descent method for multicriteria optimization on Riemannian manifolds
• Variational inequalities for set-valued vector fields on Riemannian manifolds: convexity of the solution set and the proximal point algorithm
• Vector optimization. Set-valued and variational analysis.
• Weak sharp minima on Riemannian manifolds

Cited in

(8)

• Unconstrained steepest descent method for multicriteria optimization on Riemannian manifolds
• Iteration-complexity and asymptotic analysis of steepest descent method for multiobjective optimization on Riemannian manifolds
• An inexact descent algorithm for multicriteria optimizations on general Riemannian manifolds
• An inexact steepest descent method for multicriteria optimization on Riemannian manifolds
• Convergence Analysis of Gradient Algorithms on Riemannian Manifolds without Curvature Constraints and Application to Riemannian Mass
• Multiobjective BFGS method for optimization on Riemannian manifolds
• An inexact proximal point method with quasi-distance for quasiconvex multiobjective optimization problems on Riemannian manifolds
• On the convergence of steepest descent methods for multiobjective optimization

This page was built for publication: Convergence of inexact steepest descent algorithm for multiobjective optimizations on Riemannian manifolds without curvature constraints

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6108979)