Fetching the paper…
Reading the bibliography…
A framework is developed for applying accelerated methods to general hyperbolic programming, including linear, second-order cone, and semidefinite programming as special cases.
An inequality for hyperbolic polynomials
Lars Garding · 1959
Earlier work this paper cites.
Problem complexity and method efficiency in optimization
Arkadi Nemirovski and David Yudin · 1983
Earlier work this paper cites.
Lectures on the theory of functions of several complex variables
Bernard Malgrange and Raghavan Narasimhan · 1984
Earlier work this paper cites.
Interior-point polynomial algorithms in convex programming
Yurii Nesterov and Arkadi Nemirovski · 1994
Earlier work this paper cites.
Hyperbolic polynomials and interior point methods for convex programming
Osman Güler · 1997
Earlier work this paper cites.
Hyperbolic polynomials and convex analysis
Heinz H Bauschke, Osman Guler, Adrian S Lewis, and Hristo S Sendov · 2001
Earlier work this paper cites.
Introductory Lectures on Convex Optimization: A Basic Course
Yurii Nesterov · 2004
Earlier work this paper cites.
The Lax conjecture is true
Adrian Lewis, Pablo Parrilo, and Motakuri Ramana · 2005
Earlier work this paper cites.
Smooth minimization of non-smooth functions
Yurii Nesterov · 2005
Earlier work this paper cites.
Hyperbolic programs, and their derivative relaxations
James Renegar · 2006
Cited alongside, same era.
Linear matrix inequality representation of sets
J William Helton and Victor Vinnikov · 2007
Cited alongside, same era.
Large-scale semidefinite programming via a saddle point mirror-prox algorithm
Zhaosong Lu, Arkadi Nemirovski, and Renato DC Monteiro · 2007
Cited alongside, same era.
Smoothing technique and its applications in semidefinite optimization
Yurii Nesterov · 2007
Cited alongside, same era.
Nesta: a fast and accurate first-order method for sparse recovery
Stephen Becker, Jérôme Bobin, and Emmanuel J Candès · 2011
Cited alongside, same era.
Templates for convex cone problems with applications to sparse signal recovery
Stephen R Becker, Emmanuel J Candès, and Michael C Grant · 2011
Cited alongside, same era.
A mathematical introduction to compressive sensing
Simon Foucart and Holger Rauhut · 2013
Later among the works it cites.
Gradient methods for minimizing composite functions
Yurii Nesterov · 2013
Later among the works it cites.
Definite determinantal representations of ternary hyperbolic forms
Christoph Hanselka · 2014
Later among the works it cites.
Universal gradient methods for convex optimization problems
Yu Nesterov · 2014
Later among the works it cites.
Efficient first-order methods for linear programming and semidefinite programming
James Renegar · 2014
Later among the works it cites.
A polynomial-time affine-scaling method for semidefinite and hyperbolic programming
alphaXiv searches the wider corpus for related work and actual follow-ups.
alphaXiv is searching for related work…
Primal-dual first-order methods with O ( 1 / ϵ ) {O}(1/\epsilon) iteration-complexity for cone programming
Guanghui Lan, Zhaosong Lu, and Renato DC Monteiro · 2011
Cited alongside, same era.
Smoothing and first order methods: A unified framework
Amir Beck and Marc Teboulle · 2012
Cited alongside, same era.
LMI representations of convex semialgebraic sets and determinantal representations of algebraic hypersurfaces: past, present, and future
Victor Vinnikov · 2012
Cited alongside, same era.
James Renegar and Mutiara Sondjaja · 2014
Later among the works it cites.
Robert M Freund and Haihao Lu · 2015
Closest in time.
Bundle-level type methods uniformly optimal for smooth and nonsmooth convex optimization
Guanghui Lan · 2015
Closest in time.
“Efficient” Subgradient Methods for General Convex Optimization
James Renegar · 2016
Closest in time.