System identification via Nuclear norm regularization

Loading...
Thumbnail Image

Persistent link to this item

Statistics
View Statistics

Journal Title

Journal ISSN

Volume Title

Title

System identification via Nuclear norm regularization

Published Date

2014-07

Publisher

Type

Thesis or Dissertation

Abstract

We study the subspace method for system identification, and look at algorithms that rely on nuclear norm regularization for solving this problem. We introduce our own algorithm for solving the problem, based on the alternating direction method of multipliers (ADMM). Our algorithm involves an iterative minimization step, which is solved using line search methods. We demonstrate the effectiveness of our algorithm on a particular real world example, as well as two benchmark examples. In addition, we compare the computational efficiency of our algorithm to that of other existing algorithms for solving the nuclear norm system identification problem, observing that for single-input single-output systems, our algorithm is faster than an existing interior-point method. We also note that our algorithm converges the fastest when we use a gradient descent direction in the iterative minimization step of the ADMM.

Description

University of Minnesota M.S. thesis. July 2014. Major: Electrical Engineering. Advisor: Mihailo R. Jovanovic. 1 computer file (PDF); vi, 29 pages.

Related to

Replaces

License

Series/Report Number

Funding information

Isbn identifier

Doi identifier

Previously Published Citation

Other identifiers

Suggested citation

Deshmane, Harshad. (2014). System identification via Nuclear norm regularization. Retrieved from the University Digital Conservancy, https://hdl.handle.net/11299/165456.

Content distributed via the University Digital Conservancy may be subject to additional license and use restrictions applied by the depositor. By using these files, users agree to the Terms of Use. Materials in the UDC may contain content that is disturbing and/or harmful. For more information, please see our statement on harmful content in digital repositories.