Pages that link to "Item:Q1288881"
From MaRDI portal
The following pages link to Greedy algorithms and \(M\)-term approximation with regard to redundant dictionaries (Q1288881):
Displaying 28 items.
- Convex optimization on Banach spaces (Q285434) (← links)
- Convergence and rate of convergence of some greedy algorithms in convex optimization (Q338510) (← links)
- Sparse approximation is provably hard under coherent dictionaries (Q340554) (← links)
- Reweighted \(\ell_1\) minimization method for stochastic elliptic differential equations (Q347862) (← links)
- Greedy expansions in convex optimization (Q483395) (← links)
- Vector greedy algorithms (Q652444) (← links)
- Adaptive martingale approximations (Q734947) (← links)
- Well-posedness of convex maximization problems on Stiefel manifolds and orthogonal tensor product approximations (Q967579) (← links)
- Sparse signal representation by adaptive non-uniform B-spline dictionaries on a compact interval (Q985567) (← links)
- The best \(m\)-term approximation and greedy algorithms (Q1127004) (← links)
- Nonlinear approximation in finite-dimensional spaces (Q1383443) (← links)
- Cardinal B-spline dictionaries on a compact interval (Q1780699) (← links)
- Super greedy type algorithms (Q1928073) (← links)
- Analysis of the self projected matching pursuit algorithm (Q2005321) (← links)
- A note on the hardness of sparse approximation (Q2444766) (← links)
- Adaptive algorithms of nonlinear approximation with finite terms (Q2463809) (← links)
- Low rank Tucker-type tensor approximation to classical potentials (Q2464684) (← links)
- Tensor-product approximation to operators and functions in high dimensions (Q2465299) (← links)
- Simultaneous approximation by greedy algorithms (Q2498388) (← links)
- The best \(M\)-term trigonometric approximations of the classes of periodic multivariate functions with bounded generalized derivative in the space \(L_q\) (Q2628616) (← links)
- On Lebesgue-type inequalities for greedy approximation (Q2643860) (← links)
- Sparse approximation based on a random overcomplete basis (Q3302727) (← links)
- Decomposition of functions into pairs of intrinsic mode functions (Q3560318) (← links)
- (Q4471300) (← links)
- Nonlinear $N$-term approximation by refinable functions (Q4675548) (← links)
- SOTT: Greedy Approximation of a Tensor as a Sum of Tensor Trains (Q5065504) (← links)
- Numerical Computation for Orthogonal Low-Rank Approximation of Tensors (Q5237898) (← links)
- Greedy algorithms and best \(m\)-term approximation with respect to biorthogonal systems (Q5943952) (← links)