A Geometric Newton Method for Oja's Vector Field

DOI10.1162/NECO.2008.04-08-749zbMATH Open1186.65062arXiv0804.0989OpenAlexW3105926974WikidataQ46238872 ScholiaQ46238872MaRDI QIDQ3628017FDOQ3628017

Authors: P.-A. Absil, Mariya Ishteva, Lieven De Lathauwer, Sabine Van Huffel 

Publication date: 19 May 2009

Published in: Neural Computation (Search for Journal in Brave)

Abstract: Newton's method for solving the matrix equation $F(X)equivAX-X{X}^{T}AX=0$ runs up against the fact that its zeros are not isolated. This is due to a symmetry of $F$ by the action of the orthogonal group. We show how differential-geometric techniques can be exploited to remove this symmetry and obtain a ``geometric Newton algorithm that finds the zeros of $F$. The geometric Newton method does not suffer from the degeneracy issue that stands in the way of the original Newton method.

Full work available at URL: https://arxiv.org/abs/0804.0989

Recommendations

• Newton's methods from a geometric point of view
• Newton's method for approximating zeros of vector fields on Riemannian manifolds
• Newton's method, zeroes of vector fields, and the Riemannian center of mass
• A unifying local convergence result for Newton's method in Riemannian manifolds
• Optimization algorithms on the Grassmann manifold with application to matrix eigenvalue problems

zbMATH Keywords

numerical experimentsmatrix equationssuperlinear convergencegeometric Newton methodOja's flowdegenerate zeros

Mathematics Subject Classification ID

Numerical computation of solutions to systems of equations (65H10) Matrix equations and identities (15A24)

Cites Work

• Title not available (Why is that?)
• Title not available (Why is that?)
• On the largest principal angle between random subspaces
• The Geometry of Algorithms with Orthogonality Constraints
• Newton's method on Riemannian manifolds and a geometric model for the human spine
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• A simplified neuron model as a principal component analyzer
• Choosing the Forcing Terms in an Inexact Newton Method
• Trust Region Algorithms and Timestep Selection
• Riemannian geometry of Grassmann manifolds with a view on algorithmic computation
• Adaptive eigenvalue computations using Newton's method on the Grassmann manifold
• Cubically Convergent Iterations for Invariant Subspace Computation
• Analysis of a class of continuous-time algorithms for principal component analysis and subspace tracking
• Pseudo-Transient Continuation for Nonsmooth Nonlinear Equations
• A dual purpose principal and minor component flow
• Stability and Convergence of Principal Component Learning Algorithms

Cited In (8)

• Solving PhaseLift by Low-Rank Riemannian Optimization Methods for Complex Semidefinite Constraints
• A generalized geometric spectral conjugate gradient algorithm for finding zero of a monotone tangent vector field on a constant curvature Hadamard manifold
• Quotient geometry with simple geodesics for the manifold of fixed-rank positive-semidefinite matrices
• Restricted Riemannian geometry for positive semidefinite matrices
• A Riemannian nonmonotone spectral method for self-adjoint tangent vector field
• Computing laser beam paths in optical cavities: an approach based on geometric Newton method
• A Riemannian derivative-free Polak-Ribiére-Polyak method for tangent vector field
• Grassmann algorithms for low rank approximation of matrices with missing values

This page was built for publication: A Geometric Newton Method for Oja's Vector Field

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3628017)