New computational guarantees for solving convex optimization problems with first order methods, via a function growth condition measure
Motivated by recent work of Renegar, we present new computational methods and associated computational guarantees for solving convex optimization problems using first-order methods. Our problem of interest is the general convex optimization problem f[superscript ∗] = min[subscript x∈Q] f(x),where we...
| Main Authors: | , |
|---|---|
| Other Authors: | |
| Format: | Article |
| Language: | English |
| Published: |
Springer Berlin Heidelberg
2018
|
| Online Access: | http://hdl.handle.net/1721.1/116877 https://orcid.org/0000-0002-1733-5363 https://orcid.org/0000-0002-5217-1894 |