Convergence of inexact steepest descent algorithm for multiobjective optimizations on Riemannian manifolds without curvature constraints
DOI10.1007/S10957-023-02235-YzbMATH Open1522.90188OpenAlexW4378672873MaRDI QIDQ6108979FDOQ6108979
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
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
convergence ratemultiobjective optimizationRiemannian manifoldsectional curvaturefull convergenceinexact descent algorithm
Cites Work
- Normal-Boundary Intersection: A New Method for Generating the Pareto Surface in Nonlinear Multicriteria Optimization Problems
- Title not available (Why is that?)
- Title not available (Why is that?)
- Nonlinear multiobjective optimization
- Convergence of the Iterates of Descent Methods for Analytic Cost Functions
- Vector optimization. Set-valued and variational analysis.
- Proper efficiency and the theory of vector maximization
- Title not available (Why is that?)
- Unconstrained steepest descent method for multicriteria optimization on Riemannian manifolds
- Steepest descent method with a generalized Armijo search for quasiconvex functions on Riemannian manifolds
- The constrained Newton method on a Lie group and the symmetric eigenvalue problem
- Variational inequalities for set-valued vector fields on Riemannian manifolds: convexity of the solution set and the proximal point algorithm
- Weak sharp minima on Riemannian manifolds
- Title not available (Why is that?)
- Singularities of monotone vector fields and an extragradient-type algorithm
- Monotone and accretive vector fields on Riemannian manifolds
- Locally Geodesically Quasiconvex Functions on Complete Riemannian Manifolds
- Existence of solutions for variational inequalities on Riemannian manifolds
- Proximal Methods in Vector Optimization
- Steepest descent methods for multicriteria optimization.
- A steepest descent method for vector optimization
- A projected gradient method for vector optimization problems
- Inexact projected gradient method for vector optimization
- Newton methods for nonsmooth convex minimization: connections among \(\mathcal U\)-Lagrangian, Riemannian Newton and SQP methods
- On the convergence of the projected gradient method for vector optimization
- Newton's method for multiobjective optimization
- Scalarization in vector optimization
- Title not available (Why is that?)
- On the choice of parameters for the weighting method in vector optimization
- An inexact steepest descent method for multicriteria optimization on Riemannian manifolds
- Globally convergent optimization algorithms on Riemannian manifolds: Uniform framework for unconstrained and constrained optimization
- Iteration-complexity and asymptotic analysis of steepest descent method for multiobjective optimization on Riemannian manifolds
- A derivative-free trust-region method for biobjective optimization
- Extended Newton methods for multiobjective optimization: majorizing function technique and convergence analysis
- Convergence Analysis of Gradient Algorithms on Riemannian Manifolds without Curvature Constraints and Application to Riemannian Mass
- Subgradient algorithms on Riemannian manifolds of lower bounded curvatures
- Convergence rates analysis of a multiobjective proximal gradient method
- An inexact descent algorithm for multicriteria optimizations on general Riemannian manifolds
Cited In (7)
- Iteration-complexity and asymptotic analysis of steepest descent method for multiobjective optimization on Riemannian manifolds
- Multiobjective BFGS method for optimization on Riemannian manifolds
- An inexact descent algorithm for multicriteria optimizations on general Riemannian manifolds
- Unconstrained 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
- On the convergence of steepest descent methods for multiobjective optimization
- An inexact steepest descent method for multicriteria optimization on Riemannian manifolds
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)