Duality and Approximation Methods for Cooperative Optimization and Control.

Annotation

Saved in:
Bibliographic Details
Online Access: Full text (MCPHS users only)
Main Author: Bürger, Mathias
Format: Electronic eBook
Language:English
Published: Berlin : Logos Verlag Berlin, 2014
Subjects:
Local Note:ProQuest Ebook Central

MARC

LEADER 00000cam a2200000uu 4500
001 in00000301424
006 m o d
007 cr |n|---|||||
008 180203s2014 gw o 000 0 eng d
005 20240703151938.5
019 |a 1022080835 
020 |a 9783832595913 
020 |a 3832595910 
020 |z 9783832536244 
020 |z 3832536248 
029 1 |a AU@  |b 000065431168 
035 |a (OCoLC)1021807418  |z (OCoLC)1022080835 
035 |a (OCoLC)on1021807418 
040 |a EBLCP  |b eng  |e pn  |c EBLCP  |d YDX  |d MERUC  |d EZ9  |d OCLCQ  |d LOA  |d OCLCO  |d UX1  |d OCLCF  |d OCLCO  |d OCLCQ  |d OCLCO  |d OCLCL  |d SXB 
050 4 |a QA564  |b .B874 2014 
082 0 4 |a 515.782  |2 23 
100 1 |a Bürger, Mathias. 
245 1 0 |a Duality and Approximation Methods for Cooperative Optimization and Control. 
260 |a Berlin :  |b Logos Verlag Berlin,  |c 2014. 
300 |a 1 online resource (166 pages) 
336 |a text  |b txt  |2 rdacontent 
337 |a computer  |b c  |2 rdamedia 
338 |a online resource  |b cr  |2 rdacarrier 
505 0 |a Intro; 1 Introduction; 1.1 Motivation and Focus; 1.2 Contributions and Organization; 2 Polyhedral Approximation Methods for Cooperative Optimization; 2.1 Introduction; 2.2 Distributed Algorithms in Peer-to-Peer Networks; 2.2.1 Communication Network Model; 2.2.2 Distributed Algorithms; 2.2.3 Complexity Notions; 2.3 The Cutting-Plane Consensus Algorithm; 2.3.1 General Problem Formulation; 2.3.2 Unique Solution Linear Programming; 2.3.3 The Algorithm Definition; 2.3.4 Technical Analysis; 2.4 Convex Inequality Constraints; 2.4.1 Problem Formulation; 2.4.2 Semidefinite Constraints. 
505 8 |a 2.4.3 Linear Constraints2.4.4 Application Example: Position Estimation in Wireless Sensor Networks; 2.5 Robust Optimization with Uncertain Constraints; 2.5.1 Problem Formulation; 2.5.2 Efficiently Solvable Problems; 2.5.3 Computational Study: Robust Linear Programming; 2.6 Conclusions; 3 Dual Cutting-Plane and Trajectory Exchange Optimization; 3.1 Introduction; 3.2 A Motivating Problem: Distributed Cooperative Model Predictive Control; 3.2.1 Problem Formulation; 3.2.2 Dual Semi-Infinite Problem Representation; 3.3 Revisiting the Richards and How Algorithm. 
505 8 |a 3.4 Distributed Nonlinear Dantzig-Wolfe Decomposition3.4.1 Distributed Constraint Generation; 3.4.2 Linear Programming Dual Interpretation; 3.4.3 CPC-based Trajectory Exchange Method; 3.5 Application Example: Distributed Microgrid Control; 3.6 Conclusions; 4 Duality and Network Theory in Cooperative Control; 4.1 Introduction; 4.2 Preliminaries; 4.2.1 Algebraic Graph Theory; 4.2.2 Network Theory; 4.2.3 Equilibrium Independent Passivity; 4.3 Duality in Passivity-based Cooperative Control; 4.3.1 The Plant Level; 4.3.2 The Control Level; 4.3.3 The Closed-Loop Perspective. 
505 8 |a 4.4 Application Example: Optimal Distribution Control4.5 Conclusions; 5 Clustering in Dynamical Networks; 5.1 Introduction; 5.2 Constrained Flows & Network Clustering; 5.2.1 A Primal/Dual and Saddle-Point Perspective; 5.2.2 Saddle-Point Problem and Network Clustering; 5.3 Clustering in Dynamical Networks; 5.3.1 A Dynamical Model for Clustering; 5.3.2 Clustering Analysis and Convergence; 5.3.3 Application Examples; 5.4 Hierarchical Clustering Using a Saddle-Point Analysis; 5.4.1 Combinatorial Conditions for Clustering; 5.4.2 A Hierarchical Clustering Algorithm. 
505 8 |a 5.4.3 Application Example: Structural Analysis of Power Networks5.5 Conclusions; 6 Conclusions and Outlook; 6.1 Conclusions; 6.2 Outlook; A Convex Analysis and Optimization Theory; B Dynamical Systems and Control Theory; C Graph Theory. 
520 8 |a Annotation  |b This thesis investigates the role of duality and the use of approximation methods in cooperative optimization and control. Concerning cooperative optimization, a general algorithm for convex optimization in networks with asynchronous communication is presented. Based on the idea of polyhedral approximations, a family of distributed algorithms is developed to solve a variety of distributed decision problems, ranging from semi-definite and robust optimization problems up to distributed model predictive control. Optimization theory, and in particular duality theory, are shown to be central elements also in cooperative control. This thesis establishes an intimate relation between passivity-based cooperative control and network optimization theory. The presented results provide a complete duality theory for passivity-based cooperative control and lead the way to novel analysis tools for complex dynamic phenomena. In this way, this thesis presents theoretical insights and algorithmic approaches for cooperative optimization and control, and emphasizes the role of convexity and duality in this field. 
588 0 |a Print version record. 
590 |a ProQuest Ebook Central  |b Ebook Central Academic Complete 
650 0 |a Duality theory (Mathematics) 
758 |i has work:  |a Duality and approximation methods for cooperative optimization and control (Text)  |1 https://id.oclc.org/worldcat/entity/E39PCGgdjtQHhW8KVkhHXjVY8y  |4 https://id.oclc.org/worldcat/ontology/hasWork 
776 0 8 |i Print version:  |a Bürger, Mathias.  |t Duality and Approximation Methods for Cooperative Optimization and Control.  |d Berlin : Logos Verlag Berlin, ©2014  |z 9783832536244 
852 |b E-Collections  |h ProQuest 
856 4 0 |u https://ebookcentral.proquest.com/lib/mcphs/detail.action?docID=5231165  |z Full text (MCPHS users only)  |t 0 
938 |a EBL - Ebook Library  |b EBLB  |n EBL5231165 
938 |a YBP Library Services  |b YANK  |n 15139018 
947 |a FLO  |x pq-ebc-base 
999 f f |s 5c042e5a-4ecc-40c7-b9ad-1ca05101d9ba  |i ced0c314-c118-47f7-a4e6-ba2054cebd3d  |t 0 
952 f f |a Massachusetts College of Pharmacy and Health Sciences  |b Online  |c Online  |d E-Collections  |t 0  |e ProQuest  |h Other scheme 
856 4 0 |t 0  |u https://ebookcentral.proquest.com/lib/mcphs/detail.action?docID=5231165  |y Full text (MCPHS users only)