Iteration complexity analysis of dual first-order methods for conic convex programming.

Ion Necoara Andrei Patrascu

Published in: Optim. Methods Softw. (2016)

Keyphrases

complexity analysis
convex programming
first order logic
machine learning
lower bound
high dimensional
dimensionality reduction
theoretical analysis
computationally intensive