Hamiltonian and Gradient Flows, Algorithms and Control 1995
DOI: 10.1090/fic/003/09
|View full text |Cite
|
Sign up to set email alerts
|

Optimization techniques on Riemannian manifolds

Abstract: Abstract. The techniques and analysis presented in this paper provide new methods to solve optimization problems posed on Riemannian manifolds. A new point of view is offered for the solution of constrained optimization problems. Some classical optimization techniques on Euclidean space are generalized to Riemannian manifolds. Several algorithms are presented and their convergence properties are analyzed employing the Riemannian structure of the manifold. Specifically, two apparently new algorithms, which can … Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
1
1
1

Citation Types

3
308
0

Year Published

2002
2002
2018
2018

Publication Types

Select...
6
2

Relationship

0
8

Authors

Journals

citations
Cited by 229 publications
(311 citation statements)
references
References 32 publications
(30 reference statements)
3
308
0
Order By: Relevance
“…This natural Riemannian version of Newton's method for solving systems of nonlinear equations has been considered by several authors [1,5,6,8,19,20]. In order to state a general local convergence result for R-Newton's method, we will assume a Lipschitz-type continuity of X on a neighborhood of p 0 , based on the following definition.…”
Section: Rr N°5381mentioning
confidence: 99%
See 1 more Smart Citation
“…This natural Riemannian version of Newton's method for solving systems of nonlinear equations has been considered by several authors [1,5,6,8,19,20]. In order to state a general local convergence result for R-Newton's method, we will assume a Lipschitz-type continuity of X on a neighborhood of p 0 , based on the following definition.…”
Section: Rr N°5381mentioning
confidence: 99%
“…To our best knowledge, the theory of self-concordancy has not been extended to a Riemannian setting yet. The main motivation for enlarging the usual Euclidean setting to Riemannian manifolds stems essentially from the necessity to be able to deal with (equality) nonlinear constraints, especially in minimization problems; see, for instance, the works by Adler et al [1], da Cruz Neto et al [6], Edelman et al [8], Smith [19] and Udriste [20].…”
Section: Introductionmentioning
confidence: 99%
“…in [62,65,32,21,1] to cite just a few. The iteration we investigate in this paper does not enter into this family as it does not use the covariant derivative of the vector field of which we are trying to find the zeros, Moreover, we cannot recast it as an optimization problem on a Riemannian manifold, as stated above.…”
Section: Related Workmentioning
confidence: 99%
“…Newton algorithms on Riemannian manifolds were first proposed in the general context of optimization on manifolds [62,65]. Their convergence has been studied in depth in [47,32,1] to cite just a few of the important works.…”
Section: A Fixed Point Iteration To Compute the Karcher Meanmentioning
confidence: 99%
“…Algorithms of this form can be found in [LOS00], [Ous99], [MS05]. As explained in [MM05], these methods can be seen as concrete versions of the intrinsic Riemannian Newton method (see [Gab82] and [Smi94] among others).…”
Section: Introductionmentioning
confidence: 99%