Sparse approximation via penalty decomposition methods

Keyphrases

• Sparse Approximation 100%
• Accumulation Points 100%
• Penalty Decomposition Method 100%
• Nonconvex 50%
• First-order Optimality Condition 50%
• Block Coordinate Descent 50%
• Local Minimizer 50%
• Minimization Problem 25%
• Compressed Sensing 25%
• Computational Results 25%
• Cardinality 25%
• Approximation Problem 25%
• Solution Quality 25%
• L0 Minimization 25%
• Sparse Logistic Regression 25%
• L0 Norm 25%
• Sparse Inverse Covariance Selection 25%
• Block-coordinate 25%

Mathematics

• Decomposition Method 100%
• Accumulation Point 100%
• Subproblem 75%
• Local Minimizer 50%
• Optimality Condition 50%
• Objective Function 25%
• Approximation Problem 25%
• Logistic Regression 25%
• Covariance 25%
• Minimization Problem 25%
• Cardinality 25%
• Constraint Function 25%