The following pages link to PDCO (Q17288):
Displaying 50 items.
- Regularized vector field learning with sparse approximation for mismatch removal (Q75781) (← links)
- Stochastic expansions using continuous dictionaries: Lévy adaptive regression kernels (Q98918) (← links)
- A unified approach to model selection and sparse recovery using regularized least squares (Q117370) (← links)
- Estimator selection in the Gaussian setting (Q141397) (← links)
- A modified local quadratic approximation algorithm for penalized optimization problems (Q147630) (← links)
- A modified Hestenes and Stiefel conjugate gradient algorithm for large-scale nonsmooth minimizations and nonlinear equations (Q255074) (← links)
- Nomonotone spectral gradient method for sparse recovery (Q256063) (← links)
- Strong convergence of a modified proximal algorithm for solving the lasso (Q262321) (← links)
- Combining a relaxed EM algorithm with Occam's razor for Bayesian variable selection in high-dimensional regression (Q268752) (← links)
- Computing and analyzing recoverable supports for sparse reconstruction (Q269197) (← links)
- Simultaneous image fusion and demosaicing via compressive sensing (Q269715) (← links)
- Optimal sampling points in reproducing kernel Hilbert spaces (Q272199) (← links)
- New properties of forward-backward splitting and a practical proximal-descent algorithm (Q274940) (← links)
- Regularity properties for sparse regression (Q279682) (← links)
- Best subset selection via a modern optimization lens (Q282479) (← links)
- Data-driven atomic decomposition via frequency extraction of intrinsic mode functions (Q284448) (← links)
- Inducing wavelets into random fields via generative boosting (Q285524) (← links)
- Iterative methods for solving the multiple-sets split feasibility problem with splitting self-adaptive step size (Q288176) (← links)
- Statistical consistency of coefficient-based conditional quantile regression (Q290691) (← links)
- Forecasting using a large number of predictors: is Bayesian shrinkage a valid alternative to principal components? (Q299225) (← links)
- Phase retrieval from Gabor measurements (Q301574) (← links)
- Nonlinear residual minimization by iteratively reweighted least squares (Q301685) (← links)
- A proximal method for composite minimization (Q304260) (← links)
- Projection algorithms for nonconvex minimization with application to sparse principal component analysis (Q312468) (← links)
- A dual method for minimizing a nonsmooth objective over one smooth inequality constraint (Q312667) (← links)
- Conjugate gradient acceleration of iteratively re-weighted least squares methods (Q316180) (← links)
- Sparse high-dimensional FFT based on rank-1 lattice sampling (Q326763) (← links)
- Image denoising by generalized total variation regularization and least squares fidelity (Q336037) (← links)
- Revisiting compressed sensing: exploiting the efficiency of simplex and sparsification methods (Q340007) (← links)
- Block coordinate proximal gradient methods with variable Bregman functions for nonsmooth separable optimization (Q344922) (← links)
- A weighted \(\ell_1\)-minimization approach for sparse polynomial chaos expansions (Q349012) (← links)
- Compressive sampling of polynomial chaos expansions: convergence analysis and sampling strategies (Q349724) (← links)
- Gradient methods for minimizing composite functions (Q359630) (← links)
- The essential ability of sparse reconstruction of different compressive sensing strategies (Q362190) (← links)
- Sparse microwave imaging: principles and applications (Q362310) (← links)
- Spectral intrinsic decomposition method for adaptive signal representation (Q363183) (← links)
- Oracle inequalities for the lasso in the Cox model (Q366963) (← links)
- Accelerated Bregman method for linearly constrained \(\ell _1-\ell _2\) minimization (Q368088) (← links)
- ParNes: A rapidly convergent algorithm for accurate recovery of sparse and approximately sparse signals (Q372857) (← links)
- On constrained and regularized high-dimensional regression (Q380022) (← links)
- On exact recovery of sparse vectors from linear measurements (Q382361) (← links)
- Theory of compressive sensing via \(\ell_1\)-minimization: a non-RIP analysis and extensions (Q384215) (← links)
- Feature selection when there are many influential features (Q396025) (← links)
- Remote sensing via \(\ell_1\)-minimization (Q404256) (← links)
- Sharp recovery bounds for convex demixing, with applications (Q404302) (← links)
- Robust visual tracking with structured sparse representation appearance model (Q408075) (← links)
- Model-based multiple rigid object detection and registration in unstructured range data (Q408868) (← links)
- Restricted isometries for partial random circulant matrices (Q412402) (← links)
- Multi-scale geometric methods for data sets. II: Geometric multi-resolution analysis (Q413654) (← links)
- Sparse conjugate directions pursuit with application to fixed-size kernel models (Q413891) (← links)
