Back to search

Cornell University

Large scale semidefinite programming: simplicity, conditioning, and an efficient algorithm

Abstract

dc:description.abstract

This thesis studies large scale semidefinite programming arising from modern applications. We first identify a set of regularity conditions, which we call simplicity, and show it holds in both a generic sense and in many practical applications. Next, based on simplicity, we derive conditioning results: error bounds and sensitivity of solution. Finally, we design an algorithm that is provably computationally efficient in terms of storage and time under simplicity.

Degree

thesis:*
Name thesis:degree_name
Ph. D., Operations Research and Information Engineering
Level thesis:degree_level
Doctor of Philosophy
Discipline thesis:degree_discipline
Operations Research and Information Engineering
Grantor
Cornell University
Year dc:date.issued
2021

Author and committee

dc:creator, dc:contributor.*
Author dc:creator
  • Ding, Lijun
Chair dc:contributor.chair
  • Chen, Yudong
Committee members dc:contributor.committeemember
  • Udell, Madeleine Richards
  • Renegar, James
  • Lewis, Adrian S.

Rights

dc:rights
Statement dc:rights
  • Attribution 4.0 International
Language dc:language.iso
en

Identifiers

dc:identifier.*
Dc Identifier Bibid
15312778
Dc Identifier Other
ProQuest Submission ID: 12784
ProQuest Publication ID: 28718816

Chain of custody

source
Harvested from
Cornell University
Base URL
ecommons.cornell.edu/server/oai/request
Last updated
2026-11-19
Source record
OAI-PMH GetRecord
citation

Ding, Lijun. Large scale semidefinite programming: simplicity, conditioning, and an efficient algorithm. Doctor of Philosophy thesis, Cornell University, 2021. https://hdl.handle.net/1813/110818