Divide and Conquer: Distributed Optimization and Robustness Analysis
Sammanfattning: As control of large-scale complex systems has become more and more prevalent within control, so has the need for analyzing such controlled systems. This is particularly due to the fact that many of the control design approaches tend to neglect intricacies in such systems, e.g., uncertainties, time delays, nonlinearities, so as to simplify the design procedure.Robustness analysis techniques allow us to assess the effect of such neglected intricacies on performance and stability. Performing robustness analysis commonly requires solving an optimization problem. However, the number of variables of this optimization problem, and hence the computational time, scales badly with the dimension of the system. This limits our ability to analyze large-scale complex systems in a centralized manner. In addition, certain structural constraints, such as privacy requirements or geographical separation, can prevent us from even forming the analysis problem in a centralized manner.In this thesis, we address these issues by exploiting structures that are common in large-scale systems and/or their corresponding analysis problems. This enables us to reduce the computational cost of solving these problems both in a centralized and distributed manner. In order to facilitate distributed solutions, we employ or design tailored distributed optimization techniques. Particularly, we propose three distributed optimization algorithms for solving the analysis problem, which provide superior convergence and/or computational properties over existing algorithms. Furthermore, these algorithms can also be used for solving general loosely coupled optimization problems that appear in a variety of fields ranging from control, estimation and communication systems to supply chain management and economics.
KLICKA HÄR FÖR ATT SE AVHANDLINGEN I FULLTEXT. (PDF-format)