A smoothing SQP framework for a class of composite L_q minimization over polyhedron

Keyphrases

• Polyhedron 100%
• 1-minimization 100%
• Optimality Conditions 66%
• General Polyhedron 66%
• Worst-case Iteration Complexity 66%
• Machine Learning 33%
• Wireless Communication 33%
• Minimization Problem 33%
• Approximate Solution 33%
• Signal Reconstruction 33%
• Convex Quadratic Program 33%
• Sequential Quadratic Programming 33%
• Image Reconstruction 33%
• Programming Framework 33%
• Local Minimizer 33%
• Complexity Guarantees 33%

Computer Science

• Optimality Condition 100%
• Sequential Quadratic Programming 100%
• Wireless Communication 50%
• Signal Reconstruction 50%
• Programming Framework 50%
• Image Restoration 50%
• Approximate Solution 50%
• Minimization Problem 50%
• Theoretical Study 50%
• Feasible Point 50%
• Machine Learning 50%
• Learning System 50%

Mathematics

• Polyhedron 100%
• Sequential Quadratic Programming 100%
• Optimality 66%
• Worst Case 66%
• Quadratic Programming 33%
• Local Minimizer 33%
• Feasible Point 33%
• Minimization Problem 33%
• Approximate Solution 33%