Instruct: Given the title of a paper, retrieve paper titles that are cited by the given paper.
Query: Faster Rates for the Frank-Wolfe Method over Strongly-Convex Sets
Coresets, sparse greedy approximation, and the Frank-Wolfe algorithm
A Differential Equation for Modeling Nesterov's Accelerated Gradient Method: Theory and Insights
Recursive Decomposition for Nonconvex Optimization
On the Convergence of Block Coordinate Descent Type Methods
Semi-proximal Mirror-Prox for Nonsmooth Composite Minimization
A geometric alternative to Nesterov's accelerated gradient descent
Approximate Steepest Coordinate Descent
A primal-dual regularized interior-point method for convex quadratic programs
a trust region algorithm with a worst - case iteration complexity of o ( ϵ - 3 / 2 ) for nonconvex optimization .
A Coordinate Descent Primal-Dual Algorithm and Application to Distributed Asynchronous Optimization
The Asynchronous PALM Algorithm for Nonsmooth Nonconvex Problems
Fast Approximation Algorithms for a Class of Non-convex QCQP Problems Using First-Order Methods
A New Approach to Strongly Polynomial Linear Programming
Fast Stochastic Algorithms for SVD and PCA: Convergence Properties and Convexity
Exact and Inexact Subsampled Newton Methods for Optimization
Linear Convergence of Stochastic Iterative Greedy Algorithms With Sparse Constraints
Communication Complexity of Distributed Convex Learning and Optimization
A coordinate gradient descent method for nonsmooth separable minimization
Conditional Gradient Algorithms for Norm-Regularized Smooth Convex Optimization
Distributed Optimization of Convex Sum of Non-Convex Functions
DDefender: Android application threat detection using static and dynamic analysis
Greed is good: algorithmic results for sparse approximation
Control system for the waterjet cutting Machine
A dual-band meander monopole antenna for on-body devices
linearization techniques for mixers .