Pages that link to "Item:Q3547718"
From MaRDI portal
The following pages link to Just relax: convex programming methods for identifying sparse signals in noise (Q3547718):
Displaying 50 items.
- A unified approach to model selection and sparse recovery using regularized least squares (Q117370) (← links)
- Nearly unbiased variable selection under minimax concave penalty (Q117379) (← links)
- Locally sparse reconstruction using the \(\ell^{1,\infty}\)-norm (Q256102) (← links)
- Best subset selection via a modern optimization lens (Q282479) (← links)
- Relationship between the optimal solutions of least squares regularized with \(\ell_{0}\)-norm and constrained by \(k\)-sparsity (Q285544) (← links)
- Data-driven design of two degree-of-freedom nonlinear controllers: the \(\operatorname{D}^2\)-IBC approach (Q311883) (← links)
- Matrix sparsification and the sparse null space problem (Q329287) (← links)
- Regularity properties of non-negative sparsity sets (Q342902) (← links)
- Gradient methods for minimizing composite functions (Q359630) (← links)
- Recovery of high-dimensional sparse signals via \(\ell_1\)-minimization (Q364458) (← links)
- ParNes: A rapidly convergent algorithm for accurate recovery of sparse and approximately sparse signals (Q372857) (← links)
- Model-based multiple rigid object detection and registration in unstructured range data (Q408868) (← links)
- The residual method for regularizing ill-posed problems (Q425458) (← 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)
- A modified greedy analysis pursuit algorithm for the cosparse analysis model (Q513670) (← links)
- Sparse signal recovery using a new class of random matrices (Q520894) (← links)
- Tightness of the maximum likelihood semidefinite relaxation for angular synchronization (Q526833) (← links)
- Convergence of fixed-point continuation algorithms for matrix rank minimization (Q535287) (← links)
- A coordinate gradient descent method for \(\ell_{1}\)-regularized convex minimization (Q535291) (← links)
- Fixed point and Bregman iterative methods for matrix rank minimization (Q543413) (← links)
- A semidefinite programming study of the Elfving theorem (Q546096) (← links)
- Adaptive algorithms for sparse system identification (Q553728) (← links)
- Approximation accuracy, gradient methods, and error bound for structured convex optimization (Q607498) (← links)
- Dualization of signal recovery problems (Q618873) (← links)
- Exact optimization for the \(\ell ^{1}\)-compressive sensing problem using a modified Dantzig-Wolfe method (Q630594) (← links)
- Autoregressive process modeling via the Lasso procedure (Q631620) (← links)
- On verifiable sufficient conditions for sparse signal recovery via \(\ell_{1}\) minimization (Q633105) (← links)
- Direct data domain STAP using sparse representation of clutter spectrum (Q634042) (← links)
- Registration-based compensation using sparse representation in conformal-array STAP (Q635051) (← links)
- Solve exactly an under determined linear system by minimizing least squares regularized with an \(\ell_0\) penalty (Q650854) (← links)
- A necessary and sufficient condition for exact sparse recovery by \(\ell_1\) minimization (Q664941) (← links)
- Inferring stable genetic networks from steady-state data (Q665132) (← links)
- Optimal identification experiment design for LPV systems using the local approach (Q680530) (← links)
- Spectral dynamics and regularization of incompletely and irregularly measured data (Q691305) (← links)
- Regularized learning in Banach spaces as an optimization problem: representer theorems (Q693135) (← links)
- Iterative thresholding for sparse approximations (Q734940) (← links)
- Atoms of all channels, unite! Average case analysis of multi-channel sparse recovery using greedy algorithms (Q734954) (← links)
- Enhancing sparsity by reweighted \(\ell _{1}\) minimization (Q734955) (← links)
- Theoretical guarantees for graph sparse coding (Q778037) (← links)
- Minimizers of sparsity regularized Huber loss function (Q831370) (← links)
- High-dimensional variable selection (Q834336) (← links)
- High-dimensional analysis of semidefinite relaxations for sparse principal components (Q834367) (← links)
- Non-convex sparse regularisation (Q847742) (← links)
- A primal dual active set with continuation algorithm for the \(\ell^0\)-regularized optimization problem (Q890462) (← links)
- Optimal dual certificates for noise robustness bounds in compressive sensing (Q892815) (← links)
- On the conditioning of random subdictionaries (Q930731) (← links)
- Sparse approximate solution of partial differential equations (Q972312) (← links)
- High-dimensional Ising model selection using \(\ell _{1}\)-regularized logistic regression (Q973867) (← links)
- When do stepwise algorithms meet subset selection criteria? (Q995431) (← links)
