Matrix p-norms are NP-hard to approximate if p1,2,
From MaRDI portal
Publication:3079772
Recommendations
- Computing the norm ∥A∥∞,1 is NP-hard∗
- Geometric optimization problems likely not contained in \(\mathbb A\mathbb P\mathbb X\)
- Approximability of \(p\rightarrow q\) matrix norms: generalized Krivine rounding and hypercontractive hardness
- scientific article; zbMATH DE number 6783411
- Hardness of approximating the shortest vector problem in high \(\ell_{p}\) norms
Cited in
(62)- A novel low-cost method for generalized split inverse problem of finite family of demimetric mappings
- Dual Variable Inertial Accelerated Algorithm for Split System of Null Point Equality Problems
- New inertial method for generalized split variational inclusion problems
- Parallel proximal method of solving split system of fixed point set constraint minimization problems
- An iterative algorithm with inertial technique for solving the split common null point problem in Banach spaces
- Relaxed inertial methods for solving split variational inequality problems without product space formulation
- Alternated inertial algorithms for split feasibility problems
- A viscosity iterative technique for split variational inclusion and fixed point problems between a Hilbert space and a Banach space
- A self-adaptive projection method with an inertial technique for split feasibility problems in Banach spaces with applications to image restoration problems
- Convergence analysis for solving equilibrium problems and split feasibility problems in Hilbert spaces
- A new self-adaptive method for the multiple-sets split common null point problem in Banach spaces
- A Unifying Perron--Frobenius Theorem for Nonnegative Tensors via Multihomogeneous Maps
- Estimating the matrix p-norm
- Estimating \(L^\infty\) norms by \(L^{2k}\) norms for functions on orbits.
- New inertial relaxed method for solving split feasibilities
- Tensor norm and maximal singular vectors of nonnegative tensors -- a Perron-Frobenius theorem, a Collatz-Wielandt characterization and a generalized power method
- On the tensor spectral \(\mathbf{p}\)-norm and its higher order power method
- Moments tensors, Hilbert's identity, and \(k\)-wise uncorrelated random variables
- Nonlinear Perron--Frobenius Theorems for Nonnegative Tensors
- scientific article; zbMATH DE number 6783411 (Why is no real title available?)
- Strongly convergent inertial projection and contraction methods for split variational inequality problem
- Inertial accelerated steepest descent algorithm for generalized split common fixed point problems
- A survey of hidden convex optimization
- Dynamical technique for split common fixed point problem in Banach spaces
- Image restorations using a modified relaxed inertial technique for generalized split feasibility problems
- Halpern-type iterative process for solving split common fixed point and monotone variational inclusion problem between Banach spaces
- Error bounds and a condition number for the absolute value equations
- Tight computationally efficient approximation of matrix norms with applications
- Rigorous data‐driven computation of spectral properties of Koopman operators for dynamical systems
- An inertial self-adaptive algorithm for the generalized split common null point problem in Hilbert spaces
- A new self-adaptive accelerated method for generalized split system of common fixed-point problem of averaged mappings
- On split generalised mixed equilibrium problems and fixed-point problems with no prior knowledge of operator norm
- A new method for solving split variational inequality problems without co-coerciveness
- Viscosity self-adaptive method for generalized split system of variational inclusion problem
- The global convergence of the nonlinear power method for mixed-subordinate matrix norms
- An iterative method for split inclusion problems without prior knowledge of operator norms
- Proximal method of solving split system of minimization problem
- Inertial-viscosity-type algorithms for solving generalized equilibrium and fixed point problems in Hilbert spaces
- Grothendieck constant is norm of Strassen matrix multiplication tensor
- Inertial methods for finding minimum-norm solutions of the split variational inequality problem beyond monotonicity
- Pseudoergodic operators and periodic boundary conditions
- A simple strong convergent method for solving split common fixed point problems
- Computing the norm ∥A∥∞,1 is NP-hard∗
- A new viscosity-type iteration for a finite family of split variational inclusion and fixed point problems between Hilbert and Banach spaces
- An inertial extrapolation method for multiple-set split feasibility problem
- Nuclear norm of higher-order tensors
- Multiplier algebras of \(L^p\)-operator algebras
- Convergence analysis of an inertial accelerated iterative algorithm for solving split variational inequality problem
- Weak and strong convergence adaptive algorithms for generalized split common fixed point problems
- Polynomial norms
- Approximability of \(p\rightarrow q\) matrix norms: generalized Krivine rounding and hypercontractive hardness
- A modified contraction method for solving certain class of split monotone variational inclusion problems with application
- Global and linear convergence of alternated inertial methods for split feasibility problems
- A note on the Hausdorff distance between norm balls and their linear maps
- An inertial method for solving generalized split feasibility problems over the solution set of monotone variational inclusions
- Iterative methods for the split feasibility problem and the fixed point problem in Banach spaces
- A unified algorithm for solving split generalized mixed equilibrium problem, and for finding fixed point of nonspreading mapping in Hilbert spaces
- Stability analysis of linear delay systems via internally positive representations: an overview
- Convergence analysis for the proximal split feasibility problem using an inertial extrapolation term method
- scientific article; zbMATH DE number 7525859 (Why is no real title available?)
- Inapproximability of Matrix \(\boldsymbol{p \rightarrow q}\) Norms
- On low rank approximation of linear operators in \(p\)-norms and some algorithms
This page was built for publication: Matrix \(p\)-norms are NP-hard to approximate if \(p\neq1,2,\infty\)
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3079772)
