Studies on Matrix Completion and Partial Realization with Nuclear Norm Minimization

DSpace/Manakin Repository

Studies on Matrix Completion and Partial Realization with Nuclear Norm Minimization

Show full item record

Title: Studies on Matrix Completion and Partial Realization with Nuclear Norm Minimization
Author(s):
Dhanashetty, Nishita
Advisor: Vidyasagar, Mathukumalli
Date Created: 2017-05
Format: Thesis
Keywords: Compressed sensing (Telecommunication)
Matrices—Norms
MATLAB
Abstract: The field of Compressed Sensing addresses the problem of recovering relatively sparse entities from a limited number of data points. Low rank matrices arise in a wide range of settings in this field and two of its applications, Matrix Completion and Partial Realization, have been studied and analyzed in this thesis by the method of nuclear norm minimization. The method of alternating directions for nuclear norm minimization was applied to solve the matrix completion problem and the obtained MATLAB results were analyzed. The partial realization problem, which is a control systems application, was solved through the compressed sensing approach and a convex optimization package, and CVX was used to implement it on low order matrices. Computations were performed on different stable systems and the obtained results were presented and explained.
Degree Name: MSEE
Degree Level: Masters
Persistent Link: http://hdl.handle.net/10735.1/5465
Type : text
Degree Program: Electrical Engineering

Files in this item

Files Size Format View
DHANASHETTY-THESIS-2017.pdf 475.8Kb PDF View/Open

This item appears in the following Collection(s)


Show full item record