Iteration-complexity and asymptotic analysis of steepest descent method for multiobjective optimization on Riemannian manifolds
type: Item
instance of: scholarly article
title: Iteration-complexity and asymptotic analysis of steepest descent method for multiobjective optimization on Riemannian manifolds
zbMATH Open document ID: 1432.90137
author: Maurício Silva Louzeiro
author: L. F. Prudente
author: O. P. Ferreira
published in: Journal of Optimization Theory and Applications
publication date: 2020-02-26T00:00:00Z
full work available at URL: https://arxiv.org/abs/1906.05975
Mathematics Subject Classification ID: 90C29
Mathematics Subject Classification ID: 90C33
Mathematics Subject Classification ID: 65K05
zbMATH DE Number: 7174584
zbMATH Keywords: steepest descent method
zbMATH Keywords: multiobjective optimization problem
zbMATH Keywords: Riemannian manifold
zbMATH Keywords: lower bounded curvature
zbMATH Keywords: iteration-complexity bound
describes a project that uses: Algorithm 500
describes a project that uses: ALGENCAN
describes a project that uses: Expokit
MaRDI profile type: Publication
OpenAlex ID: W2992083372
Wikidata QID: Q115382545
arXiv ID: 1906.05975
cites work: Nonlinear Conjugate Gradient Methods for Vector Optimization
cites work: On the extension of the Hager-Zhang conjugate gradient method for vector optimization
cites work: The Proximal Point Method for Locally Lipschitz Functions in Multiobjective Optimization with Application to the Compromise Problem
cites work: Multiple subgradient descent bundle method for convex nonsmooth multiobjective optimization
cites work: Trust region globalization strategy for the nonconvex unconstrained multiobjective optimization problem
cites work: A method for constrained multiobjective optimization based on SQP techniques
cites work: Barzilai and Borwein's method for multiobjective optimization problems
cites work: Steepest descent methods for multicriteria optimization.
cites work: Inexact projected gradient method for vector optimization
cites work: On the convergence of the projected gradient method for vector optimization
cites work: A steepest descent method for vector optimization
cites work: A projected gradient method for vector optimization problems
cites work: A steepest descent-like method for variable order vector optimization problems
cites work: A Subgradient Method for Vector Optimization Problems
cites work: Complexity of gradient descent for multiobjective optimization
cites work: Gradient Method for Optimization on Riemannian Manifolds with Lower Bounded Curvature
cites work: Iteration-complexity of gradient, subgradient and proximal point methods on Riemannian manifolds
cites work: A survey and comparison of contemporary algorithms for computing the matrix geometric mean
cites work: Smooth nonlinear optimization of \(\mathbb R^n\)
cites work: Conic Geometric Optimization on the Manifold of Positive Definite Matrices
cites work: The Geometry of Algorithms with Orthogonality Constraints
cites work: Optimization Techniques on Riemannian Manifolds
cites work: The Gradient Projection Method Along Geodesics
cites work: Q4310716
cites work: Q5433140
cites work: On the Riemannian geometry defined by self-concordant barriers and interior-point methods.
cites work: Weak Sharp Minima on Riemannian Manifolds
cites work: Variational Inequalities for Set-Valued Vector Fields on Riemannian Manifolds: Convexity of the Solution Set and the Proximal Point Algorithm
cites work: Linear Convergence of Subgradient Algorithm for Convex Feasibility on Riemannian Manifolds
cites work: Subgradient projection algorithms for convex feasibility on Riemannian manifolds with lower bounded curvatures
cites work: A framework for generalising the Newton method and other iterative methods from Euclidean space to manifolds
cites work: Proximal Point Algorithms on Hadamard Manifolds: Linear Convergence and Finite Termination
cites work: Unconstrained steepest descent method for multicriteria optimization on Riemannian manifolds
cites work: An inexact steepest descent method for multicriteria optimization on Riemannian manifolds
cites work: Q4888132
cites work: Q4241150
cites work: Full convergence of the steepest descent method with inexact line searches
cites work: A Fast Iterative Shrinkage-Thresholding Algorithm for Linear Inverse Problems
cites work: An extragradient-type algorithm for variational inequality on Hadamard manifolds
cites work: Q4226699
cites work: Q2933924
cites work: Riemannian Geometry
cites work: A Wolfe Line Search Algorithm for Vector Optimization
cites work: Practical Augmented Lagrangian Methods for Constrained Optimization
cites work: Newton's Method for Multiobjective Optimization
cites work: Expokit
DOI: 10.1007/S10957-019-01615-7
description: scientific article