Show simple item record

dc.contributor.advisorBerger-Wolf, Tanyaen_US
dc.contributor.authorMaggioni, Marcoen_US
dc.date.accessioned2016-02-16T23:03:12Z
dc.date.available2016-02-16T23:03:12Z
dc.date.created2015-12en_US
dc.date.issued2016-02-16
dc.date.submitted2015-12en_US
dc.identifier.urihttp://hdl.handle.net/10027/20173
dc.description.abstractConvex optimization is a fundamental mathematical framework used for general problem solving. The computational time taken to optimize problems formulated as Linear Programming, Integer Linear Programming or Quadratic Programming has an immediate impact on countless application fields, and it is critical to determining which problems we will be able to solve in the future. Since the very beginning, the research community has always been investigating on new algorithmic and numerical techniques to speed up convex optimization. Recently, the focus has included parallel computer architectures and their ability to perform high-throughput computation. This dissertation continues on the same research direction developing novel computational techniques tailored for modern GPUs. We focus on problems with sparse structure which are, arguably, the most challenging to solve on throughput-oriented many-core architectures naturally well-suited for dense computations As original contribution, we combine the leading ideas in SpMV optimization on GPUs into an advanced sparse format known as AdELL+. We also speed up the class of optimization algorithms known as Interior Points Methods with GPU-based adaptive strategies to select between Cholesky factorization and Conjugate Gradient. Last, we design an incremental matrix data structure that provides the foundation for implementing “branch-and-cut” ILP solvers.en_US
dc.language.isoenen_US
dc.rightsen_US
dc.rightsCopyright 2015 Marco Maggionien_US
dc.subjectSpMVen_US
dc.subjectGPUen_US
dc.subjectInterior Point Methoden_US
dc.subjectConvex Optimizationen_US
dc.subjectLinear Programmingen_US
dc.subjectInteger Linear Programmingen_US
dc.subjectAdaptiveen_US
dc.subjectConjugate Gradienten_US
dc.subjectCholeskyen_US
dc.titleSparse Convex Optimization on GPUsen_US
thesis.degree.departmentComputer Scienceen_US
thesis.degree.disciplineComputer Scienceen_US
thesis.degree.grantorUniversity of Illinois at Chicagoen_US
thesis.degree.levelDoctoralen_US
thesis.degree.namePhD, Doctor of Philosophyen_US
dc.type.genrethesisen_US
dc.contributor.committeeMemberKshemkalyani, Ajayen_US
dc.contributor.committeeMemberKhokhar, Ashfaqen_US
dc.contributor.committeeMemberLiang, Jieen_US
dc.contributor.committeeMemberSantambrogio, Marco D.en_US
dc.type.materialtexten_US


Files in this item

Thumbnail

This item appears in the following Collection(s)

Show simple item record