  This note discusses an essentially decentralized interior point method, which
is well suited for optimization problems arising in energy networks. Advantages
of the proposed method are guaranteed and fast local convergence also for
problems with non-convex constraints. Moreover, our method exhibits a small
communication footprint and it achieves a comparably high solution accuracy
with a limited number of iterations, whereby the local subproblems are of low
computational complexity. We illustrate the performance of the proposed method
on a problem from energy systems, i.e., we consider an optimal power flow
problem with 708 buses.
