The DOI matches its Crossref record; 26 of the 26 references it cites were found in a registry or an index.
Optimization techniques on Riemannian manifolds
Abstract
The techniques and analysis presented in this paper provide new meth-ods 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 em-ploying the Riemannian structure of the manifold. Specifically, two apparently new algorithms, which can be thought of as Newton’s method and the conjugate gradient method on Riemannian manifolds, are presented and shown to possess, respectively, quadratic and superlinear convergence. Examples of each method on certain Rieman-nian manifolds are given with the results of numerical experiments. Rayleigh’s quotient defined on the sphere is one example. It is shown that Newton’s method applied to this function converges cubically, and that the Rayleigh quotient iteration is an effi-cient approximation of Newton’s method. The Riemannian version of the conjugate gradient method applied to this function gives a new algorithm for finding the eigen-vectors corresponding to the extreme eigenvalues of a symmetric matrix. Another example arises from extremizing the function tr ΘTQΘN on the special orthogonal group. In a similar example, it is shown that Newton’s method applied to the sum of the squares of the off-diagonal entries of a symmetric matrix converges cubically.
Overview
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Self-check
Percentages, sums and reported differences re-computed from the paper’s own numbers.
The self-check needs the paper’s full text.
Citations
Cites
Golub, G. (2012) · doi:10.56021/9781421407944 · Cited by 34,505
Methods of conjugate gradients for solving linear systems
Hestenes, M. R., & Stiefel, E. (1952) · Journal of Research of the National Bureau of Standards · doi:10.6028/jres.049.044 · Cited by 8,132
Practical Methods of Optimization
Fletcher, R. (2000) · Wiley eBooks · doi:10.1002/9781118723203 · Cited by 7,605
Practical methods of optimization
(1988) · Mathematics and Computers in Simulation · doi:10.1016/0378-4754(88)90129-2 · Cited by 5,818
Differential Geometry, Lie Groups, and Symmetric Spaces
Helgason, S. (2001) · Graduate Studies in Mathematics · doi:10.1090/gsm/034 · Cited by 5,433
Principles of mathematical analysis
Rudin, W. (1964) · UCLA - Biblioteca de Ciencias y Tecnologia Felix Morales Bueno · Cited by 5,298
Function minimization by conjugate gradients
Fletcher, R. (1964) · The Computer Journal · doi:10.1093/comjnl/7.2.149 · Cited by 4,939
Constrained Optimization and Lagrange Multiplier Methods
(1982) · Elsevier eBooks · doi:10.1016/c2013-0-10366-2 · Cited by 4,016
Principles of mathematical analysis
Hammer, C. (1953) · Journal of the Franklin Institute · doi:10.1016/0016-0032(53)90617-6 · Cited by 3,985
A Comprehensive Introduction to Differential Geometry.
Kramer, A. D., & Spivak, M. (1973) · The American Mathematical Monthly · doi:10.2307/2319112 · Cited by 3,445
The Symmetric Eigenvalue Problem
Parlett, B. N. (1998) · Society for Industrial and Applied Mathematics eBooks · doi:10.1137/1.9781611971163 · Cited by 3,192
Introduction to linear and nonlinear programming
Polak, E. (1974) · IEEE Transactions on Automatic Control · doi:10.1109/tac.1974.1100535 · Cited by 2,100
Stable Mappings and Their Singularities
Golubitsky, M., & Guillemin, V. (1973) · Graduate Texts in Mathematics · doi:10.1007/978-1-4615-7904-5 · Cited by 1,963
Introduction to linear and nonlinear programming
Luenberger, D. G. (1973) · Medical Entomology and Zoology · Cited by 1,915
Nineteen Dubious Ways to Compute the Exponential of a Matrix
Moler, C., & Van Loan, C. (1978) · SIAM Review · doi:10.1137/1020098 · Cited by 1,526
The Symmetric Eigenvalue Problem.
Wilkinson, J. H., & Parlett, B. N. (1981) · Mathematics of Computation · doi:10.2307/2007453 · Cited by 1,186
Riemannian center of mass and mollifier smoothing
Karcher, H. (1977) · Communications on Pure and Applied Mathematics · doi:10.1002/cpa.3160300502 · Cited by 995
Comparison Theorems in Riemannian Geometry
Cheeger, J., & Ebin, D. (2008) · American Mathematical Society eBooks · doi:10.1090/chel/365 · Cited by 970
Computational methods in optimization
Polak, E. (1971) · Cited by 941
Projected Newton Methods for Optimization Problems with Simple Constraints
Bertsekas, D. P. (1982) · SIAM Journal on Control and Optimization · doi:10.1137/0320018 · Cited by 613
Comparison Theorems in Riemannian Geometry
Eschenburg, J.-H. (1975) · North-Holland mathematical library · doi:10.1016/s0924-6509(08)x7013-8 · Cited by 562
Invariant Affine Connections on Homogeneous Spaces
Nomizu, K. (1954) · American Journal of Mathematics · doi:10.2307/2372398 · Cited by 510
Foundations of Differential Geometry.
Rickey, F. (2022) · doi:10.31390/gradschool_disstheses.7772 · Cited by 414
The Projected Gradient Method for Least Squares Matrix Approximations with Spectral Constraints
Chu, M. T., & Driessel, K. R. (1990) · SIAM Journal on Numerical Analysis · doi:10.1137/0727062 · Cited by 145
Dynamical systems that perform the singular value decomposition
Smith, S. T. (1991) · Systems & Control Letters · doi:10.1016/0167-6911(91)90053-h · Cited by 33
Self-citationEigensystem Computation for Skew-Symmetric and a Class of Symmetric Matrices
Ward, R. C., & Gray, L. J. (1978) · ACM Transactions on Mathematical Software · doi:10.1145/355791.355798 · Cited by 31
Cited by
On-Manifold Preintegration for Real-Time Visual--Inertial Odometry
Forster, C., Carlone, L., Dellaert, F., & Scaramuzza, D. (2017) · IEEE Transactions on Robotics · doi:10.1109/tro.2016.2597321 · Cited by 1,502
A feasible method for optimization with orthogonality constraints
Wen, Z., & Yin, W. (2013) · Mathematical Programming · doi:10.1007/s10107-012-0584-1 · Cited by 849
IMU Preintegration on Manifold for Efficient Visual-Inertial Maximum-a-Posteriori Estimation
Forster, C., Carlone, L., Dellaert, F., & Scaramuzza, D. (2015) · Robotics: Science and Systems XI · doi:10.15607/rss.2015.xi.006 · Cited by 499
Low-Rank Matrix Completion by Riemannian Optimization
Vandereycken, B. (2013) · SIAM Journal on Optimization · doi:10.1137/110845768 · Cited by 491
Riemannian Geometry of Grassmann Manifolds with a View on Algorithmic Computation
Absil, P.-A., Mahony, R., & Sepulchre, R. (2004) · Acta Applicandae Mathematica · doi:10.1023/b:acap.0000013855.14971.91 · Cited by 393
Metadata
- Authors
- Smith, S.
- Venue
- Hamiltonian and Gradient Flows, Algorithms and Control
- Publisher
- American Mathematical Society
- Published
- 1995-05-02
- Pages
- 113-136
- OpenAlex
- W1923779967
- Cited by
- 258
- References
- 26
- Type
- other
- Language
- en
- Open access
- closed
About these checks
Registry, retraction, Cites and statistics results are computed, not judged, with one exception: a printed reference that no index lists is read once by a model before it counts as a citation error. Claims are extracted by a model and kept only when their quote appears verbatim in the text; each cited source is then checked, with a model’s help, for whether it says what the claim relies on. Those verdicts can be wrong — read the claim’s quote and the cited source before relying on one.
Statistics and arithmetic are recomputed, not judged.
Confidence bands are shown only for fields calibrated on our annotated test set. None is calibrated yet, so no band is shown.
What counts as a claim ›How we measure confidence ›How we check this ›
Are you an author, or do you see a problem with this page? Request a review
Data sources
Bibliographic data: Semantic Scholar, OpenAlex, Crossref.
Contains information from the Semantic Scholar Academic Graph Datasets, made available under the ODC Attribution License (ODC-BY 1.0).
Semantic Scholar’s data is described in: Kinney, R., et al. (2023). The Semantic Scholar Open Data Platform. arXiv:2301.10140.