An alternating trust region algorithm for distributed linearly constrained nonlinear programs, application to the optimal power flow problem

DOI10.1007/s10957-015-0853-2zbMath1378.49030arXiv1502.03777OpenAlexW2113765483MaRDI QIDQ2412836

Colin N. Jones, Jean-Hubert Hours

Publication date: 27 October 2017

Published in: Journal of Optimization Theory and Applications (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1502.03777

zbMATH Keywords

distributed optimizationtrust region methodscoordinate gradient descentnonconvex optimisation

Mathematics Subject Classification ID

Numerical mathematical programming methods (65K05) Large-scale problems in mathematical programming (90C06) Nonconvex programming, global optimization (90C26) Nonlinear programming (90C30) Numerical optimization and variational techniques (65K10) Numerical methods based on nonlinear programming (49M37) Decomposition methods (49M27)

Related Items (1)

Optimal long-term distributed generation planning and reconfiguration of distribution systems: an accelerating Benders' decomposition approach

Uses Software

• Ipopt

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Combining Lagrangian decomposition and excessive gap smoothing technique for solving large-scale separable convex optimization problems
• Proximal alternating linearized minimization for nonconvex and nonsmooth problems
• An alternating structured trust region algorithm for separable optimization problems with nonconvex constraints
• Auxiliary problem principle and decomposition of optimization problems
• Convergence properties of trust region methods for linear and convex constraints
• Sparse quasi-Newton updates with positive definite matrix completion
• On the implementation of an interior-point filter line-search algorithm for large-scale nonlinear programming
• Adaptive augmented Lagrangian methods: algorithms and practical numerical experience
• Local Convergence of Exact and Inexact Augmented Lagrangian Methods under the Second-Order Sufficient Optimality Condition
• Decomposition Methods Based on Augmented Lagrangians: A Survey
• A Parametric Nonconvex Decomposition Algorithm for Real-Time and Distributed NMPC
• Exact Convex Relaxation of Optimal Power Flow in Radial Networks
• A Globally Convergent Augmented Lagrangian Algorithm for Optimization with General Constraints and Simple Bounds
• The Conjugate Gradient Method and Trust Regions in Large Scale Optimization
• Global Convergence of a Class of Trust Region Algorithms for Optimization with Simple Bounds
• Variational Analysis
• Trust Region Methods
• Scalable Nonlinear Programming via Exact Differentiable Penalty Functions and Trust-Region Newton Methods

This page was built for publication: An alternating trust region algorithm for distributed linearly constrained nonlinear programs, application to the optimal power flow problem