Heuristics for large-scale semidefiniite programming for the K disjoint clique problem
| dc.contributor | Halpern, David | |
| dc.contributor | Melnykov, Volodymry | |
| dc.contributor | Zhao, Shan | |
| dc.contributor | Zhu, Wei | |
| dc.contributor.advisor | Ames, Brendan | |
| dc.contributor.author | Barnes, Alexander Putnam | |
| dc.contributor.other | University of Alabama Tuscaloosa | |
| dc.date.accessioned | 2018-12-14T18:11:48Z | |
| dc.date.available | 2018-12-14T18:11:48Z | |
| dc.date.issued | 2018 | |
| dc.description | Electronic Thesis or Dissertation | en_US |
| dc.description.abstract | Large-scale semidefinite programming has many applications, including optimal control, computer vision, and machine learning. However, current algorithms for solving semidefinite programs (SDPs) can be time consuming and memory intensive. We look at new heuristics for solutions of the K disjoint clique problem. We model the K disjoint clique optimization problem as a SDP based on non-convex low rank factorization, and solve using Alternating Direction Method of Multipliers, augmented Lagrangian, and alternating direction. We will present numerical results illustrating the efficacy of our approach for clustering of real and simulated data and pose future questions of interest. | en_US |
| dc.format.extent | 116 p. | |
| dc.format.medium | electronic | |
| dc.format.mimetype | application/pdf | |
| dc.identifier.other | u0015_0000001_0003080 | |
| dc.identifier.other | Barnes_alatus_0004D_13546 | |
| dc.identifier.uri | http://ir.ua.edu/handle/123456789/5212 | |
| dc.language | English | |
| dc.language.iso | en_US | |
| dc.publisher | University of Alabama Libraries | |
| dc.relation.hasversion | born digital | |
| dc.relation.ispartof | The University of Alabama Electronic Theses and Dissertations | |
| dc.relation.ispartof | The University of Alabama Libraries Digital Collections | |
| dc.rights | All rights reserved by the author unless otherwise indicated. | en_US |
| dc.subject | Mathematics | |
| dc.title | Heuristics for large-scale semidefiniite programming for the K disjoint clique problem | en_US |
| dc.type | thesis | |
| dc.type | text | |
| etdms.degree.department | University of Alabama. Department of Mathematics | |
| etdms.degree.discipline | Mathematics | |
| etdms.degree.grantor | The University of Alabama | |
| etdms.degree.level | doctoral | |
| etdms.degree.name | Ph.D. |
Files
Original bundle
1 - 1 of 1