Pages that link to "Item:Q3558672"

The following pages link to Probing the Pareto Frontier for Basis Pursuit Solutions (Q3558672):

Displaying 50 items.

• SPGL1 (Q20374) (← links)
• Iterative choice of the optimal regularization parameter in TV image restoration (Q256109) (← links)
• Easy implementation of advanced tomography algorithms using the ASTRA toolbox with spot operators (Q261875) (← links)
• Algorithms that satisfy a stopping criterion, probably (Q269806) (← links)
• A smoothing SQP framework for a class of composite \(L_q\) minimization over polyhedron (Q304258) (← links)
• Fast projection onto the simplex and the \(l_1\) ball (Q304269) (← 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)
• An efficient projection method for nonlinear inverse problems with sparsity constraints (Q326410) (← links)
• Sparse high-dimensional FFT based on rank-1 lattice sampling (Q326763) (← links)
• Quantifying initial and wind forcing uncertainties in the gulf of Mexico (Q341542) (← links)
• Reweighted \(\ell_1\) minimization method for stochastic elliptic differential equations (Q347862) (← 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)
• Sparse microwave imaging: principles and applications (Q362310) (← 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 the representation of functions with Gaussian wave packets (Q421207) (← links)
• \(L^1\) regularization method in electrical impedance tomography by using the \(L^1\)-curve (Pareto frontier curve) (Q437855) (← links)
• Alternating direction method of multipliers for sparse principal component analysis (Q457552) (← links)
• Iterative reweighted minimization methods for \(l_p\) regularized unconstrained nonlinear programming (Q463732) (← links)
• Guaranteed clustering and biclustering via semidefinite programming (Q463740) (← links)
• First-order optimality condition of basis pursuit denoise problem (Q469076) (← links)
• Nonmonotone Barzilai-Borwein gradient algorithm for \(\ell_1\)-regularized nonsmooth minimization in compressive sensing (Q474971) (← links)
• Decomposition into low-rank plus additive matrices for background/foreground separation: a review for a comparative evaluation with a large-scale dataset (Q518124) (← links)
• Convergence of fixed-point continuation algorithms for matrix rank minimization (Q535287) (← links)
• Two-dimensional random projection (Q537260) (← links)
• Non-smooth equations based method for \(\ell_1\)-norm problems with applications to compressed sensing (Q540241) (← links)
• Fixed point and Bregman iterative methods for matrix rank minimization (Q543413) (← links)
• A non-adapted sparse approximation of PDEs with stochastic inputs (Q543721) (← links)
• Dualization of signal recovery problems (Q618873) (← links)
• Phase transitions for greedy sparse approximation algorithms (Q629259) (← links)
• A pseudo-heuristic parameter selection rule for \(l^1\)-regularized minimization problems (Q679565) (← links)
• Numerical methods for \(A\)-optimal designs with a sparsity constraint for ill-posed inverse problems (Q694600) (← links)
• Projected Landweber iteration for matrix completion (Q708281) (← links)
• New augmented Lagrangian-based proximal point algorithm for convex optimization with equality constraints (Q727234) (← links)
• Enhancing \(\ell_1\)-minimization estimates of polynomial chaos expansions using basis selection (Q729190) (← links)
• Enhancing sparsity of Hermite polynomial expansions by iterative rotations (Q729367) (← links)
• GPU accelerated greedy algorithms for compressed sensing (Q744210) (← links)
• Matrix-free interior point method for compressed sensing problems (Q744215) (← links)
• Sparse representation based two-dimensional direction of arrival estimation using co-prime array (Q784506) (← links)
• Optimal dual certificates for noise robustness bounds in compressive sensing (Q892815) (← links)
• Sampling in the analysis transform domain (Q900778) (← links)
• Sparse approximate solution of partial differential equations (Q972312) (← links)
• Infinite-dimensional compressed sensing and function interpolation (Q1656376) (← links)
• A regularized semi-smooth Newton method with projection steps for composite convex programs (Q1668726) (← links)
• Generalized Kalman smoothing: modeling and algorithms (Q1678609) (← links)
• The matrix splitting based proximal fixed-point algorithms for quadratically constrained \(\ell_{1}\) minimization and Dantzig selector (Q1686207) (← links)
• The smoothing FR conjugate gradient method for solving a kind of nonsmooth optimization problem with \(l_1\)-norm (Q1721133) (← links)
• Nonmonotone adaptive Barzilai-Borwein gradient algorithm for compressed sensing (Q1724067) (← links)