scientific article; zbMATH DE number 7307468
From MaRDI portal
Publication:5149225
No author found.
Publication date: 8 February 2021
Full work available at URL: https://arxiv.org/abs/1906.02435
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
orthogonal groupfixed point algorithmmeasure concentration\(\ell^4\)-norm maximizationparse dictionary learning
Related Items (4)
Pursuit of a discriminative representation for multiple subspaces via sequential games ⋮ A high-order norm-product regularized multiple kernel learning framework for kernel optimization ⋮ A novel dictionary learning method based on total least squares approach with application in high dimensional biological data ⋮ Weakly Convex Optimization over Stiefel Manifold Using Riemannian Subgradient-Type Methods
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Convex multi-task feature learning
- Implicit regularization in nonconvex statistical estimation: gradient descent converges linearly for phase retrieval, matrix completion, and blind deconvolution
- Stochastic subgradient method converges on tame functions
- Dynamic programming and suboptimal control: a survey from ADP to MPC
- Sparse Modeling for Image and Vision Processing
- Generalized power method for sparse principal component analysis
- Projection-like Retractions on Matrix Manifolds
- Dictionary Learning and Tensor Decomposition via the Sum-of-Squares Method
- Complete Dictionary Recovery Over the Sphere II: Recovery by Riemannian Trust-Region Method
- Learning Sparsely Used Overcomplete Dictionaries via Alternating Minimization
- Guaranteed Minimum-Rank Solutions of Linear Matrix Equations via Nuclear Norm Minimization
- Some NP-complete problems in quadratic and nonlinear programming
- A note on a theorem of Stanton-Weinstein on the L4-norm of spherical harmonics
- On the L4 norm of spherical harmonics
- Jacobi’s Method is More Accurate than QR
- The Geometry of Algorithms with Orthogonality Constraints
- New Perturbation Bounds for the Unitary Polar Factor
- Sparsifying Transform Learning With Efficient Optimal Updates and Convergence Guarantees
- $rm K$-SVD: An Algorithm for Designing Overcomplete Dictionaries for Sparse Representation
- High-Dimensional Statistics
- Sparse Approximate Solutions to Linear Systems
- Nonconvex Optimization Meets Low-Rank Matrix Factorization: An Overview
- Lie Groups, Lie Algebras, and Representations
- Image Super-Resolution Via Sparse Representation
- For most large underdetermined systems of linear equations the minimal 𝓁1‐norm solution is also the sparsest solution
- Discrete-time signal processing. An algebraic approach
This page was built for publication:
