Pages that link to "Item:Q2706429"

The following pages link to Atomic decomposition by basis pursuit (Q2706429):

Displaying 50 items.

• On the equivalence of inexact proximal ALM and ADMM for a class of convex composite programming (Q2220656) (← links)
• An adaptive primal-dual framework for nonsmooth convex minimization (Q2220901) (← links)
• A look at robustness and stability of \(\ell_1\)-versus \(\ell_0\)-regularization: discussion of papers by Bertsimas et al. and Hastie et al. (Q2225318) (← links)
• A linearized Peaceman-Rachford splitting method for structured convex optimization with application to stable principal component pursuit (Q2227311) (← links)
• A perturbation view of level-set methods for convex optimization (Q2228385) (← links)
• On the linear convergence rates of exchange and continuous methods for total variation minimization (Q2235147) (← links)
• Frank-Wolfe and friends: a journey into projection-free first-order optimization methods (Q2240671) (← links)
• A noise-robust online convolutional coding model and its applications to Poisson denoising and image fusion (Q2242520) (← links)
• Learning with tensors: a framework based on convex optimization and spectral regularization (Q2251466) (← links)
• Geometric separation by single-pass alternating thresholding (Q2252176) (← links)
• Fast thresholding algorithms with feedbacks for sparse signal recovery (Q2252504) (← links)
• Sparse recovery with coherent tight frames via analysis Dantzig selector and analysis LASSO (Q2252508) (← links)
• Solving \(\ell_0\)-penalized problems with simple constraints via the Frank-Wolfe reduced dimension method (Q2257078) (← links)
• Embedded feature-selection support vector machine for driving pattern recognition (Q2263641) (← links)
• A prediction-correction-based primal-dual hybrid gradient method for linearly constrained convex minimization (Q2274166) (← links)
• On convex envelopes and regularization of non-convex functionals without moving global minima (Q2275270) (← links)
• Super-resolution by means of Beurling minimal extrapolation (Q2278456) (← links)
• A new smoothed L0 regularization approach for sparse signal recovery (Q2298142) (← links)
• A conjugate direction based simplicial decomposition framework for solving a specific class of dense convex quadratic programs (Q2301138) (← links)
• Changepoint detection by the quantile Lasso method (Q2301226) (← links)
• Divide and conquer: an incremental sparsity promoting compressive sampling approach for polynomial chaos expansions (Q2309799) (← links)
• A note on block-sparse signal recovery with coherent tight frames (Q2312304) (← links)
• Optimal subgradient methods: computational properties for large-scale linear inverse problems (Q2315075) (← links)
• Detecting edges from non-uniform Fourier data via sparse Bayesian learning (Q2316239) (← links)
• Implementation of interior-point methods for LP based on Krylov subspace iterative solvers with inner-iteration preconditioning (Q2322556) (← links)
• Generalized high-dimensional trace regression via nuclear norm regularization (Q2323374) (← links)
• Sampling and reconstruction of sparse signals on circulant graphs. An introduction to graph-FRI (Q2330927) (← links)
• On model selection consistency of regularized M-estimators (Q2340872) (← links)
• Projected shrinkage algorithm for box-constrained \(\ell _1\)-minimization (Q2361128) (← links)
• Global sensitivity analysis based on high-dimensional sparse surrogate construction (Q2363869) (← links)
• Generalized sparse recovery model and its neural dynamical optimization method for compressed sensing (Q2411691) (← links)
• A nonconvex model with minimax concave penalty for image restoration (Q2420696) (← links)
• A simple homotopy proximal mapping algorithm for compressive sensing (Q2425244) (← links)
• A near-optimal sampling strategy for sparse recovery of polynomial chaos expansions (Q2425261) (← links)
• A superlinearly convergent \(R\)-regularized Newton scheme for variational models with concave sparsity-promoting priors (Q2436684) (← links)
• Aggregation for Gaussian regression (Q2456016) (← links)
• Coordinate and subspace optimization methods for linear least squares with non-quadratic regularization (Q2465768) (← links)
• Sparsity- and continuity-promoting seismic image recovery with curvelet frames (Q2476269) (← links)
• Portfolio optimization with linear and fixed transaction costs (Q2480252) (← links)
• On the uniqueness of overcomplete dictionaries, and a practical way to retrieve them (Q2497239) (← links)
• Data representations and generalization error in kernel based learning machines (Q2498650) (← links)
• High-dimensional graphs and variable selection with the Lasso (Q2500458) (← links)
• Linearized alternating directions method for \(\ell_1\)-norm inequality constrained \(\ell_1\)-norm minimization (Q2509909) (← links)
• Denoising for multiple image copies through joint sparse representation (Q2513316) (← links)
• Maximin effects in inhomogeneous large-scale data (Q2515497) (← links)
• A wavelet-based hybrid approach to estimate variance function in heteroscedastic regression models (Q2516632) (← links)
• The Moreau envelope based efficient first-order methods for sparse recovery (Q2628357) (← links)
• Large sparse signal recovery by conjugate gradient algorithm based on smoothing technique (Q2629501) (← links)
• A customized proximal point algorithm for convex minimization with linear constraints (Q2636606) (← links)
• Example-based single document image super-resolution: a global MAP approach with outlier rejection (Q2642486) (← links)