Cite
HARVARD Citation
Necoara, I. et al. (2016). Iteration complexity analysis of dual first-order methods for conic convex programming. Optimization methods and software. pp. 645-678. [Online].
This is an interim version of our Electronic Legal Deposit Catalogue-eJournals and eBooks while we continue to recover from a cyber-attack.
Necoara, I. et al. (2016). Iteration complexity analysis of dual first-order methods for conic convex programming. Optimization methods and software. pp. 645-678. [Online].