Accelerated first-order methods for hyperbolic programming
Author:
- 7 November 2017
- journal article
- research article
- Published by Springer Nature in Mathematical Programming
- Vol. 173 (1-2) , 1-35
Abstract
No abstract availableKeywords
All Related Versions
Funding Information
- Division of Computing and Communication Foundations (1552518)
This publication has 20 references indexed in Scilit:
- Bundle-level type methods uniformly optimal for smooth and nonsmooth convex optimizationMathematical Programming, 2013
- A Mathematical Introduction to Compressive Sensing2013
- Smoothing and First Order Methods: A Unified FrameworkSIAM Journal on Optimization, 2012
- Templates for convex cone problems with applications to sparse signal recoveryMathematical Programming Computation, 2011
- NESTA: A Fast and Accurate First-Order Method for Sparse RecoverySIAM Journal on Imaging Sciences, 2011
- Primal-dual first-order methods with ${\mathcal {O}(1/\epsilon)}$ iteration-complexity for cone programmingMathematical Programming, 2009
- Linear matrix inequality representation of setsCommunications on Pure and Applied Mathematics, 2006
- The Lax conjecture is trueProceedings of the American Mathematical Society, 2005
- Hyperbolic Polynomials and Convex AnalysisCanadian Journal of Mathematics, 2001
- Hyperbolic Polynomials and Interior Point Methods for Convex ProgrammingMathematics of Operations Research, 1997