Pages that link to "Item:Q3225227"

The following pages link to Sparse Optimization with Least-Squares Constraints (Q3225227):

Displaying 30 items.

• SPGL1 (Q20374) (← links)
• Relationship between the optimal solutions of least squares regularized with \(\ell_{0}\)-norm and constrained by \(k\)-sparsity (Q285544) (← links)
• Level-set methods for convex optimization (Q1739042) (← links)
• Iterative algorithms for total variation-like reconstructions in seismic tomography (Q1761418) (← links)
• Learning ``best'' kernels from data in Gaussian process regression. With application to aerodynamics (Q2083686) (← links)
• Convex optimization under combinatorial sparsity constraints (Q2102824) (← links)
• Gradient projection Newton pursuit for sparsity constrained optimization (Q2168680) (← links)
• Isotropic sparse regularization for spherical harmonic representations of random fields on the sphere (Q2175023) (← links)
• A hybrid quasi-Newton projected-gradient method with application to lasso and basis-pursuit denoising (Q2175442) (← links)
• Generation of nested quadrature rules for generic weight functions via numerical optimization: application to sparse grids (Q2222671) (← links)
• A perturbation view of level-set methods for convex optimization (Q2228385) (← links)
• Convergence and stability analysis of iteratively reweighted least squares for noisy block sparse recovery (Q2238869) (← links)
• Energy preserved sampling for compressed sensing MRI (Q2262538) (← links)
• Nonsmooth sparsity constrained optimization problems: optimality conditions (Q2311196) (← links)
• Reconstruction of jointly sparse vectors via manifold optimization (Q2311804) (← links)
• Convergence and stability of iteratively reweighted least squares for low-rank matrix recovery (Q2360780) (← links)
• Efficient block-coordinate descent algorithms for the group Lasso (Q2392933) (← links)
• Penalty decomposition methods for rank minimization (Q2943834) (← links)
• On optimal solutions of the constrained <i>ℓ</i> ₀ regularization and its penalty problem (Q2965692) (← links)
• Numerical Integration in Multiple Dimensions with Designed Quadrature (Q3174765) (← links)
• (Q4558524) (← links)
• A Level-Set Method for Convex Optimization with a Feasible Solution Path (Q4562247) (← links)
• On Efficiently Solving the Subproblems of a Level-Set Method for Fused Lasso Problems (Q4571884) (← links)
• Noisy Euclidean Distance Realization: Robust Facial Reduction and the Pareto Frontier (Q4588863) (← links)
• Calibration of reduced-order model for a coupled Burgers equations based on PC-EnKF (Q4615575) (← links)
• Spherical Designs and Nonconvex Minimization for Recovery of Sparse Signals on the Sphere (Q4689765) (← links)
• (Q5053310) (← links)
• Accelerating Sparse Recovery by Reducing Chatter (Q5143291) (← links)
• Group SLOPE – Adaptive Selection of Groups of Predictors (Q5229924) (← links)
• The Alternating Descent Conditional Gradient Method for Sparse Inverse Problems (Q5737722) (← links)