Parallel Optimization of Polynomials for Large-scale Problems in Stability and Control
In this thesis, we focus on some of the NP-hard problems in control theory. Thanks to the converse Lyapunov theory, these problems can often be modeled as optimization over polynomials. To avoid the problem of intractability, we establish a trade off between accuracy and complexity. In particular, w...
Gespeichert in:
| 1. Verfasser: | |
|---|---|
| Format: | Dissertation |
| Sprache: | Englisch |
| Veröffentlicht: |
ProQuest Dissertations & Theses
01.01.2016
|
| Schlagworte: | |
| ISBN: | 1339704986, 9781339704982 |
| Online-Zugang: | Volltext |
| Tags: |
Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
|
| Abstract | In this thesis, we focus on some of the NP-hard problems in control theory. Thanks to the converse Lyapunov theory, these problems can often be modeled as optimization over polynomials. To avoid the problem of intractability, we establish a trade off between accuracy and complexity. In particular, we develop a sequence of tractable optimization problems — in the form of Linear Programs (LPs) and/or Semi-Definite Programs (SDPs) — whose solutions converge to the exact solution of the NP-hard problem. However, the computational and memory complexity of these LPs and SDPs grow exponentially with the progress of the sequence - meaning that improving the accuracy of the solutions requires solving SDPs with tens of thousands of decision variables and constraints. Setting up and solving such problems is a significant challenge. The existing optimization algorithms and software are only designed to use desktop computers or small cluster computers — machines which do not have sufficient memory for solving such large SDPs. Moreover, the speed-up of these algorithms does not scale beyond dozens of processors. This in fact is the reason we seek parallel algorithms for setting-up and solving large SDPs on large cluster- and/or super-computers. We propose parallel algorithms for stability analysis of two classes of systems: 1) Linear systems with a large number of uncertain parameters; 2) Nonlinear systems defined by polynomial vector fields. First, we develop a distributed parallel algorithm which applies Polya's and/or Handelman's theorems to some variants of parameter-dependent Lyapunov inequalities with parameters defined over the standard simplex. The result is a sequence of SDPs which possess a block-diagonal structure. We then develop a parallel SDP solver which exploits this structure in order to map the computation, memory and communication to a distributed parallel environment. Numerical tests on a supercomputer demonstrate the ability of the algorithm to efficiently utilize hundreds and potentially thousands of processors, and analyze systems with 100+ dimensional state-space. Furthermore, we extend our algorithms to analyze robust stability over more complicated geometries such as hypercubes and arbitrary convex polytopes. Our algorithms can be readily extended to address a wide variety of problems in control such as H∞ synthesis for systems with parametric uncertainty and computing control Lyapunov functions. |
|---|---|
| AbstractList | In this thesis, we focus on some of the NP-hard problems in control theory. Thanks to the converse Lyapunov theory, these problems can often be modeled as optimization over polynomials. To avoid the problem of intractability, we establish a trade off between accuracy and complexity. In particular, we develop a sequence of tractable optimization problems — in the form of Linear Programs (LPs) and/or Semi-Definite Programs (SDPs) — whose solutions converge to the exact solution of the NP-hard problem. However, the computational and memory complexity of these LPs and SDPs grow exponentially with the progress of the sequence - meaning that improving the accuracy of the solutions requires solving SDPs with tens of thousands of decision variables and constraints. Setting up and solving such problems is a significant challenge. The existing optimization algorithms and software are only designed to use desktop computers or small cluster computers — machines which do not have sufficient memory for solving such large SDPs. Moreover, the speed-up of these algorithms does not scale beyond dozens of processors. This in fact is the reason we seek parallel algorithms for setting-up and solving large SDPs on large cluster- and/or super-computers. We propose parallel algorithms for stability analysis of two classes of systems: 1) Linear systems with a large number of uncertain parameters; 2) Nonlinear systems defined by polynomial vector fields. First, we develop a distributed parallel algorithm which applies Polya's and/or Handelman's theorems to some variants of parameter-dependent Lyapunov inequalities with parameters defined over the standard simplex. The result is a sequence of SDPs which possess a block-diagonal structure. We then develop a parallel SDP solver which exploits this structure in order to map the computation, memory and communication to a distributed parallel environment. Numerical tests on a supercomputer demonstrate the ability of the algorithm to efficiently utilize hundreds and potentially thousands of processors, and analyze systems with 100+ dimensional state-space. Furthermore, we extend our algorithms to analyze robust stability over more complicated geometries such as hypercubes and arbitrary convex polytopes. Our algorithms can be readily extended to address a wide variety of problems in control such as H∞ synthesis for systems with parametric uncertainty and computing control Lyapunov functions. |
| Author | Kamyar, Reza |
| Author_xml | – sequence: 1 givenname: Reza surname: Kamyar fullname: Kamyar, Reza |
| BookMark | eNotjc1KAzEYRQMqaGvfIeB6IL-TyVKKfzDQAYvb8sX5pkQySU3SRX16B3R1F4dz7opcxxTxiqy4lNYwZbv2lmxK8Y4xZqVkStyRjwEyhICB7k7Vz_4Hqk-RpokOKVximj2EQqeUaQ_5iE35hIB0yMkFnAv1kb5XcD74eqEQR7pNseYU7snNtIi4-d812T8_7bevTb97eds-9s2xFaxRU4uI0ljdjcAFIriWw6jHljFtQEvtlMaFsVFY11mjhJoAueBSKQlCrsnDX_aU0_cZSz18pXOOy-OBG8uVZkYz-QsmkU7R |
| ContentType | Dissertation |
| Copyright | Database copyright ProQuest LLC; ProQuest does not claim copyright in the individual underlying works. |
| Copyright_xml | – notice: Database copyright ProQuest LLC; ProQuest does not claim copyright in the individual underlying works. |
| DBID | 053 054 0BH 0EK ABJCF ABQRF ABRGS AFLLJ AFOKG ARAPS BGLVJ CBPLH EU9 G20 HCIFZ M8- PHGZM PHGZT PKEHL PQEST PQGLB PQQKQ PQUKI |
| DatabaseName | Dissertations & Theses Europe Full Text: Science & Technology Dissertations & Theses Europe Full Text: Social Sciences ProQuest Dissertations and Theses Professional Dissertations & Theses @ Arizona State University Materials Science & Engineering Collection Technology Collection - hybrid linking Materials Science & Engineering Collection - hybrid linking SciTech Premium Collection - hybrid linking Advanced Technologies & Aerospace Collection - hybrid linking Advanced Technologies & Computer Science Collection Technology collection ProQuest Dissertations & Theses Global: The Sciences and Engineering Collection ProQuest Dissertations & Theses A&I ProQuest Dissertations & Theses Global SciTech Premium Collection ProQuest Dissertations and Theses A&I: The Sciences and Engineering Collection ProQuest Central Premium ProQuest One Academic ProQuest One Academic Middle East (New) ProQuest One Academic Eastern Edition (DO NOT USE) ProQuest One Applied & Life Sciences ProQuest One Academic (retired) ProQuest One Academic UKI Edition |
| DatabaseTitle | Advanced Technologies & Aerospace Collection Technology Collection ProQuest One Academic Middle East (New) ProQuest One Academic Eastern Edition SciTech Premium Collection ProQuest Dissertations & Theses Global: The Sciences and Engineering Collection ProQuest Dissertations and Theses Professional ProQuest Dissertations and Theses A&I: The Sciences and Engineering Collection ProQuest Dissertations & Theses Global Dissertations & Theses Europe Full Text: Science & Technology Dissertations & Theses @ Arizona State University ProQuest One Applied & Life Sciences Dissertations & Theses Europe Full Text: Social Sciences ProQuest One Academic UKI Edition Materials Science & Engineering Collection ProQuest Central (New) ProQuest One Academic ProQuest Dissertations & Theses A&I ProQuest One Academic (New) |
| DatabaseTitleList | Advanced Technologies & Aerospace Collection |
| Database_xml | – sequence: 1 dbid: G20 name: ProQuest Dissertations & Theses Global url: https://www.proquest.com/pqdtglobal1 sourceTypes: Aggregation Database |
| DeliveryMethod | fulltext_linktorsrc |
| Discipline | Mathematics |
| ExternalDocumentID | 4068490011 |
| Genre | Dissertation/Thesis |
| GroupedDBID | 053 054 0BH 0EK 8R4 8R5 ABJCF ARAPS BGLVJ CBPLH EU9 G20 HCIFZ M8- PHGZM PHGZT PKEHL PQEST PQGLB PQQKQ PQUKI Q2X |
| ID | FETCH-LOGICAL-g620-4f6eee37958da12eeab61ad5d60057a535b45e8da0d29b897424fae1213443a23 |
| IEDL.DBID | G20 |
| ISBN | 1339704986 9781339704982 |
| IngestDate | Mon Jun 30 03:20:47 EDT 2025 |
| IsPeerReviewed | false |
| IsScholarly | false |
| Language | English |
| LinkModel | DirectLink |
| MergedId | FETCHMERGED-LOGICAL-g620-4f6eee37958da12eeab61ad5d60057a535b45e8da0d29b897424fae1213443a23 |
| Notes | SourceType-Dissertations & Theses-1 ObjectType-Dissertation/Thesis-1 content type line 12 |
| PQID | 1791450750 |
| PQPubID | 18750 |
| ParticipantIDs | proquest_journals_1791450750 |
| PublicationCentury | 2000 |
| PublicationDate | 20160101 |
| PublicationDateYYYYMMDD | 2016-01-01 |
| PublicationDate_xml | – month: 01 year: 2016 text: 20160101 day: 01 |
| PublicationDecade | 2010 |
| PublicationYear | 2016 |
| Publisher | ProQuest Dissertations & Theses |
| Publisher_xml | – name: ProQuest Dissertations & Theses |
| SSID | ssib000933042 |
| Score | 1.7103945 |
| Snippet | In this thesis, we focus on some of the NP-hard problems in control theory. Thanks to the converse Lyapunov theory, these problems can often be modeled as... |
| SourceID | proquest |
| SourceType | Aggregation Database |
| SubjectTerms | Energy Mathematics Mechanical engineering |
| Title | Parallel Optimization of Polynomials for Large-scale Problems in Stability and Control |
| URI | https://www.proquest.com/docview/1791450750 |
| hasFullText | 1 |
| inHoldings | 1 |
| isFullTextHit | |
| isPrint | |
| link | http://cvtisr.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwpV09T8MwED1BYQAGvsVHQR5YLZoPO_HEUEAMUDJUqFt1iW1UqSTQFKT-e86pWyohsTBGXiI7uXvvfO8ewBXxLYthgNwaSQRF24JjjBHPKVukSqaYK9uYTSS9XjoYqMwX3GrfVrmIiU2g1lXhauTXboxmLFyCu3n_4M41yt2ueguNddhw6tpG7LsKf5ZsnZiYSggMp9KPeVo8h79icJNY7nf_-0p7sHO7cqO-D2umPIDtp-Uw1voQXjKcOMeUMXum-PDmhZessiyrxjMnS6ZPkBF4ZY-uLZzXdGyGZXOnmZqNSkaItOmhnTEsNevOu9uPoH9_1-8-cG-nwF8lccTYSmNMlCiRagxCYzCXAWqhpROkoohEHgtDax0dqjwlnhHGFk0z8i2OMIyOoVVWpTkBpgqrOoRjCF1q4p8Wk462ygQyd2wzEKfQXmzY0P8S9fBnt87-Xj6HLUIlvs7RhtZ08mkuYLP4mo7qyWVzwt9A_rAt |
| linkProvider | ProQuest |
| linkToHtml | http://cvtisr.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMw1V25TsNAEB1FAYmj4BZHgC2gtIivtbdAFAlRohy4iFA6a-3dRZGCDXEA5aP4R2YdGyIh0aWgtLayZ3bmvfHMG4Ar5FuKWyY3lKRIUISKDe5w24gwW_iM-jxiKl824Q0G_mjEggp8lrMwuq2yjIl5oBZprGvkN1pG03F1grt7eTX01ij9d7VcobFwi66cfyBly247TbTvtWW17oeNtlFsFTCeKFIlR1Eppe0x1xfctKTkETW5cAXVc5nctd3IcSWe1YXFIh_htuUoLnPlM8fmWucAI_6ao5Xu9GzxMtr6Lg4g8WMeYm-fFqpS5bP1K-Tneay188--wC5sN5f6BfagIpN92Op_S81mB_AY8KneBzMhDxj9nouxUpIqEqSTuR66xgtGEJqTnm56NzJ0SkmCxR6djIwTgng77xCeE54I0lj07h_CcBUvdQTVJE3kMRAWK1ZHlIbYWSC7VtyrC8WkSSPNpU33BGqlfcLiwmfhj3FO_z6-hI32sN8Le51B9ww2EX8VFZ0aVGfTN3kO6_H7bJxNL3LnIhCu2JRfTL0LWQ |
| openUrl | ctx_ver=Z39.88-2004&ctx_enc=info%3Aofi%2Fenc%3AUTF-8&rfr_id=info%3Asid%2Fsummon.serialssolutions.com&rft_val_fmt=info%3Aofi%2Ffmt%3Akev%3Amtx%3Adissertation&rft.genre=dissertation&rft.title=Parallel+Optimization+of+Polynomials+for+Large-scale+Problems+in+Stability+and+Control&rft.DBID=053%3B054%3B0BH%3B0EK%3BABJCF%3BABQRF%3BABRGS%3BAFLLJ%3BAFOKG%3BARAPS%3BBGLVJ%3BCBPLH%3BEU9%3BG20%3BHCIFZ%3BM8-%3BPHGZM%3BPHGZT%3BPKEHL%3BPQEST%3BPQGLB%3BPQQKQ%3BPQUKI&rft.PQPubID=18750&rft.au=Kamyar%2C+Reza&rft.date=2016-01-01&rft.pub=ProQuest+Dissertations+%26+Theses&rft.isbn=1339704986&rft.externalDBID=HAS_PDF_LINK&rft.externalDocID=4068490011 |
| thumbnail_l | http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=9781339704982/lc.gif&client=summon&freeimage=true |
| thumbnail_m | http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=9781339704982/mc.gif&client=summon&freeimage=true |
| thumbnail_s | http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=9781339704982/sc.gif&client=summon&freeimage=true |