Pages that link to "Item:Q3655588"

The following pages link to Iteratively reweighted least squares minimization for sparse recovery (Q3655588):

Displaying 50 items.

• Primal and dual model representations in kernel-based learning (Q1950324) (← links)
• Sparse signal inversion with impulsive noise by dual spectral projected gradient method (Q1992541) (← links)
• Auto-weighted multi-view co-clustering with bipartite graphs (Q1999151) (← links)
• Rapid compressed sensing reconstruction: a semi-tensor product approach (Q1999186) (← links)
• Efficient regularized regression with \(L_0\) penalty for variable selection and network construction (Q2011726) (← links)
• Numerical identification of a sparse Robin coefficient (Q2017606) (← links)
• Effective two-stage image segmentation: a new non-Lipschitz decomposition approach with convergent algorithm (Q2031758) (← links)
• New regularization method and iteratively reweighted algorithm for sparse vector recovery (Q2033724) (← links)
• Iterative Potts minimization for the recovery of signals with discontinuities from indirect measurements: the multivariate case (Q2040452) (← links)
• A Laplacian approach to \(\ell_1\)-norm minimization (Q2044482) (← links)
• Nonconvex and nonsmooth sparse optimization via adaptively iterative reweighted methods (Q2052389) (← links)
• An adaptation for iterative structured matrix completion (Q2072669) (← links)
• Conditionally exponential prior in focal near- and far-field EEG source localization via randomized multiresolution scanning (RAMUS) (Q2103867) (← links)
• On the stability of projection-based model order reduction for convection-dominated laminar and turbulent flows (Q2125450) (← links)
• Douglas-Rachford splitting and ADMM for nonconvex optimization: accelerated and Newton-type linesearch algorithms (Q2141355) (← links)
• Sequential image recovery from noisy and under-sampled Fourier data (Q2149043) (← links)
• Iteratively reweighted least squares and slime mold dynamics: connection and convergence (Q2149565) (← links)
• Adaptive regularised kernel-based identification method for large-scale systems with unknown order (Q2158994) (← links)
• An interior stochastic gradient method for a class of non-Lipschitz optimization problems (Q2161545) (← links)
• Screening for a reweighted penalized conditional gradient method (Q2165597) (← links)
• A relaxed Kačanov iteration for the \(p\)-Poisson problem (Q2184726) (← links)
• Matrix completion with nonconvex regularization: spectral operators and scalable algorithms (Q2195855) (← links)
• Phase retrieval: a data-driven wavelet frame based approach (Q2197956) (← links)
• Fast overcomplete dictionary construction with probabilistic guarantees (Q2198175) (← links)
• Effective zero-norm minimization algorithms for noisy compressed sensing (Q2198627) (← links)
• Stability of 1-bit compressed sensing in sparse data reconstruction (Q2217038) (← links)
• Mathematical programs with complementarity constraints and a non-Lipschitz objective: optimality and approximation (Q2220667) (← links)
• Convergence and stability analysis of iteratively reweighted least squares for noisy block sparse recovery (Q2238869) (← links)
• A reweighted nuclear norm minimization algorithm for low rank matrix recovery (Q2252420) (← links)
• Weiszfeld's method: old and new results (Q2260646) (← links)
• Iterative re-weighted least squares algorithm for \(l_p\)-minimization with tight frame and \(0 < p \leq 1\) (Q2273889) (← links)
• On the computation of sparse solutions to the controllability problem for discrete-time linear systems (Q2275285) (← links)
• A simple Gaussian measurement bound for exact recovery of block-sparse signals (Q2320652) (← links)
• Optimal RIP bounds for sparse signals recovery via \(\ell_p\) minimization (Q2330928) (← links)
• Rank-one and sparse matrix decomposition for dynamic MRI (Q2353466) (← links)
• A smoothing iterative method for quantile regression with nonconvex \(\ell_p\) penalty (Q2358473) (← links)
• Convergence and stability of iteratively reweighted least squares for low-rank matrix recovery (Q2360780) (← links)
• Global sensitivity analysis based on high-dimensional sparse surrogate construction (Q2363869) (← links)
• Variational image colorization models using higher-order Mumford-Shah regularizers (Q2399207) (← links)
• Error bounds for compressed sensing algorithms with group sparsity: A unified approach (Q2399645) (← links)
• Maximum entropy vector kernels for MIMO system identification (Q2409365) (← links)
• A resilient domain decomposition polynomial chaos solver for uncertain elliptic PDEs (Q2414430) (← links)
• Model identification of a network as compressing sensing (Q2434442) (← links)
• A superlinearly convergent \(R\)-regularized Newton scheme for variational models with concave sparsity-promoting priors (Q2436684) (← links)
• Greedy-like algorithms for the cosparse analysis model (Q2437331) (← links)
• Robust multi-image processing with optimal sparse regularization (Q2515365) (← links)
• Efficient nonsmooth nonconvex optimization for image restoration and segmentation (Q2515532) (← links)
• Nonconvex sorted \(\ell_1\) minimization for sparse approximation (Q2516375) (← links)
• Smoothing strategy along with conjugate gradient algorithm for signal reconstruction (Q2660684) (← links)
• Multi-competitive viruses over time-varying networks with mutations and human awareness (Q2662294) (← links)