Computing the least cone-constrained singular value of matrices
From MaRDI portal
Eigenvalues, singular values, and eigenvectors (15A18) Numerical computation of eigenvalues and eigenvectors of matrices (65F15) Numerical optimization and variational techniques (65K10) Nonconvex programming, global optimization (90C26) Nonlinear programming (90C30) Abstract computational complexity for mathematical programming problems (90C60)
Cites work
- A continuous characterization of the maximum-edge biclique problem
- Accelerating nonnegative matrix factorization algorithms using extrapolation
- Computability of global solutions to factorable nonconvex programs: Part I — Convex underestimating problems
- Computing a nearest symmetric positive semidefinite matrix
- Computing critical angles between two convex cones
- Cone-constrained singular value problems
- Critical angles between two convex cones. I: General theory
- Critical angles between two convex cones. II: Special cases
- Critical angles in polyhedral convex cones: Numerical and statistical considerations
- Non-Negative Principal Component Analysis: Message Passing Algorithms and Sharp Asymptotics
- On Nonlinear Fractional Programming
- On pairs of vectors achieving the maximal angle of a convex cone
- On the convergence of the block nonlinear Gauss-Seidel method under convex constraints
- On the maximal angle between copositive matrices
- Pareto singular values of Boolean matrices and analysis of bipartite graphs
- Projecting onto the Intersection of a Cone and a Sphere
- Singular value analysis of linear maps under conic constraints
- Singular value problems under nonnegativity constraints
- The angular spectrum of the 3 3 copositive cone
- The maximal angle between 5 5 positive semidefinite and 5 5 nonnegative matrices
This page was built for publication: Computing the least cone-constrained singular value of matrices
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q7293276)
