An Alternating Trust Region Algorithm for Distributed Linearly Constrained Nonlinear Programs, Application to the Optimal Power Flow Problem

A novel trust region method for solving linearly constrained nonlinear programs is presented. The proposed technique is amenable to a distributed implementation, as its salient ingredient is an alternating projected gradient sweep in place of the Cauchy point computation. It is proven that the algorithm yields a sequence that globally converges to a critical point. As a result of some changes to the standard trust region method, namely a proximal regularisation of the trust region subproblem, it is shown that the local convergence rate is linear with an arbitrarily small ratio. Thus, convergence is locally almost superlinear, under standard regularity assumptions. The proposed method is successfully applied to compute local solutions to alternating current optimal power flow problems in transmission and distribution networks. Moreover, the new mechanism for computing a Cauchy point compares favourably against the standard projected search, as for its activity detection properties.

[1]  Ross Baldick,et al.  Coarse-grained distributed optimal power flow , 1997 .

[2]  Stephen J. Wright,et al.  Numerical Optimization , 2018, Fundamental Statistical Inference.

[3]  Mickeal Verschoor,et al.  Analysis and performance estimation of the Conjugate Gradient method on multiple GPUs , 2012, Parallel Comput..

[4]  John N. Tsitsiklis,et al.  Parallel and distributed computation , 1989 .

[5]  E. F. DAzevedo,et al.  Reducing communication costs in the conjugate gradient algorithm on distributed memory multiprocessors , 1992 .

[6]  Wenping Wang,et al.  Parallel L-BFGS-B algorithm on GPU , 2014, Comput. Graph..

[7]  Marc Teboulle,et al.  Proximal alternating linearized minimization for nonconvex and nonsmooth problems , 2013, Mathematical Programming.

[8]  V. Torczon,et al.  A GLOBALLY CONVERGENT AUGMENTED LAGRANGIAN ALGORITHM FOR OPTIMIZATION WITH GENERAL CONSTRAINTS AND SIMPLE BOUNDS , 2002 .

[9]  T. Steihaug.  The Conjugate Gradient Method and Trust Regions in Large Scale Optimization , 1983 .

[10]  Dinh Quoc Tran,et al.  A dual decomposition algorithm for separable nonconvex optimization using the penalty function framework , 2013, 52nd IEEE Conference on Decision and Control.

[11]  Jorge J. Moré,et al.  Trust regions and projected gradients , 1988 .

[12]  Nicholas I. M. Gould,et al.  Adaptive augmented Lagrangian methods: algorithms and practical numerical experience , 2014, Optim. Methods Softw..

[13]  Colin Neil Jones,et al.  An augmented Lagrangian coordination-decomposition algorithm for solving distributed non-convex programs , 2014, 2014 American Control Conference.

[14]  Abdelouahed Hamdi,et al.  Decomposition Methods Based on Augmented Lagrangians: A Survey , 2011 .

[15]  Nicholas I. M. Gould,et al.  Trust Region Methods , 2000, MOS-SIAM Series on Optimization.

[16]  Colin Neil Jones,et al.  A Parametric Nonconvex Decomposition Algorithm for Real-Time and Distributed NMPC , 2016, IEEE Transactions on Automatic Control.

[17]  Ufuk Topcu,et al.  Exact Convex Relaxation of Optimal Power Flow in Radial Networks , 2013, IEEE Transactions on Automatic Control.

[18]  Jizhong Zhu,et al.  Optimization of Power System Operation , 2009 .

[19]  Bastian Goldlücke,et al.  Variational Analysis , 2014, Computer Vision, A Reference Guide.

[20]  Gerardo Toraldo,et al.  Convergence properties of trust region methods for linear and convex constraints , 1990, Math. Program..

[21]  Nobuo Yamashita,et al.  Analysis of Sparse Quasi-Newton Updates with Positive Definite Matrix Completion , 2014, Journal of the Operations Research Society of China.

[22]  Dinh Quoc Tran,et al.  Combining Lagrangian decomposition and excessive gap smoothing technique for solving large-scale separable convex optimization problems , 2011, Comput. Optim. Appl..

[23]  P. Toint,et al.  Global convergence of a class of trust region algorithms for optimization with simple bounds , 1988 .

[24]  A. Robert Calderbank,et al.  Layering as Optimization Decomposition: A Mathematical Theory of Network Architectures , 2007, Proceedings of the IEEE.

[25]  G. Cohen.  Auxiliary problem principle and decomposition of optimization problems , 1980 .

[26]  Paul A. Trodden,et al.  Local Solutions of the Optimal Power Flow Problem , 2013, IEEE Transactions on Power Systems.

[27]  Mikhail V. Solodov,et al.  Local Convergence of Exact and Inexact Augmented Lagrangian Methods under the Second-Order Sufficient Optimality Condition , 2012, SIAM J. Optim..

[28]  Wenyu Sun,et al.  An alternating structured trust region algorithm for separable optimization problems with nonconvex constraints , 2014, Comput. Optim. Appl..

[29]  Johan A. K. Suykens,et al.  Distributed nonlinear optimal control using sequential convex programming and smoothing techniques , 2009, Proceedings of the 48h IEEE Conference on Decision and Control (CDC) held jointly with 2009 28th Chinese Control Conference.

[30]  David Tse,et al.  Distributed algorithms for optimal power flow problem , 2011, 2012 IEEE 51st IEEE Conference on Decision and Control (CDC).

[31]  Dimitri P. Bertsekas,et al.  Constrained Optimization and Lagrange Multiplier Methods , 1982 .

[32]  Lorenz T. Biegler,et al.  On the implementation of an interior-point filter line-search algorithm for large-scale nonlinear programming , 2006, Math. Program..

[33]  Victor M. Zavala,et al.  Scalable Nonlinear Programming via Exact Differentiable Penalty Functions and Trust-Region Newton Methods , 2014, SIAM J. Optim..

[34]  Victor Eijkhout,et al.  LAPACK Working Note 56: Reducing Communication Costs in the Conjugate Gradient Algorithm on Distributed Memory Multiprocessors , 1993 .

[35]  Victor M. Zavala,et al.  Interior-point decomposition approaches for parallel solution of large-scale nonlinear parameter estimation problems , 2008 .