The Geometry of Algorithms with Orthogonality Constraints
From MaRDI portal
Publication:4243507
DOI10.1137/S0895479895290954zbMath0928.65050arXivphysics/9806030OpenAlexW2045512849MaRDI QIDQ4243507
Alan Edelman, Steven T. Smith, T. A. Arias
Publication date: 18 May 1999
Published in: SIAM Journal on Matrix Analysis and Applications (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/physics/9806030
algorithmsnonlinear eigenvalue problemNewton methodconjugate gradient methodsorthogonality constraintssymmetric eigenproblemGrassmann and Stiefel manifolds
Related Items (only showing first 100 items - show all)
On the largest principal angle between random subspaces ⋮ Introduction to face recognition and evaluation of algorithm performance ⋮ Convergence rate analysis for the higher order power method in best rank one approximations of tensors ⋮ A Dai-Yuan-type Riemannian conjugate gradient method with the weak Wolfe conditions ⋮ Bayesian point estimation of the cointegration space ⋮ MM algorithms for distance covariance based sufficient dimension reduction and sufficient variable selection ⋮ Orthogonal dual graph-regularized nonnegative matrix factorization for co-clustering ⋮ Monotonicity on homogeneous spaces ⋮ Parametric domain decomposition for accurate reduced order models: applications of MP-LROM methodology ⋮ On extremum properties of orthogonal quotients matrices ⋮ Nonlinear mean shift over Riemannian manifolds ⋮ Intrinsic statistics on Riemannian manifolds: Basic tools for geometric measurements ⋮ Enlargement of monotone vector fields and an inexact proximal point method for variational inequalities in Hadamard manifolds ⋮ Integrators on homogeneous spaces: isotropy choice and connections ⋮ Interpretable domain adaptation via optimization over the Stiefel manifold ⋮ Preserving geometric properties of the exponential matrix by block Krylov subspace methods ⋮ A bound on Grassmannian codes ⋮ Sufficient dimension reduction constrained through sub-populations ⋮ Non-monotone algorithm for minimization on arbitrary domains with applications to large-scale orthogonal Procrustes problem ⋮ Interpolation on symmetric spaces via the generalized polar decomposition ⋮ Kähler structures on spaces of framed curves ⋮ Principal components: a descent algorithm ⋮ Universal duality in conic convex optimization ⋮ Sums of random symmetric matrices and quadratic optimization under orthogonality constraints ⋮ Transfer learning in heterogeneous collaborative filtering domains ⋮ Rotation averaging ⋮ Linearized alternating direction method with adaptive penalty and warm starts for fast solving transform invariant low-rank textures ⋮ Simultaneous modelling of the Cholesky decomposition of several covariance matrices ⋮ Efficient rank reduction of correlation matrices ⋮ Convergence of inexact inverse iteration with application to preconditioned iterative solvers ⋮ Manifold relaxations for integer programming ⋮ The use of bulk states to accelerate the band edge state calculation of a semiconductor quantum dot ⋮ Non-parametric methods for \({\mathcal L}_2\)-gain estimation using iterative experiments ⋮ Impacts of high dimensionality in finite samples ⋮ Independent component analysis by wavelets ⋮ Optimization algorithms on the Grassmann manifold with application to matrix eigenvalue problems ⋮ Coordinate-independent sparse sufficient dimension reduction and variable selection ⋮ Nonmonotone algorithm for minimization on closed sets with applications to minimization on Stiefel manifolds ⋮ Model-based multiple rigid object detection and registration in unstructured range data ⋮ The continuous-time Rayleigh quotient flow on the sphere ⋮ Hessian operators on constraint manifolds ⋮ 3-dimensional flutter kinematic structural stability ⋮ Convergence of Newton's method for sections on Riemannian manifolds ⋮ A solution of the affine quadratic inverse eigenvalue problem ⋮ Model-driven domain adaptation on product manifolds for unconstrained face recognition ⋮ Fast local reduced basis updates for the efficient reduction of nonlinear systems with hyper-reduction ⋮ Multiway spectral clustering: a margin-based perspective ⋮ A structure preserving approximation method for Hamiltonian exponential matrices ⋮ Fisher lecture: Dimension reduction in regression ⋮ On the consistency of coordinate-independent sparse estimation with BIC ⋮ A kernel-based framework to tensorial data analysis ⋮ A splitting method for orthogonality constrained problems ⋮ On the computation of spherical designs by a new optimization approach based on fast spherical Fourier transforms ⋮ Geometric mean and geodesic regression on Grassmannians ⋮ Auto-regressive moving-average discrete-time dynamical systems and autocorrelation functions on real-valued Riemannian matrix manifolds ⋮ Newton's method for sections on Riemannian manifolds: Generalized covariant \(\alpha \)-theory ⋮ A new discriminant subspace analysis approach for multi-class problems ⋮ \(l_p\)-recovery of the most significant subspace among multiple subspaces with outliers ⋮ Properly discontinuous actions on Hilbert manifolds ⋮ A feasible filter method for the nearest low-rank correlation matrix problem ⋮ Tensor networks and hierarchical tensors for the solution of high-dimensional partial differential equations ⋮ Augmented Lagrangians with constrained subproblems and convergence to second-order stationary points ⋮ Reduced-rank multi-label classification ⋮ Decomposition into low-rank plus additive matrices for background/foreground separation: a review for a comparative evaluation with a large-scale dataset ⋮ Computing several eigenpairs of Hermitian problems by conjugate gradient iterations ⋮ Homogeneity analysis using absolute deviations ⋮ Projected gradient approach to the numerical solution of the SCoTLASS ⋮ Effective and efficient Grassfinch kernel for SVM classification and its application to recognition based on image set ⋮ Intrinsic representation of tangent vectors and vector transports on matrix manifolds ⋮ Well-posedness of convex maximization problems on Stiefel manifolds and orthogonal tensor product approximations ⋮ Semidefinite programming for discrete optimization and matrix completion problems ⋮ Effective parameters determining the information flow in hierarchical biological systems ⋮ Intrinsic inference on the mean geodesic of planar shapes and tree discrimination by leaf growth ⋮ Neural learning by geometric integration of reduced `rigid-body' equations ⋮ A note on fast envelope estimation ⋮ A feasible method for optimization with orthogonality constraints ⋮ Numerical implementation of complex orthogonalization, parallel transport on Stiefel bundles, and analyticity ⋮ Geodesics in infinite dimensional Stiefel and Grassmann manifolds ⋮ Machine learning problems from optimization perspective ⋮ On the topology and geometry of spaces of affine shapes ⋮ Riemannian Newton method for positive bounded Hessian functions ⋮ A modified Casteljau algorithm to solve interpolation problems on Stiefel manifolds ⋮ Inference for eigenvalues and eigenvectors of Gaussian symmetric matrices ⋮ Existence of solutions for variational inequalities on Riemannian manifolds ⋮ Descent methods for optimization on homogeneous manifolds ⋮ A time-varying Newton algorithm for adaptive subspace tracking ⋮ Machine learning with squared-loss mutual information ⋮ DINDSCAL: direct INDSCAL ⋮ A globally and quadratically convergent algorithm with efficient implementation for unconstrained optimization ⋮ A framework of constraint preserving update schemes for optimization on Stiefel manifold ⋮ Consistency of restricted maximum likelihood estimators of principal components ⋮ Estimation in a linear multivariate measurement error model with a change point in the data ⋮ Smale's point estimate theory for Newton's method on Lie groups ⋮ Differential-geometric Newton method for the best rank-\((R _{1}, R _{2}, R _{3})\) approximation of tensors ⋮ Primal central paths and Riemannian distances for convex sets ⋮ Conjugate gradient algorithm for optimization under unitary matrix constraint ⋮ Rigorous restricted isometry property of low-dimensional subspaces ⋮ Means for fixed rank PSD matrices ⋮ Kantorovich's theorem on Newton's method in Riemannian manifolds ⋮ The multimode Procrustes problem
Uses Software
This page was built for publication: The Geometry of Algorithms with Orthogonality Constraints
