High-Performance Scientific Computing 2012
DOI: 10.1007/978-1-4471-2437-5_14
|View full text |Cite
|
Sign up to set email alerts
|

A Riemannian Dennis-Moré Condition

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
1

Citation Types

0
3
0

Year Published

2014
2014
2024
2024

Publication Types

Select...
4
1

Relationship

0
5

Authors

Journals

citations
Cited by 5 publications
(3 citation statements)
references
References 7 publications
0
3
0
Order By: Relevance
“…Proof. Note that the Riemannian Newton iteration in (14) for the modified complementarity condition yields…”
Section: Prototype Algorithmmentioning
confidence: 99%
See 1 more Smart Citation
“…Proof. Note that the Riemannian Newton iteration in (14) for the modified complementarity condition yields…”
Section: Prototype Algorithmmentioning
confidence: 99%
“…This condition encompasses a large category of well-known update formulas, such as BFGS. Gallivan et al [14] have generalized it to the Riemannian quasi-Newton methods. In this section, we give an analogous Dennis Moré condition for our quasi-Newton RIP by Theorem 6.1, and establish its superlinear convergence by Theorem 6.2.…”
Section: Local and Superlinear Convergence Of Quasi-newton Ripmentioning
confidence: 99%
“…-Note that the condition in corollary 3.3 is similar to the Dennis-Moré condition [10,8], which is also applicable for quasi-Newton update techniques on Riemannian manifolds [28,17]. The application of the exponential mapping within the Newton method is an expensive operation.…”
Section: Convergence Of Riemannian Newtonmentioning
confidence: 99%