<?xml version="1.0" encoding="UTF-8"?><?xml-stylesheet type="text/xsl" href="static/style.xsl"?><OAI-PMH xmlns="http://www.openarchives.org/OAI/2.0/" xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance" xsi:schemaLocation="http://www.openarchives.org/OAI/2.0/ http://www.openarchives.org/OAI/2.0/OAI-PMH.xsd"><responseDate>2026-11-22T17:59:05Z</responseDate><request verb="GetRecord" identifier="oai:uwspace.uwaterloo.ca:10012/19463" metadataPrefix="dim">https://dspacemainprd01.lib.uwaterloo.ca/server/oai/request</request><GetRecord><record><header><identifier>oai:uwspace.uwaterloo.ca:10012/19463</identifier><datestamp>2025-03-26T23:37:19Z</datestamp><setSpec>com_10012_9924</setSpec><setSpec>com_10012_1</setSpec><setSpec>col_10012_9928</setSpec><setSpec>col_10012_6</setSpec></header><metadata><dim:dim xmlns:dim="http://www.dspace.org/xmlns/dspace/dim" xmlns:doc="http://www.lyncode.com/xoai" xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance" xsi:schemaLocation="http://www.dspace.org/xmlns/dspace/dim http://www.dspace.org/schema/dim.xsd">
   <dim:field mdschema="dc" element="contributor" qualifier="advisor">Tuncel, Levent</dim:field>
   <dim:field mdschema="dc" element="contributor" qualifier="author" authority="f22aa06a-d6e6-4673-af70-b2f649ae9324" confidence="600">Gong, Rui</dim:field>
   <dim:field mdschema="dc" element="date" qualifier="accessioned">2023-05-19T19:54:09Z</dim:field>
   <dim:field mdschema="dc" element="date" qualifier="available">2023-05-19T19:54:09Z</dim:field>
   <dim:field mdschema="dc" element="date" qualifier="issued">2023-05-19</dim:field>
   <dim:field mdschema="dc" element="date" qualifier="submitted">2023-05-17</dim:field>
   <dim:field mdschema="dc" element="identifier" qualifier="uri">http://hdl.handle.net/10012/19463</dim:field>
   <dim:field mdschema="dc" element="description" qualifier="abstract" lang="en">We study the problem of decomposing a symmetric matrix into the sum of a low-rank symmetric positive semidefinite matrix and a tridiagonal matrix, and a relaxation which looks for symmetric positive semidefinite matrices with small nuclear norms. These problems are generalizations of&#xd;
the problem of decomposing a symmetric matrix into a low-rank symmetric positive semidefinite&#xd;
matrix plus a diagonal matrix and one of its relaxations, the minimum trace factor analysis problem. We also show that for the relaxation of the low-rank plus tridiagonal decomposition problem&#xd;
with regularizations on the tridiagonal matrix, the optimal solution is unique when the nonnegative&#xd;
regularizing coefficient is not 2. Then, given such a coefficient λ ∈ R+ \ {2}, we consider three&#xd;
problems. The first problem is decomposing a matrix into a low-rank symmetric positive semidefi-&#xd;
nite matrix and a tridiagonal matrix. The second is to determine the facial structure of E′&#xd;
n, which is&#xd;
the set of correlation matrices whose absolute values of entries right below and above the diagonal&#xd;
entries are upper bounded by λ/2. And the third problem is that given strictly positive integers k, n&#xd;
with n &amp;gt; k, and points v1, . . . , vn ∈ Rk, determine if there exists a centered (degenerate) ellipsoid&#xd;
passing through all these points exactly such that when the points are projected onto the unit ball&#xd;
corresponding to the ellipsoid, for every i, the cosine value of the angle between the projected ith&#xd;
and (i + 1)th points is upper bounded by λ/2 and lower bounded by −λ/2. We then prove that all&#xd;
these three problems are equivalent and when the regularization coefficient λ goes to infinity, we&#xd;
show the equivalence between them and the corresponding properties of the low-rank plus diagonal&#xd;
decomposition problem.&#xd;
We also provide a sufficient condition on a subspace U for us to find a nonempty face of&#xd;
E′&#xd;
n defined by U. By the equivalence above, this is also a sufficient condition for the other two&#xd;
problems.&#xd;
After that, we prove that the low-rank plus tridiagonal problem can be solved in polynomial time when the rank of the positive semidefinite matrix in the decomposition is bounded above by&#xd;
an absolute constant.&#xd;
In the end, we consider representing our problem as a conic programming problem and generalizing it to general sparsity patterns.</dim:field>
   <dim:field mdschema="dc" element="language" qualifier="iso" lang="en">en</dim:field>
   <dim:field mdschema="dc" element="publisher" lang="en">University of Waterloo</dim:field>
   <dim:field mdschema="dc" element="subject" lang="en">low-rank plus sparse decomposition</dim:field>
   <dim:field mdschema="dc" element="subject" lang="en">semidefinite programming</dim:field>
   <dim:field mdschema="dc" element="subject" lang="en">subspace coherence</dim:field>
   <dim:field mdschema="dc" element="title" lang="en">Low-Rank Plus Sparse Decompositions of Large-Scale Matrices via Semidefinite Optimization</dim:field>
   <dim:field mdschema="dc" element="type" lang="en">Master Thesis</dim:field>
   <dim:field mdschema="dc" element="pending">false</dim:field>
   <dim:field mdschema="uws-etd" element="degree" qualifier="department" lang="en">Combinatorics and Optimization</dim:field>
   <dim:field mdschema="uws-etd" element="degree" qualifier="discipline" lang="en">Combinatorics and Optimization</dim:field>
   <dim:field mdschema="uws-etd" element="degree" qualifier="grantor" lang="en">University of Waterloo</dim:field>
   <dim:field mdschema="uws-etd" element="degree" lang="en">Master of Mathematics</dim:field>
   <dim:field mdschema="uws-etd" element="embargo" qualifier="terms" lang="en">0</dim:field>
   <dim:field mdschema="uws" element="contributor" qualifier="advisor">Tuncel, Levent</dim:field>
   <dim:field mdschema="uws" element="contributor" qualifier="affiliation1" lang="en">Faculty of Mathematics</dim:field>
   <dim:field mdschema="uws" element="published" qualifier="city" lang="en">Waterloo</dim:field>
   <dim:field mdschema="uws" element="published" qualifier="country" lang="en">Canada</dim:field>
   <dim:field mdschema="uws" element="published" qualifier="province" lang="en">Ontario</dim:field>
   <dim:field mdschema="uws" element="typeOfResource" lang="en">Text</dim:field>
   <dim:field mdschema="uws" element="peerReviewStatus" lang="en">Unreviewed</dim:field>
   <dim:field mdschema="uws" element="scholarLevel" lang="en">Graduate</dim:field>
   <dim:field mdschema="others" element="access-status">open.access</dim:field>
</dim:dim>
</metadata></record></GetRecord></OAI-PMH>