Pages that link to "Item:Q3655588"

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

Displaying 50 items.

• Adaptive identification of linear systems subject to Gross errors (Q259441) (← links)
• Nonlinear residual minimization by iteratively reweighted least squares (Q301685) (← links)
• A smoothing SQP framework for a class of composite \(L_q\) minimization over polyhedron (Q304258) (← links)
• Conjugate gradient acceleration of iteratively re-weighted least squares methods (Q316180) (← links)
• Restoration of manifold-valued images by half-quadratic minimization (Q326374) (← links)
• Sparse microwave imaging: principles and applications (Q362310) (← links)
• Recovery of sparsest signals via \(\ell^q \)-minimization (Q413642) (← links)
• On the representation of functions with Gaussian wave packets (Q421207) (← links)
• Iterative reweighted minimization methods for \(l_p\) regularized unconstrained nonlinear programming (Q463732) (← links)
• Stable recovery of sparse signals via \(\ell_p\)-minimization (Q466983) (← links)
• Compressed sensing with coherent tight frames via \(l_q\)-minimization for \(0 < q \leq 1\) (Q479885) (← links)
• Equivalence and strong equivalence between the sparsest and least \(\ell _1\)-norm nonnegative solutions of linear systems and their applications (Q489110) (← links)
• Sparse and nonnegative sparse D-MORPH regression (Q498497) (← links)
• GAITA: a Gauss-Seidel iterative thresholding algorithm for \(\ell_q\) regularized least squares regression (Q515771) (← links)
• Iteration complexity analysis of block coordinate descent methods (Q526831) (← links)
• Nonconvex nonsmooth optimization via convex-nonconvex majorization-minimization (Q530079) (← links)
• Observability for initial value problems with sparse initial data (Q533508) (← links)
• Surveying and comparing simultaneous sparse approximation (or group-lasso) algorithms (Q537241) (← links)
• A new fast multiphase image segmentation algorithm based on nonconvex regularizer (Q645869) (← links)
• A pseudo-heuristic parameter selection rule for \(l^1\)-regularized minimization problems (Q679565) (← links)
• A convergent overlapping domain decomposition method for total variation minimization (Q711582) (← links)
• Regularization of geophysical ill-posed problems by iteratively re-weighted and refined least squares (Q722775) (← links)
• On the identifiability of overcomplete dictionaries via the minimisation principle underlying K-SVD (Q741264) (← links)
• The \(\ell_{2,q}\) regularized group sparse optimization: lower bound theory, recovery bound and algorithms (Q778013) (← links)
• Iterative reweighted total generalized variation based Poisson noise removal model (Q907547) (← links)
• Sparse recovery by non-convex optimization - instance optimality (Q984656) (← links)
• Global optimality condition and fixed point continuation algorithm for non-Lipschitz \(\ell_p\) regularized matrix minimization (Q1650690) (← links)
• Speckle noise reduction via nonconvex high total variation approach (Q1666177) (← links)
• PROMP: a sparse recovery approach to lattice-valued signals (Q1669069) (← links)
• Computation of time optimal control problems governed by linear ordinary differential equations (Q1685498) (← links)
• Conjugate gradient based acceleration for inverse problems (Q1686866) (← links)
• A generalized elastic net regularization with smoothed \(\ell _{q}\) penalty for sparse vector recovery (Q1687319) (← links)
• Analysis of the equivalence relationship between \(l_{0}\)-minimization and \(l_{p}\)-minimization (Q1688516) (← links)
• \(\ell _p\) regularized low-rank approximation via iterative reweighted singular value minimization (Q1694395) (← links)
• Affine matrix rank minimization problem via non-convex fraction function penalty (Q1696454) (← links)
• Robust fitting of ellipsoids by separating interior and exterior points during optimization (Q1702591) (← links)
• Recovery of signals under the condition on RIC and ROC via prior support information (Q1713645) (← links)
• An iterative support shrinking algorithm for non-Lipschitz optimization in image restoration (Q1716780) (← links)
• Bound alternative direction optimization for image deblurring (Q1717868) (← links)
• A new piecewise quadratic approximation approach for \(L_0\) norm minimization problem (Q1729942) (← links)
• Global convergence of ADMM in nonconvex nonsmooth optimization (Q1736880) (← links)
• Reducing effects of bad data using variance based joint sparsity recovery (Q1736886) (← links)
• Sparse signal recovery with prior information by iterative reweighted least squares algorithm (Q1746492) (← links)
• Solving structured nonsmooth convex optimization with complexity \(\mathcal {O}(\varepsilon ^{-1/2})\) (Q1752352) (← links)
• Iterative reweighted methods for \(\ell _1-\ell _p\) minimization (Q1753073) (← links)
• Broken adaptive ridge regression and its asymptotic properties (Q1795597) (← links)
• \(L_q\)-closest-point to affine subspaces using the generalized Weiszfeld algorithm (Q1799963) (← links)
• 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)