scientific article; zbMATH DE number 6783411

MaRDI QIDQ5365059zbMATH OpenFDO

Authors Aditya Bhaskara, Aravindan Vijayaraghavan

Publication date 29 September 2017

Full work available at URL http://dl.acm.org/citation.cfm?id=2133076

Mathematics Subject Classification ID

Norms of matrices, numerical range, applications of functional analysis to matrix theory (15A60) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Approximation algorithms (68W25) Nonconvex programming, global optimization (90C26)

Recommendations

• Estimating the matrix p-norm
• scientific article; zbMATH DE number 89042
• Tight computationally efficient approximation of matrix norms with applications
• Inapproximability of Matrix \(\boldsymbol{p \rightarrow q}\) Norms
• Towards a new bound for a matrix norm
• Matrix p-norms are NP-hard to approximate if p1,2,
• On generalized matrix approximation problem in the spectral norm
• scientific article; zbMATH DE number 4201485
• scientific article; zbMATH DE number 994544

Cited in

(30)

• On matrix approximation problems with Ky Fan \(k\) norms
• From matrix to vector Padé approximants
• The global convergence of the nonlinear power method for mixed-subordinate matrix norms
• A p-spherical section property for matrix Schatten-p quasi-norm minimization
• Norms of random submatrices and sparse approximation
• On generalized matrix approximation problem in the spectral norm
• Complexity and nonlinear semidefinite programming reformulation of \(\ell_1\)-constrained nonconvex quadratic optimization
• Smoothness of Schatten norms and sliding-window matrix streams
• On low rank approximation of linear operators in p-norms and some algorithms
• Towards a new bound for a matrix norm
• Tensor norm and maximal singular vectors of nonnegative tensors -- a Perron-Frobenius theorem, a Collatz-Wielandt characterization and a generalized power method
• Matrix p-norms are NP-hard to approximate if p1,2,
• Online learning to rank with top-k feedback
• Approximability of the problem of finding a vector subset with the longest sum
• On sketching the \(q\) to \(p\) norms
• Approximability of \(p\rightarrow q\) matrix norms: generalized Krivine rounding and hypercontractive hardness
• Moments tensors, Hilbert's identity, and \(k\)-wise uncorrelated random variables
• Hardness and Approximation Results for L_p-Ball Constrained Homogeneous Polynomial Optimization Problems
• Inapproximability of Matrix \(\boldsymbol{p \rightarrow q}\) Norms
• Complexity and algorithms for finding a subset of vectors with the longest sum
• A note on error bounds for pseudo skeleton approximations of matrices
• A note on the Hausdorff distance between norm balls and their linear maps
• The Yakubovich S-Lemma Revisited: Stability and Contractivity in Non-Euclidean Norms
• On the maximal hyperplane in \(\ell_p^n\)
• Regular pairings for nonquadratic Lyapunov functions and contraction analysis
• The generalized matrix norm problem
• Estimating the matrix p q norm
• On \(r\)-to-\(p\) norms of random matrices with nonnegative entries: asymptotic normality and \(\ell_{\infty}\)-bounds for the maximizer
• Generic properties and a criterion of an operator norm
• Randomized oblivious integral routing for minimizing power cost

This page was built for publication:

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