The following pages link to PDCO (Q17288):
Displaying 50 items.
- Sparse canonical correlation analysis (Q415611) (← links)
- Sparse Legendre expansions via \(\ell_1\)-minimization (Q420755) (← links)
- On the representation of functions with Gaussian wave packets (Q421207) (← links)
- Group coordinate descent algorithms for nonconvex penalized regression (Q425386) (← links)
- Sharp support recovery from noisy random measurements by \(\ell_1\)-minimization (Q427066) (← links)
- Two are better than one: fundamental parameters of frame coherence (Q427070) (← links)
- Matrix-free interior point method (Q429480) (← links)
- Coordinate ascent for penalized semiparametric regression on high-dimensional panel count data (Q429611) (← links)
- \(L^1\) regularization method in electrical impedance tomography by using the \(L^1\)-curve (Pareto frontier curve) (Q437855) (← links)
- Exact reconstruction using Beurling minimal extrapolation (Q441986) (← links)
- Convex feasibility modeling and projection methods for sparse signal recovery (Q442713) (← links)
- Degrees of freedom in lasso problems (Q447864) (← links)
- UPS delivers optimal phase diagram in high-dimensional variable selection (Q450021) (← links)
- Lagrangian-penalization algorithm for constrained optimization and variational inequalities (Q452269) (← links)
- Proximal methods for the latent group lasso penalty (Q457209) (← links)
- Discussion: Time-threshold maps: using information from wavelet reconstructions with all threshold values simultaneously (Q459479) (← links)
- Rejoinder: Time-threshold maps: using information from wavelet reconstructions with all threshold values simultaneously (Q459481) (← links)
- 2DPCA with L1-norm for simultaneously robust and sparse modelling (Q461155) (← links)
- An infeasible-point subgradient method using adaptive approximate projections (Q461434) (← links)
- A random coordinate descent algorithm for optimization problems with composite objective function and linear coupled constraints (Q461437) (← links)
- Iterative reweighted minimization methods for \(l_p\) regularized unconstrained nonlinear programming (Q463732) (← links)
- First-order optimality condition of basis pursuit denoise problem (Q469076) (← links)
- Robust face recognition via block sparse Bayesian learning (Q474521) (← links)
- Sparse time-frequency representation of nonlinear and nonstationary data (Q476519) (← links)
- A sharp nonasymptotic bound and phase diagram of \(L_{1/2}\) regularization (Q477827) (← links)
- A variable fixing version of the two-block nonlinear constrained Gauss-Seidel algorithm for \(\ell_1\)-regularized least-squares (Q480935) (← links)
- Sparse dual frames and dual Gabor functions of minimal time and frequency supports (Q485118) (← links)
- On higher order isotropy conditions and lower bounds for sparse quadratic forms (Q489163) (← links)
- High-dimensional inference in misspecified linear models (Q491406) (← links)
- A Barzilai-Borwein type method for minimizing composite functions (Q494671) (← links)
- Compressive sensing using chaotic sequence based on Chebyshev map (Q494825) (← links)
- Disjoint sparsity for signal separation and applications to hybrid inverse problems in medical imaging (Q504383) (← links)
- Incomplete variables truncated conjugate gradient method for signal reconstruction in compressed sensing (Q508757) (← links)
- Bayesian signal detection with compressed measurements (Q508772) (← links)
- On the solution uniqueness characterization in the L1 norm and polyhedral gauge recovery (Q511961) (← links)
- A modified greedy analysis pursuit algorithm for the cosparse analysis model (Q513670) (← links)
- Sparse decomposition by iterating Lipschitzian-type mappings (Q517031) (← links)
- Decomposition into low-rank plus additive matrices for background/foreground separation: a review for a comparative evaluation with a large-scale dataset (Q518124) (← links)
- Image reconstruction using analysis model prior (Q519588) (← links)
- Compressed sensing from a harmonic analysis point of view (Q519957) (← links)
- Data based identification and prediction of nonlinear and complex dynamical systems (Q521774) (← links)
- A coordinate gradient descent method for \(\ell_{1}\)-regularized convex minimization (Q535291) (← links)
- Surveying and comparing simultaneous sparse approximation (or group-lasso) algorithms (Q537241) (← links)
- Two-dimensional random projection (Q537260) (← links)
- Node harvest (Q542973) (← links)
- A non-adapted sparse approximation of PDEs with stochastic inputs (Q543721) (← links)
- Randomization of data acquisition and \(\ell_{1}\)-optimization (recognition with compression) (Q544714) (← links)
- Compressive wave computation (Q544804) (← links)
- Evolution strategies based adaptive \(L_{p}\) LS-SVM (Q545383) (← links)
- Estimation of (near) low-rank matrices with noise and high-dimensional scaling (Q548547) (← links)
