The following pages link to PDCO (Q17288):
Displaying 50 items.
- Adaptive algorithms for sparse system identification (Q553728) (← links)
- A Bayesian lasso via reversible-jump MCMC (Q553732) (← links)
- Source localization using a sparse representation framework to achieve superresolution (Q600881) (← links)
- Learning gradients on manifolds (Q605040) (← links)
- Approximation accuracy, gradient methods, and error bound for structured convex optimization (Q607498) (← links)
- The Gelfand widths of \(\ell_p\)-balls for \(0 < p \leq 1\) (Q609740) (← links)
- Adaptive Dantzig density estimation (Q629798) (← links)
- Exact optimization for the \(\ell ^{1}\)-compressive sensing problem using a modified Dantzig-Wolfe method (Q630594) (← links)
- The solution path of the generalized lasso (Q638794) (← links)
- A unified primal-dual algorithm framework based on Bregman iteration (Q639393) (← links)
- Beyond sparsity: the role of \(L_{1}\)-optimizer in pattern classification (Q650959) (← links)
- The sparse Laplacian shrinkage estimator for high-dimensional regression (Q651021) (← links)
- Bias-variance trade-off for prequential model list selection (Q657069) (← links)
- Analysis of convergence for the alternating direction method applied to joint sparse recovery (Q668704) (← links)
- A pseudo-heuristic parameter selection rule for \(l^1\)-regularized minimization problems (Q679565) (← links)
- Support recovery for sparse super-resolution of positive measures (Q682872) (← links)
- Spectral dynamics and regularization of incompletely and irregularly measured data (Q691305) (← links)
- High-dimensional regression with noisy and missing data: provable guarantees with nonconvexity (Q693741) (← links)
- Projected Landweber iteration for matrix completion (Q708281) (← links)
- Nonparametric denoising of signals of unknown local structure. II: Nonparametric function recovery (Q711050) (← links)
- L1Packv2: A Mathematica package for minimizing an \(\ell _{1}\)-penalized functional (Q711066) (← links)
- CMB data analysis and sparsity (Q713846) (← links)
- New methods for fitting multiple sinusoids from irregularly sampled data (Q713855) (← links)
- Processing MUSE hyperspectral data: denoising, deconvolution and detection of astrophysical sources (Q713913) (← links)
- On the size of incoherent systems (Q719361) (← links)
- Regularization of geophysical ill-posed problems by iteratively re-weighted and refined least squares (Q722775) (← links)
- New augmented Lagrangian-based proximal point algorithm for convex optimization with equality constraints (Q727234) (← links)
- Enhancing \(\ell_1\)-minimization estimates of polynomial chaos expansions using basis selection (Q729190) (← links)
- Enhancing sparsity of Hermite polynomial expansions by iterative rotations (Q729367) (← links)
- Sparsity preserving projections with applications to face recognition (Q733184) (← links)
- Sparse regression using mixed norms (Q734328) (← links)
- Iterative thresholding for sparse approximations (Q734940) (← links)
- Analysis of basis pursuit via capacity sets (Q734943) (← links)
- Enhancing sparsity by reweighted \(\ell _{1}\) minimization (Q734955) (← links)
- Robust penalized quantile regression estimation for panel data (Q736536) (← links)
- Compressive sampling and rapid reconstruction of broadband frequency hopping signals with interference (Q736865) (← links)
- New cyclic sparsity measures for deconvolution based on convex relaxation (Q736973) (← links)
- Sparse recovery via differential inclusions (Q739470) (← links)
- On the identifiability of overcomplete dictionaries via the minimisation principle underlying K-SVD (Q741264) (← links)
- Fast global convergence of gradient methods for high-dimensional statistical recovery (Q741793) (← links)
- Algorithms for nonnegative matrix and tensor factorizations: a unified view based on block coordinate descent framework (Q742122) (← links)
- Customized proximal point algorithms for linearly constrained convex minimization and saddle-point problems: a unified approach (Q742299) (← links)
- A constrained optimization reformulation and a feasible descent direction method for \(L_{1/2}\) regularization (Q742307) (← links)
- Matrix-free interior point method for compressed sensing problems (Q744215) (← links)
- Limited-memory LDL\(^{\top}\) factorization of symmetric quasi-definite matrices with application to constrained optimization (Q745223) (← links)
- Compression and denoising using \(l _{0}\)-norm (Q763401) (← links)
- The \(\ell_{2,q}\) regularized group sparse optimization: lower bound theory, recovery bound and algorithms (Q778013) (← links)
- Preserving injectivity under subgaussian mappings and its application to compressed sensing (Q778017) (← links)
- Theoretical guarantees for graph sparse coding (Q778037) (← links)
- Generalized ADMM with optimal indefinite proximal term for linearly constrained convex optimization (Q781096) (← links)
