On selecting a maximum volume sub-matrix of a matrix and related problems
From MaRDI portal
(Redirected from Publication:1034598)
Recommendations
- Exponential inapproximability of selecting a maximum volume sub-matrix
- Rectangular maximum-volume submatrices and their applications
- Submatrix maximum queries in Monge matrices and partial Monge matrices, and their applications
- Submatrix maximum queries in Monge matrices and Monge partial matrices, and their applications
- On maximum volume submatrices and cross approximation for symmetric semidefinite and diagonally dominant matrices
- Subspace Selection for Projection Maximization With Matroid Constraints
- A note on subset selection for matrices
- The maximal-volume concept in approximation by low-rank matrices
- Improved submatrix maximum queries in Monge matrices
- On a variant of the problem of choosing a vector subset
Cites work
- scientific article; zbMATH DE number 3571502 (Why is no real title available?)
- scientific article; zbMATH DE number 3639144 (Why is no real title available?)
- scientific article; zbMATH DE number 961607 (Why is no real title available?)
- Adaptive Sampling and Fast Low-Rank Matrix Approximation
- Bounds on singular values revealed by QR factorizations
- Efficient Algorithms for Computing a Strong Rank-Revealing QR Factorization
- Factoring polynomials with rational coefficients
- Fast Monte Carlo Algorithms for Matrices II: Computing a Low-Rank Approximation to a Matrix
- Fast Monte Carlo Algorithms for Matrices III: Computing a Compressed Approximate Matrix Decomposition
- Fast monte-carlo algorithms for finding low-rank approximations
- Handbook series linear algebra. Linear least squares solutions by Householder transformations
- Matrix approximation and projective clustering via volume sampling
- Numerical Linear Algebra
- On Rank-Revealing Factorisations
- On the existence and computation of rank-revealing LU factorizations
- Rang revealing QR factorizations
- Rank-Revealing QR Factorizations and the Singular Value Decomposition
- Subset selection for matrices
- The maximal-volume concept in approximation by low-rank matrices
Cited in
(43)- A Local Search Framework for Experimental Design
- Low-Rank Approximation in the Frobenius Norm by Column and Row Subset Selection
- An efficient frequency-independent numerical method for computing the far-field pattern induced by polygonal obstacles
- Some algorithms for maximum volume and cross approximation of symmetric semidefinite matrices
- Column subset selection problem is UG-hard
- Near-optimal discrete optimization for experimental design: a regret minimization approach
- Near-optimal polynomial interpolation on spherical triangles
- Polynomial fitting and interpolation on circular sections
- Fixed-size determinantal point processes sampling for species phylogeny
- Compression of Multivariate Discrete Measures and Applications
- Efficient preconditioning for noisy separable nonnegative matrix factorization problems by successive projection based low-rank approximations
- Simpler is better: a comparative study of randomized pivoting algorithms for CUR and interpolative decompositions
- Revisiting the (block) Jacobi subspace rotation method for the symmetric eigenvalue problem
- Column subset selection is NP-complete
- Proportional volume sampling and approximation algorithms for \(A\)-optimal design
- Linear equalities in blackbox optimization
- On the Use of Compressed Polyhedral Quadrature Formulas in Embedded Interface Methods
- CUR LRA at Sublinear Cost Based on Volume Maximization
- Diversity sampling is an implicit regularization for kernel methods
- Gaussian process landmarking on manifolds
- Spectral tensor-train decomposition
- Mode-wise tensor decompositions: multi-dimensional generalizations of CUR decompositions
- scientific article; zbMATH DE number 5054719 (Why is no real title available?)
- Maximal volume matrix cross approximation for image compression and least squares solution
- Tensor-train numerical integration of multivariate functions with singularities
- Subdeterminant maximization via nonconvex relaxations and anti-concentration
- Beyond symmetry: best submatrix selection for the sparse truncated SVD
- Subset selection for matrices with fixed blocks
- A hybrid stochastic interpolation and compression method for kernel matrices
- Polynomial interpolation and cubature over polygons
- SAGA: sparse and geometry-aware non-negative matrix factorization through non-linear local embedding
- Literature survey on low rank approximation of matrices
- A Spectral Approach to Network Design
- On the complexity of approximating extremal determinants in matrices
- Geometric weakly admissible meshes, discrete least squares approximations and approximate Fekete points
- Convergence of sparse variational inference in Gaussian processes regression
- Polynomial time \(\rho\)-locally maximum volume search
- On maximum volume submatrices and cross approximation for symmetric semidefinite and diagonally dominant matrices
- Some Inapproximability Results of MAP Inference and Exponentiated Determinantal Point Processes
- Matrices with hierarchical low-rank structures
- On the parameterized intractability of determinant maximization
- A robust and scalable implementation of the Parks-McClellan algorithm for designing FIR filters
- Exponential inapproximability of selecting a maximum volume sub-matrix
This page was built for publication: On selecting a maximum volume sub-matrix of a matrix and related problems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1034598)
