Description
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.
Copyright Statement
Download count: 0
Details
Contributors
- Kamyar, Reza (Author)
- Peet, Matthew (Thesis advisor)
- Berman, Spring (Committee member)
- Rivera, Daniel (Committee member)
- Artemiadis, Panagiotis (Committee member)
- Fainekos, Georgios (Committee member)
- Arizona State University (Publisher)
Date Created
The date the item was original created (prior to any relationship with the ASU Digital Repositories.)
2016
Subjects
- Mechanical Engineering
- Mathematics
- energy
- Convex Optimization
- Lyapunov theory
- Optimal energy storage
- Parallel Computing
- Polynomial optimization
- stability analysis
- Control Theory
- Parallel processing (Electronic computers)
- Mathematical optimization
- Polynomials
- Stability--Mathematical models.
- stability
Resource Type
Collections this item is in
Note
- Partial requirement for: Ph.D., Arizona State University, 2016Note typethesis
- Includes bibliographical references (pages 198-208)Note typebibliography
- Field of study: Mechanical engineering
Citation and reuse
Statement of Responsibility
by Reza Kamyar