Fetching the paper…
Reading the bibliography…
In this paper we propose distributed dual gradient algorithms for linearly constrained separable convex problems and analyze their rate of convergence under different assumptions.
Bounds for error in the solution set of a perturbed linear program
S. M. Robinson · 1973
Earlier work this paper cites.
A necessary and sufficient regularity condition to have bounded multipliers in nonconvex programming
J. Gauvin · 1977
Earlier work this paper cites.
Computable numerical bounds for lagrange multipliers of stationary points of non-convex differentiable non-linear programs
O.L. Mangasarian · 1985
Earlier work this paper cites.
A class of convergent primal-dual subgradient algorithms for decomposable convex programs
S. Sen and H.D. Sherali · 1986
Earlier work this paper cites.
On the convergence of coordinate descent method for convex differentiable minimization
Z.Q. Luo and P. Tseng · 1992
Earlier work this paper cites.
On the convergence rate of dual ascent methods for linearly constrained convex minimization
Z.Q. Luo and P. Tseng · 1993
Earlier work this paper cites.
Ergodic convergence in subgradient optimization
T. Larsson, M. Patriksson, and A. Stromberg · 1998
Earlier work this paper cites.
Variational Analysis
R.T. Rockafellar and R.J. Wets · 1998
Earlier work this paper cites.
Suboptimal model predictive control (feasibility implies stability)
P.O.M. Scokaert, D.Q. Mayne, and J.B. Rawlings · 1999
Earlier work this paper cites.
Introductory Lectures on Convex Optimization: A Basic Course
Y. Nesterov · 2004
Cited alongside, same era.
Smooth minimization of non-smooth functions
Y. Nesterov · 2005
Cited alongside, same era.
Optimal scaling of a gradient method for distributed resource allocation
L. Xiao and S. Boyd · 2006
Cited alongside, same era.
Lagrangian relaxation via ballstep subgradient methods
K.C. Kiwiel, T. Larsson, and P.O. Lindberg · 2007
Cited alongside, same era.
Application of a smoothing technique to decomposition in convex optimization
I. Necoara and J.A.K. Suykens · 2008
Cited alongside, same era.
Utility maximization with delivery contracts
N. Trichakis, A. Zymnis, and S. Boyd · 2008
Cited alongside, same era.
A random coordinate descent method on large optimization problems with linear constraints
I. Necoara, Y. Nesterov, and F. Glineur · 2011
Later among the works it cites.
Towards computational complexity certification for constrained mpc based on lagrange relaxation and the fast gradient method
S. Richter, M. Morari, and C.N. Jones · 2011
Later among the works it cites.
R.D. Zimmerman, C.E. Murillo-Sanchez, and R.J. Thomas · 2011
Later among the works it cites.
How to make the gradients small
Y. Nesterov · 2012
Later among the works it cites.
An accelerated dual gradient-projection algorithm for embedded linear model predictive control
P. Patrinos and A. Bemporad · 2012
Later among the works it cites.
alphaXiv searches the wider corpus for related work and actual follow-ups.
alphaXiv is searching for related work…
Rate analysis of dual gradient methods. application to control problems
V. Nedelcu · 2009
Cited alongside, same era.
A distributed optimization-based approach for hierarchical mpc of large-scale systems with coupled dynamics and constraints
M.D. Doan, T. Keviczky, and B. De Schutter · 2011
Cited alongside, same era.
Fast predictive control of linear systems combining nesterov’s gradient method and the method of multipliers
M. Kogel and R. Findeisen · 2011
Cited alongside, same era.
Optimal distributed gradient methods for network resource allocation problems
A. Beck, A. Nedic, A. Ozdaglar, and M. Teboulle · 2013
Later among the works it cites.
Rate analysis of inexact dual first order methods: application to dual decomposition
I. Necoara and V. Nedelcu · 2013
Later among the works it cites.
Iteration complexity of feasible descent methods for convex optimization
P.W. Wang and C.J. Lin · 2013
Later among the works it cites.
Distributed dc optimal power flow based on dual fast gradient methods
I. Necoara and V. Nedelcu · 2014
Closest in time.