On generalizing trace minimization principles
From MaRDI portal
Publication:2093530
positive definite matrixeigenvalueeigenvectorlinear response eigenvalue problemBrockett cost functionsymplectic eigenvalue problemtrace minimization principle
Quadratic programming (90C20) Eigenvalues, singular values, and eigenvectors (15A18) Numerical computation of eigenvalues and eigenvectors of matrices (65F15) Nonconvex programming, global optimization (90C26) Determinants, permanents, traces, other special matrix functions (15A15) Matrix pencils (15A22)
Recommendations
- Trace minimization principles for positive semi-definite pencils
- Symplectic eigenvalues of positive-semidefinite matrices and the trace minimization theorem
- Minimization Principles for the Linear Response Eigenvalue Problem I: Theory
- Computing symplectic eigenpairs of symmetric positive-definite matrices via trace minimization and Riemannian optimization
- Minimization principles and computation for the generalized linear response eigenvalue problem
Cites work
- scientific article; zbMATH DE number 47363 (Why is no real title available?)
- scientific article; zbMATH DE number 1049347 (Why is no real title available?)
- scientific article; zbMATH DE number 1049353 (Why is no real title available?)
- scientific article; zbMATH DE number 6125590 (Why is no real title available?)
- scientific article; zbMATH DE number 5223994 (Why is no real title available?)
- scientific article; zbMATH DE number 967931 (Why is no real title available?)
- scientific article; zbMATH DE number 2237400 (Why is no real title available?)
- scientific article; zbMATH DE number 3061616 (Why is no real title available?)
- A Jacobi eigenreduction algorithm for definite matrix pairs
- A Trace Minimization Algorithm for the Generalized Eigenvalue Problem
- A block inverse-free preconditioned Krylov subspace method for symmetric generalized eigenvalue problems
- Accuracy of computed eigenvectors via optimizing a Rayleigh quotient
- An Inverse Free Preconditioned Krylov Subspace Method for Symmetric Generalized Eigenvalue Problems
- Damped oscillations of linear systems. A mathematical introduction
- Dynamical systems that sort lists, diagonalize matrices, and solve linear programming problems
- Fast Algorithms for the Generalized Foley–Sammon Discriminant Analysis
- First order optimality conditions and steepest descent algorithm on orthogonal Stiefel manifolds
- LAPACK Users' Guide
- Linear dimensionality reduction: survey, insights, and generalizations
- Linear response eigenvalue problem solved by extended locally optimal preconditioned conjugate gradient methods
- Maximization of the sum of the trace ratio on the Stiefel manifold. I: Theory
- Maximization of the sum of the trace ratio on the Stiefel manifold. II: computation
- Minimization Principles for the Linear Response Eigenvalue Problem I: Theory
- Minimization principles and computation for the generalized linear response eigenvalue problem
- Minimization principles for the linear response eigenvalue problem. II: Computation
- On symplectic eigenvalues of positive definite matrices
- Orthogonal canonical correlation analysis and applications
- Parallel implementations of the trace minimization scheme trace{min} for the sparse symmetric eigenvalue problem
- Perturbation bounds for Williamson's symplectic normal form
- Preconditioned gradient iterations for the eigenproblem of definite matrix pairs
- Quadratic optimization with orthogonality constraint: explicit Łojasiewicz exponent and linear convergence of retraction-based line-search and stochastic variance-reduced gradient methods
- Rayleigh quotient based optimization methods for eigenvalue problems
- Superlinear convergence of a general algorithm for the generalized Foley-Sammon discriminant analysis
- Templates for the Solution of Algebraic Eigenvalue Problems
- The symmetry group of Gaussian states in \({L}^{2}({\mathbb{R}}^{n})\)
- The trace ratio optimization problem for dimensionality reduction
- Toward the optimal preconditioned eigensolver: Locally optimal block preconditioned conjugate gradient method
- Trace minimization and definiteness of symmetric pencils
- Trace minimization principles for positive semi-definite pencils
- Trace optimization and eigenproblems in dimension reduction methods.
- Vibrational states of nuclei in the random phase approximation
Cited in
(11)- Trace minimization principles for positive semi-definite pencils
- An optimal endpoint trace embedding
- scientific article; zbMATH DE number 936308 (Why is no real title available?)
- Spectrally constrained optimization
- Optimization on the symplectic Stiefel manifold: SR decomposition-based retraction and applications
- An NPDo approach for principal joint block diagonalization
- A theory of the NEPv approach for optimization on the Stiefel manifold
- New properties of a special matrix related to positive-definite matrices
- Mining CSTNUDs significant for a set of traces is polynomial
- Trace-penalty minimization for large-scale eigenspace computation
- On generalizing trace minimization principles. II
This page was built for publication: On generalizing trace minimization principles
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2093530)
