Pages that link to "Item:Q3096890"

The following pages link to Concave programming for finding sparse solutions to problems with convex constraints (Q3096890):

Displaying 12 items.

• The non-convex sparse problem with nonnegative constraint for signal reconstruction (Q328467) (← links)
• Restricted normal cones and sparsity optimization with affine constraints (Q404252) (← links)
• Dynamic programming with convexity, concavity and sparsity (Q1190452) (← links)
• Tree-sparse convex programs (Q1812288) (← links)
• Dual-density-based reweighted \(\ell_1\)-algorithms for a class of \(\ell_0\)-minimization problems (Q2052391) (← links)
• A smoothing method for sparse optimization over convex sets (Q2191281) (← links)
• Solving \(\ell_0\)-penalized problems with simple constraints via the Frank-Wolfe reduced dimension method (Q2257078) (← links)
• DC Approximation Approach for ℓ0-minimization in Compressed Sensing (Q2808067) (← links)
• Algorithms for Sparsity-Constrained Optimization (Q2849653) (← links)
• Constructing New Weighted <i>ℓ</i>₁-Algorithms for the Sparsest Points of Polyhedral Sets (Q2976140) (← links)
• Algorithm 813 (Q5461003) (← links)
• Sparse convex optimization toolkit: a mixed-integer framework (Q6087059) (← links)