Distributed Non-Convex First-Order Optimization and Information Processing: Lower Complexity Bounds and Rate Optimal Algorithms

Keyphrases

• Information Processing 100%
• Nonconvex 100%
• Low Dose Rate 100%
• Optimal Algorithm 100%
• Nonconvex Optimization 100%
• Optimization Processing 100%
• First-order Information 100%
• Lower Complexity Bounds 100%
• First-order Optimization Method 100%
• Rate-optimal 100%
• First-order Methods 50%
• Algorithm Design 50%
• Difficult Problem 50%
• Fast Rates 50%
• Distributed Algorithms 50%
• Filter Method 50%
• Near-optimal 50%
• Spectral Gap 50%
• Laplacian Matrix 50%
• Local Function 50%
• Lipschitz Constant 50%
• Classical Polynomials 50%
• Polynomial Filter 50%
• Problem Instances 50%
• First-order Algorithm 50%
• Popular 50%
• Communication Round 50%

Computer Science

• Optimization Problem 100%
• Convex Optimization 100%
• Optimal Algorithm 100%
• Information Processing 100%
• Algorithm Design 50%
• Problem Instance 50%
• Objective Function 50%
• Laplacian Matrix 50%
• Distributed Algorithm 50%

Mathematics

• Polynomial 100%
• Objective Function 100%
• Lipschitz Constant 100%
• Laplacian Matrix 100%
• Graph Laplacian 100%