An Õ(m/ε^3.5)-Cost Algorithm for Semidefinite Programs with Diagonal Constraints

Keyphrases

• Semidefinite Programming 100%
• Diagonal Constraints 100%
• Kale 66%
• Exact Computation 66%
• Mirror Descent 66%
• Fasting Time 33%
• Cost Matrix 33%
• Approximation Ratio 33%
• Max-cut Problem 33%
• Accumulative Error 33%
• Matrix Variable 33%
• First-order Algorithm 33%
• Variance-reduced 33%

Mathematics

• Diagonal 100%
• Edge 50%
• Variance 50%
• Matrix 50%
• Approximates 50%
• Cost Matrix 50%
• Max-Cut 50%
• Nonzero Entry 50%

Computer Science

• Approximation Ratio 100%