Primal-dual first-order methods with O(1/∈) iteration-complexity for cone programming

Keyphrases

• Nesterov 100%
• Iteration Complexity 100%
• Cone Programming 100%
• Primal-dual First-order Methods 100%
• First-order Methods 33%
• Programming Problems 33%
• Primal-dual 33%
• Linear Programming 16%
• Approximation Scheme 16%
• Semidefinite Programming 16%
• Smooth Approximation 16%
• Nonsmooth Convex Minimization 16%
• Computational Experiment 16%
• PrOx 16%
• Low-rank Methods 16%
• Iteration Complexity Bound 16%

Mathematics

• Programming Problem 100%
• Opts _ _ _ 50%
• Smooth approximation 50%
• Rank Method 50%
• Linear Programming 50%

Computer Science

• Primal-Dual 100%
• Semidefinite Programming 33%
• Computational Experiment 33%
• approximation scheme 33%
• Linear Programming 33%