Constructing new weighted l₁-algorithms for the sparsest points of polyhedral sets

Keyphrases

• Polyhedral Set 100%
• Sparse Point 100%
• L0 Minimization 66%
• L1 Method 66%
• Image Processing 33%
• Signal Processing 33%
• Sparsity 33%
• Numerical Linear Algebra 33%
• Minimization Problem 33%
• Linear Programming 33%
• Convex Optimization 33%
• Dual Problem 33%
• Slack Variables 33%
• Numerical Performance 33%
• Mathematical Optimization 33%
• Strict Complementarity 33%
• Dual Space 33%
• Empirical Simulation 33%
• Complementarity Theory 33%
• Challenging Problems 33%
• Performance Guarantee 33%
• Weighted ℓ1 Minimization 33%

Mathematics

• Polyhedral Set 100%
• Numerical Linear Algebra 33%
• Slack Variable 33%
• Dual Space 33%
• Minimization Problem 33%
• Image Processing 33%
• Dual Problem 33%
• Linear Program 33%
• Signal Processing 33%