Fetching the paper…
Reading the bibliography…
In this work, we study two first-order primal-dual based algorithms, the Gradient Primal-Dual Algorithm (GPDA) and the Gradient Alternating Direction Method of Multipliers (GADMM), for solving a class of linearly constrained non-convex optimization problems.
H. Uzawa, “Iterative methods in concave programming,” in
1958
Earlier work this paper cites.
R. T. Rockafellar, “Augmented lagrangians and applications of the proximal point algorithm in convex programming,”
1976
Earlier work this paper cites.
K. G. Murty and S. N. Kabadi, “Some NP-complete problems in quadratic and nonlinear programming,”
1987
Earlier work this paper cites.
M. Shub,
1987
Earlier work this paper cites.
S. J.Wright, “Implementing proximal point methods for linear programming,”
1990
Earlier work this paper cites.
G. W. Stewart and J.-G. Sun,
1990
Earlier work this paper cites.
J. Eckstein and D. P. Bertsekas, “On the Douglas-Rachford splitting method and the proximal point algorithm for maximal monotone operators,”
1992
Earlier work this paper cites.
D. P. Bertsekas,
1999
Earlier work this paper cites.
A. R. Conn, N. I. Gould, and P. L. Toint,
2000
Earlier work this paper cites.
Y. Nesterov and B. T. Polyak, “Cubic regularization of newton method and its global performance,”
2006
Earlier work this paper cites.
I. Schizas, A. Ribeiro, and G. Giannakis, “Consensus in ad hoc wsns with noisy links - part i: Distributed estimation of deterministic signals,”
2008
Earlier work this paper cites.
A. Nedic and A. Ozdaglar, “Distributed subgradient methods for multi-agent optimization,”
2009
Earlier work this paper cites.
I. Schizas, G. Mateos, and G. Giannakis, “Distributed LMS for consensus-based in-network adaptive processing,,”
2009
Earlier work this paper cites.
A. Nedić and A. Ozdaglar, “Subgradient methods for saddle-point problems,”
2009
Earlier work this paper cites.
G. Mateos, J. A. Bazerque, and G. B. Giannakis, “Distributed sparse linear regression,”
2010
Earlier work this paper cites.
P. A. Forero, A. Cano, and G. B. Giannakis, “Distributed clustering using wireless sensor networks,”
2011
Cited alongside, same era.
S. Boyd, N. Parikh, E. Chu, B. Peleato, and J. Eckstein, “Distributed optimization and statistical learning via the alternating direction method of multipliers,”
2011
Cited alongside, same era.
M. Li, D. G. Andersen, and A. Smola, “Distributed delayed proximal gradient methods,” in
2013
Cited alongside, same era.
S. Shalev-Shwartz and T. Zhang, “Proximal stochastic dual coordinate ascent methods for regularized loss minimization,”
2013
Cited alongside, same era.
P. Bianchi and J. Jakubowicz, “Convergence of a multi-agent projected stochastic gradient algorithm for non-convex optimization,”
2013
Cited alongside, same era.
2015
Later among the works it cites.
M. Hong, Z.-Q. Luo, and M. Razaviyayn, “Convergence analysis of alternating direction method of multipliers for a family of nonconvex problems,”
2016
Later among the works it cites.
P. D. Lorenzo and G. Scutari, “Next: In-network nonconvex optimization,” 2016, preprint
2016
Later among the works it cites.
J. D. Lee, M. Simchowitz, M. I. Jordan, and B. Recht, “Gradient descent only converges to minimizers,” in
2016
Later among the works it cites.
N.-S. Aybat and E.-Y. Hamedani, “A primal-dual method for conic constrained distributed optimization problems,”
2016
Later among the works it cites.
alphaXiv searches the wider corpus for related work and actual follow-ups.
alphaXiv is searching for related work…
W. Shi, Q. Ling, G. Wu, and W. Yin, “Extra: An exact first-order algorithm for decentralized consensus optimization,”
2014
Cited alongside, same era.
J. Bolte, S. Sabach, and M. Teboulle, “Proximal alternating linearized minimization for nonconvex and nonsmooth problems,”
2014
Cited alongside, same era.
2014
Cited alongside, same era.
X. Gao, B. Jiang, and S. Zhang, “On the information-adaptive variants of the admm: An iteration complexity perspective,” 2014, preprint
2014
Cited alongside, same era.
2014
Cited alongside, same era.
Y. Zhang and X. Lin, “Disco: Distributed optimization for self-concordant empirical loss,” in
2015
Cited alongside, same era.
W.-C. Liao, M. Hong, H. Farmanbar, and Z.-Q. Luo, “Semi-asynchronous routing for large-scale hierarchical networks,” in
2015
Cited alongside, same era.
2016
Later among the works it cites.
2016
Later among the works it cites.
S. M. B. Jiang, T. Lin and S. Zhang, “Structured nonconvex and nonsmooth optimization: algorithms and iteration complexity analysis,” 2016, preprint
2016
Later among the works it cites.
X. Lian, C. Zhang, H. Zhang, C.-J. Hsieh, W. Zhang, and J. Liu, “Can decentralized algorithms outperform centralized algorithms? a case study for decentralized parallel stochastic gradient descent,” in
2017
Later among the works it cites.
2017
Later among the works it cites.
C. Jin, R. Ge, P. Netrapalli, S. M. Kakade, and M. I. Jordan, “How to escape saddle points efficiently,” in
2017
Later among the works it cites.
J. D. Lee, I. Panageas, G. Piliouras, M. Simchowitz, M. I. Jordan, and B. Recht, “First-order methods almost always avoid saddle points,” 2017, preprint
2017
Later among the works it cites.
M. Hong, D. Hajinezhad, and M.-M. Zhao, “Prox-pda: The proximal primal-dual algorithm for fast distributed nonconvex optimization and learning over networks,” in
2017
Later among the works it cites.