IDEAS home Printed from https://ideas.repec.org/a/spr/joptap/v173y2017i3d10.1007_s10957-015-0853-2.html
   My bibliography  Save this article

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

Author

Listed:
  • Jean-Hubert Hours

    (Ecole Polytechnique Fédérale de Lausanne)

  • Colin N. Jones

    (Ecole Polytechnique Fédérale de Lausanne)

Abstract

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.

Suggested Citation

  • Jean-Hubert Hours & Colin N. Jones, 2017. "An Alternating Trust Region Algorithm for Distributed Linearly Constrained Nonlinear Programs, Application to the Optimal Power Flow Problem," Journal of Optimization Theory and Applications, Springer, vol. 173(3), pages 844-877, June.
  • Handle: RePEc:spr:joptap:v:173:y:2017:i:3:d:10.1007_s10957-015-0853-2
    DOI: 10.1007/s10957-015-0853-2
    as

    Download full text from publisher

    File URL: http://link.springer.com/10.1007/s10957-015-0853-2
    File Function: Abstract
    Download Restriction: Access to the full text of the articles in this series is restricted.

    File URL: https://libkey.io/10.1007/s10957-015-0853-2?utm_source=ideas
    LibKey link: if access is restricted and if your library uses this service, LibKey will redirect you to where you can use your library subscription to access this item
    ---><---

    As the access to this document is restricted, you may want to search for a different version of it.

    References listed on IDEAS

    as
    1. Dan Xue & Wenyu Sun & Liqun Qi, 2014. "An alternating structured trust region algorithm for separable optimization problems with nonconvex constraints," Computational Optimization and Applications, Springer, vol. 57(2), pages 365-386, March.
    2. Quoc Tran Dinh & Carlo Savorgnan & Moritz Diehl, 2013. "Combining Lagrangian decomposition and excessive gap smoothing technique for solving large-scale separable convex optimization problems," Computational Optimization and Applications, Springer, vol. 55(1), pages 75-111, May.
    Full references (including those not matched with items on IDEAS)

    Citations

    Citations are extracted by the CitEc Project, subscribe to its RSS feed for this item.
    as


    Cited by:

    1. Salman Khodayifar & Mohammad A. Raayatpanah & Abbas Rabiee & Hamed Rahimian & Panos M. Pardalos, 2018. "Optimal Long-Term Distributed Generation Planning and Reconfiguration of Distribution Systems: An Accelerating Benders’ Decomposition Approach," Journal of Optimization Theory and Applications, Springer, vol. 179(1), pages 283-310, October.

    Most related items

    These are the items that most often cite the same works as this one and are cited by the same works as this one.
    1. Liusheng Hou & Hongjin He & Junfeng Yang, 2016. "A partially parallel splitting method for multiple-block separable convex programming with applications to robust PCA," Computational Optimization and Applications, Springer, vol. 63(1), pages 273-303, January.
    2. Nima Rabiei & Jose Muñoz, 2015. "AAR-based decomposition algorithm for non-linear convex optimisation," Computational Optimization and Applications, Springer, vol. 62(3), pages 761-786, December.
    3. Frank E. Curtis & Arvind U. Raghunathan, 2017. "Solving nearly-separable quadratic optimization problems as nonsmooth equations," Computational Optimization and Applications, Springer, vol. 67(2), pages 317-360, June.
    4. X. Wang & S. Li & X. Kou & Q. Zhang, 2015. "A new alternating direction method for linearly constrained nonconvex optimization problems," Journal of Global Optimization, Springer, vol. 62(4), pages 695-709, August.
    5. Jueyou Li & Zhiyou Wu & Changzhi Wu & Qiang Long & Xiangyu Wang, 2016. "An Inexact Dual Fast Gradient-Projection Method for Separable Convex Optimization with Linear Coupled Constraints," Journal of Optimization Theory and Applications, Springer, vol. 168(1), pages 153-171, January.
    6. Quoc Tran-Dinh, 2017. "Adaptive smoothing algorithms for nonsmooth composite convex minimization," Computational Optimization and Applications, Springer, vol. 66(3), pages 425-451, April.
    7. Jueyou Li & Guo Chen & Zhaoyang Dong & Zhiyou Wu, 2016. "A fast dual proximal-gradient method for separable convex optimization with linear coupled constraints," Computational Optimization and Applications, Springer, vol. 64(3), pages 671-697, July.

    Corrections

    All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:spr:joptap:v:173:y:2017:i:3:d:10.1007_s10957-015-0853-2. See general information about how to correct material in RePEc.

    If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.

    If CitEc recognized a bibliographic reference but did not link an item in RePEc to it, you can help with this form .

    If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your RePEc Author Service profile, as there may be some citations waiting for confirmation.

    For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: Sonal Shukla or Springer Nature Abstracting and Indexing (email available below). General contact details of provider: http://www.springer.com .

    Please note that corrections may take a couple of weeks to filter through the various RePEc services.

    IDEAS is a RePEc service. RePEc uses bibliographic data supplied by the respective publishers.