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.

Reuse Permissions
  • Downloads
    pdf (6.3 MB)

    Download count: 0

    Details

    Contributors
    Date Created
    2016
    Resource Type
  • Text
  • Collections this item is in
    Note
    • Partial requirement for: Ph.D., Arizona State University, 2016
      Note type
      thesis
    • Includes bibliographical references (pages 198-208)
      Note type
      bibliography
    • Field of study: Mechanical engineering

    Citation and reuse

    Statement of Responsibility

    by Reza Kamyar

    Machine-readable links