Fast feasibility pursuit for non-convex QCQPS via first-order methods

Keyphrases

• First-order Methods 100%
• Nonconvex 100%
• Via-first 100%
• Non-convex QCQP 50%
• Engineering Design 50%
• NP-hard 50%
• Memory Requirements 50%
• Beamforming 50%
• State Estimation 50%
• Quadratically Constrained Quadratic Programming 50%
• Quadratic Programming 50%
• Engineering Application 50%
• Low Memory 50%
• Computational Requirements 50%
• Low Computational 50%
• Large-scale Problems 50%
• Polynomial-time Approximation Algorithm 50%
• Problem Instances 50%
• Nonconvex Quadratically Constrained Quadratic Programming 50%

Computer Science

• Quadratic Programming 100%
• Feasible Point 100%
• Approximation Algorithms 50%
• Large-Scale Problem 50%
• Problem Instance 50%
• Polynomial Time 50%
• State Estimation 50%
• Memory Requirement 50%