dc.contributor.author | Høisæther, Kristoffer Ulvik | |
dc.date.accessioned | 2018-08-21T22:03:03Z | |
dc.date.available | 2018-08-21T22:03:03Z | |
dc.date.issued | 2018 | |
dc.identifier.citation | Høisæther, Kristoffer Ulvik. Iterative Algorithms in Compressive Sensing. Master thesis, University of Oslo, 2018 | |
dc.identifier.uri | http://hdl.handle.net/10852/63480 | |
dc.description.abstract | The field of compressive sensing is a modern field in applied mathematics which receives a lot of attention. In this thesis, we will give some insight into the iterative algorithms used in compressive sensing. We will study in particular the primal-dual algorithm, as proposed by Chambolle and Pock, and Nesterov's algorithm, NESTA. In general, the primal-dual algorithm is a more traditional algorithm than NESTA. Nesterov proved that for general convex functions, the primal-dual algorithm cannot achieve a better convergence rate than O(1/k), where k is the number of iterations, whereas Nesterov's algorithm with general convex functions achieves a convergence rate of O(1/(k^2)). | eng |
dc.language.iso | eng | |
dc.subject | Compressive Sensing | |
dc.title | Iterative Algorithms in Compressive Sensing | eng |
dc.type | Master thesis | |
dc.date.updated | 2018-08-21T22:03:03Z | |
dc.creator.author | Høisæther, Kristoffer Ulvik | |
dc.identifier.urn | URN:NBN:no-66034 | |
dc.type.document | Masteroppgave | |
dc.identifier.fulltext | Fulltext https://www.duo.uio.no/bitstream/handle/10852/63480/1/hoisaether_thesis.pdf | |