2 research outputs found
Overlapping Schwarz Decomposition for Constrained Quadratic Programs
We present an overlapping Schwarz decomposition algorithm for constrained
quadratic programs (QPs). Schwarz algorithms have been traditionally used to
solve linear algebra systems arising from partial differential equations, but
we have recently shown that they are also effective at solving structured
optimization problems. In the proposed scheme, we consider QPs whose algebraic
structure can be represented by graphs. The graph domain is partitioned into
overlapping subdomains (yielding a set of coupled subproblems), solutions for
the subproblems are computed in parallel, and convergence is enforced by
updating primal-dual information in the overlapping regions. We show that
convergence is guaranteed if the overlap is sufficiently large and that the
convergence rate improves exponentially with the size of the overlap.
Convergence results rely on a key property of graph-structured problems that is
known as exponential decay of sensitivity. Here, we establish conditions under
which this property holds for constrained QPs (as those found in network
optimization and optimal control), thus extending existing work that addresses
unconstrained QPs. The numerical behavior of the Schwarz scheme is demonstrated
by using a DC optimal power flow problem defined over a network with 9,241
nodes
Comparison of dual based optimization methods for distributed trajectory optimization of coupled semi-batch processes
The physical and virtual connectivity of systems via flows of energy, material, information, etc., steadily increases. This paper deals with systems of sub-systems that are connected by networks of shared resources that have to be balanced. For the optimal operation of the overall system, the couplings between the sub-systems must be taken into account, and the overall optimum will usually deviate from the local optima of the sub-systems. However, for reasons, such as problem size, confidentiality, resilience to breakdowns, or generally when dealing with autonomous systems, monolithic optimization is often infeasible. In this contribution, iterative distributed optimization methods based on dual decomposition where the values of the objective functions of the different sub-systems do not have to be shared are investigated. We consider connected dynamic systems that share resources. This situation arises for continuous processes in transient conditions between different steady states and in inherently discontinuous processes, such as batch production processes. This problem is challenging since small changes during the iterations towards the satisfaction of the overarching constraints can lead to significant changes in the arc structures of the optimal solutions for the sub-systems. Moreover, meeting endpoint constraints at free final times complicates the problem. We propose a solution strategy for coupled semi-batch processes and compare different numerical approaches, the sub-gradient method, ADMM, and ALADIN, and show that convexification of the sub-systems around feasible points increases the speed of convergence while using second-order information does not necessarily do so. Since sharing of resources has an influence on whether trajectory dependent terminal constraints can be satisfied, we propose a heuristic for the computation of free final times of the sub-systems that allows the dynamic sub-processes to meet the constraints. For the example of several semi-batch reactors which are coupled via a bound on the total feed flow rate, we demonstrate that the distributed methods converge to (local) optima and highlight the strengths and the weaknesses of the different distributed optimization methods