Global ETD Search
Search theses and dissertations gathered from participating repositories worldwide. Every result links back to the library that holds it. No account is needed.
Results
Showing 1 to 10 of 10 for “"semidefinite optimization"”.
-
Algorithms and Software for Structured Semidefinite Optimization
… is to find solutions to large-and-sparse linear Semidefinite Programs (SDPs) with low-rank solutions and/or low-rank data, and we introduce a new code for the solution of these problems. We are investigating an Interior-Point (IP) approach to solve these problems. A general bottleneck of IP …
-
Low-Rank Plus Sparse Decompositions of Large-Scale Matrices via Semidefinite Optimization
… 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 the problem of decomposing a symmetric matrix into a low-rank …
-
Spectral Properties of Structured Kronecker Products and Their Applications
… information theory, differential equations and semidefinite optimization. Kronecker products enjoy useful algebraic properties that have proven to be useful in applications. The less-studied symmetric Kronecker product and skew-symmetric Kronecker product (a contribution of this thesis) arise in …
-
Optimizing Extremal Eigenvalues of Weighted Graph Laplacians and Associated Graph Realizations
… in spectral graph theory and combinatorial optimization (e.g., graph partition like max-cut and graph bipartition). Especially the pioneering work of M. Fiedler investigates extremal eigenvalues of weighted graph Laplacians and provides close connections to the node- and edge-connectivity of …
-
Semidefinite Facial Reduction for Low-Rank Euclidean Distance Matrix Completion
… of this thesis is the development of a theory of semidefinite facial reduction for the Euclidean distance matrix completion problem. Our key result shows a close connection between cliques in the graph of the partial Euclidean distance matrix and faces of the semidefinite cone containing the …
-
Bundle-type methods for dual atomic pursuit
We discuss a type of structured optimization problem called atomic pursuit, where the aim is to assemble a solution, using a given set of (possibly uncountably infinite) atoms, to fit a model to data, popularized in compressed sensing and machine learning. The solutions to atomic pursuit problems …
-
Geometric Ramifications of the Lovász Theta Function and Their Interplay with Duality
… are fundamental objects in combinatorial and semidefinite optimization. They are accompanied by a rich duality theory and deep connections to the geometric concept of orthonormal representations of graphs. In this thesis, we investigate several ramifications of the theory underlying these …
-
Variational optimization of second order density matrices for electronic structure calculation
… from the method’s formulation as a vast semidefinite optimization problem. We have implemented and compared several algorithms that exploit the specific structure of the problem. Even so, their slow speed remains prohibitive. Both the second order methods and the zeroth order boundary …
-
Optimal Control of Energy Efficient Buildings
… controller (RHC) is employed to solve the optimization problem with the so-called chance constraints governed by probability temperature levels. Furthermore, a constrained stochastic linear quadratic control (SLQC) approach was developed for such purposes. The cost function to be minimized …