Abstract
dc:descriptionThis thesis studies a widely-used solver SPGL1, which applies a general root-finding process to solve the basis pursuit denoising problem. This process involves a nested loop. The outer loop is an inexact Newton root-finding process, and the inner loop approximately solves LASSO (least absolute shrinkage and selection operator). We propose an accelerated dual method to accelerate the inner loop by optimizing the dual problem of LASSO on a low-dimensional space. Experimental results show that our accelerated method that can successfully reduce the total iteration counts. Our future work is to reduce the total running time of our accelerated method.
Degree
thesis:*- Name thesis:degree_name
- Master of Science - MSc
- Level thesis:degree_level
- master's
- Discipline thesis:degree_discipline
- Mathematics
- Grantor dc:publisher
- University of British Columbia
- Year dc:date
- 2019
Author and committee
dc:creator, dc:contributor.*- Author dc:creator
-
- Bao, Anyi
Rights
dc:rights- Statement dc:rights
-
- Attribution-NonCommercial-NoDerivatives 4.0 International
- Language dc:language
- eng
Identifiers
dc:identifier.*- Handle dc:identifier
- http://hdl.handle.net/2429/69644