Fast Approximation Algorithms for a Class of Non-convex QCQP Problems Using First-Order Methods

Keyphrases

• First-order Methods 100%
• Quadratic Programming 100%
• Nonconvex Quadratically Constrained Quadratic Programming 100%
• Fast Approximation Algorithms 100%
• Performance-complexity Tradeoff 66%
• High Performance 33%
• Nonsmooth 33%
• Approximation Algorithms 33%
• NP-hard 33%
• Convex Approximation 33%
• Quadratically Constrained Quadratic Programming 33%
• Existing State 33%
• Multicast Beamforming 33%
• Convex Set 33%
• High Complexity 33%
• Approximation Strategy 33%

Engineering

• Quadratic Programming Problem 100%
• Engineering 33%
• Bridging 33%
• Good Performance 33%
• Subproblem 33%
• Maximization 33%
• Convex Set 33%
• Beamforming 33%

Computer Science

• Approximation Algorithms 100%
• Quadratic Programming 100%
• Approximation (Algorithm) 25%
• Lower Performance 25%
• Multicasting 25%
• Good Performance 25%