This paper proposes a set of Decentralized Approximate Newton (DEAN) methods
for addressing in-network convex optimization, where nodes in a network seek
for a consensus that minimizes the sum of their individual objective functions
through local interactions only. The proposed DEAN algorithms allow each node
to repeatedly take a local approximate Newton step, so that the nodes not only
jointly emulate the (centralized) Newton method but also drive each other
closer. Under weaker assumptions in comparison with most existing distributed
Newton-type methods, the DEAN algorithms enable all the nodes to asymptotically
reach a consensus that can be arbitrarily close to the optimum. Also, for a
particular DEAN algorithm, the consensus error among the nodes vanishes at a
linear rate and the iteration complexity to achieve any given accuracy in
optimality is provided. Furthermore, when the optimization problem reduces to a
quadratic program, the DEAN algorithms are guaranteed to linearly converge to
the exact optimal solution.