國立高雄大學圖資館 |

Language: English

Back

Structured Low-Rank Matrix Recovery ...

Colorado School of Mines.

Structured Low-Rank Matrix Recovery via Optimization Methods.

Record Type:	Electronic resources : Monograph/item
Title/Author:	Structured Low-Rank Matrix Recovery via Optimization Methods.
Author:	Yang, Dehui.
Published:	Ann Arbor : ProQuest Dissertations & Theses, 2018
Description:	133 p.
Notes:	Source: Dissertation Abstracts International, Volume: 79-08(E), Section: B.
Notes:	Adviser: Michael B. Wakin.
Contained By:	Dissertation Abstracts International79-08B(E).
Subject:	Electrical engineering.
Online resource:	http://pqdd.sinica.edu.tw/twdaoapp/servlet/advanced?query=10744504
ISBN:	9780355772456

Structured Low-Rank Matrix Recovery via Optimization Methods.
Yang, Dehui.

Structured Low-Rank Matrix Recovery via Optimization Methods. - Ann Arbor : ProQuest Dissertations & Theses, 2018 - 133 p.

Source: Dissertation Abstracts International, Volume: 79-08(E), Section: B.

Thesis (Ph.D.)--Colorado School of Mines, 2018.

From single-molecule microscopy in biology, to collaborative filtering in recommendation systems, to quantum state tomography in physics, many scientific discoveries involve solving ill-posed inverse problems, where the number of parameters to be estimated far exceeds the number of available measurements. To make these daunting problems solvable, low-dimensional geometric structures are often exploited, and regularizations that promote underlying structures are used for various inference tasks. To date, one of the most effective and plausible low-dimensional models for matrix data is the low-rank structure, which assumes that columns of the data matrix are correlated and lie in a low-dimensional subspace. This helps make certain matrix inverse problems well-posed. However, in some cases, standard low-rank structure is not powerful enough for modeling the underlying data generating process, and additional modeling efforts are desired. This is the main focus of this research.

ISBN: 9780355772456Subjects--Topical Terms:

454503
Electrical engineering.

Structured Low-Rank Matrix Recovery via Optimization Methods.
LDR:02992nmm a2200325 4500 001 547537
005 20190513114555.5
008 190715s2018 ||||||||||||||||| ||eng d
020 $a 9780355772456
035 $a (MiAaPQ)AAI10744504
035 $a (MiAaPQ)mines:11442
035 $a AAI10744504
040 $a MiAaPQ $c MiAaPQ
100 1 $a Yang, Dehui. $3 826831
245 1 0 $a Structured Low-Rank Matrix Recovery via Optimization Methods.
260 1 $a Ann Arbor : $b ProQuest Dissertations & Theses, $c 2018
300 $a 133 p.
500 $a Source: Dissertation Abstracts International, Volume: 79-08(E), Section: B.
500 $a Adviser: Michael B. Wakin.
502 $a Thesis (Ph.D.)--Colorado School of Mines, 2018.
520 $a From single-molecule microscopy in biology, to collaborative filtering in recommendation systems, to quantum state tomography in physics, many scientific discoveries involve solving ill-posed inverse problems, where the number of parameters to be estimated far exceeds the number of available measurements. To make these daunting problems solvable, low-dimensional geometric structures are often exploited, and regularizations that promote underlying structures are used for various inference tasks. To date, one of the most effective and plausible low-dimensional models for matrix data is the low-rank structure, which assumes that columns of the data matrix are correlated and lie in a low-dimensional subspace. This helps make certain matrix inverse problems well-posed. However, in some cases, standard low-rank structure is not powerful enough for modeling the underlying data generating process, and additional modeling efforts are desired. This is the main focus of this research.
520 $a Motivated by applications from different disciplines in engineering and science, in this dissertation, we consider the recovery of three instances of structured matrices from limited measurement data, where additional structures naturally occur in the data matrices beyond simple low-rankness. The structured matrices that we consider include i) low-rank and spectrally sparse matrices in super-resolution imaging; ii) low-rank skew-symmetric matrices in pairwise comparisons; iii) and low-rank positive semidefinite matrices in physical and data sciences. Using optimization as a tool, we develop new regularizers and computationally efficient algorithmic frameworks to account for structured low-rankness in solving these ill-posed inverse problems. For some of the problems considered in this dissertation, theoretical analysis is also carried out for the proposed optimization programs. We show that, under mild conditions, the structured low-rank matrices can be recovered reliably from a minimal number of random measurements.
590 $a School code: 0052.
650 4 $a Electrical engineering. $3 454503
650 4 $a Applied mathematics. $3 377601
650 4 $a Computer science. $3 199325
690 $a 0544
690 $a 0364
690 $a 0984
710 2 $a Colorado School of Mines. $b Electrical Engineering and Computer Sciences. $3 826832
773 0 $t Dissertation Abstracts International $g 79-08B(E).
790 $a 0052
791 $a Ph.D.
792 $a 2018
793 $a English
856 4 0 $u http://pqdd.sinica.edu.tw/twdaoapp/servlet/advanced?query=10744504