Fetching the paper…
Reading the bibliography…
This paper considers large scale constrained convex (possibly composite and non-separable) programs, which are usually difficult to solve by interior point methods or other Newton-type methods due to the non-smoothness or the prohibitive computation and storage complexity for Hessians and matrix inversions.
D. P. Bertsekas
1999
Earlier work this paper cites.
R. Jagannathan and T. Ma
2003
Earlier work this paper cites.
Y. Nesterov
2004
Earlier work this paper cites.
M. J. Neely
2005
Earlier work this paper cites.
A. Beck and M. Teboulle
2009
Earlier work this paper cites.
J. Brodie, I. Daubechies, C. De Mol, D. Giannone, and I. Loris
2009
Earlier work this paper cites.
V. DeMiguel, L. Garlappi, F. J. Nogales, and R. Uppal
2009
Cited alongside, same era.
A. Nedić and A. Ozdaglar
2009
Cited alongside, same era.
A. Nedić and A. Ozdaglar
2009
Cited alongside, same era.
A. Beck, A. Ben-Tal, N. Guttmann-Beck, and L. Tetruashvili
2010
Cited alongside, same era.
G. M. James, C. Paulson, and P. Rusmevichientong
2012
Cited alongside, same era.
M. Grant and S. Boyd
2013
Cited alongside, same era.
2014
Later among the works it cites.
2016
Later among the works it cites.
R. Shefi and M. Teboulle
2016
Later among the works it cites.
H. Yu and M. J. Neely
2016
Later among the works it cites.
P. J. Kremer, A. Talmaciu, and S. Paterlini
2017
Closest in time.
2017
Closest in time.
alphaXiv searches the wider corpus for related work and actual follow-ups.
alphaXiv is searching for related work…