Information, complexity and structure in convex optimization
This thesis is focused on the limits of performance of large-scale convex optimization algorithms. Classical theory of oracle complexity, first proposed by Nemirovski and Yudin in 1983, successfully established the worst-case behavior of methods based on local oracles (a generalization of first-orde...
| Main Author: | |
|---|---|
| Other Authors: | |
| Format: | Others |
| Language: | en_US |
| Published: |
Georgia Institute of Technology
2015
|
| Subjects: | |
| Online Access: | http://hdl.handle.net/1853/53577 |