Dissertation · 2013 · Open access

Parallel Sparse Optimization

Peng, Zhimin

Rice Research Repository (Rice University) · Published 27 August 2013

Read the free full textView at the publisherCite this paper

In brief

“Parallel Sparse Optimization” is a 2013 dissertation by Peng, Zhimin, published in Rice Research Repository (Rice University). OpenAlex counts 0 citations as of 16 November 2026. It is open access: the full text is free to read at Rice Research Repository (Rice University).

Citations
0
References
2
Authors
1

Abstract

This thesis proposes parallel and distributed algorithms for solving very largescale\nsparse optimization problems on computer clusters and clouds. Many modern\napplications problems from compressive sensing, machine learning and signal and\nimage processing involve large-scale data and can be modeled as sparse optimization\nproblems. Those problems are in such a large-scale that they can no longer\nbe processed on single workstations running single-threaded computing approaches.\nMoving to parallel/distributed/cloud computing becomes a viable option. I propose\ntwo approaches for solving these problems. The first approach is the distributed\nimplementations of a class of efficient proximal linear methods for solving convex\noptimization problems by taking advantages of the separability of the terms in the objective.\nThe second approach is a parallel greedy coordinate descent method (GRock),\nwhich greedily choose several entries to update in parallel in each iteration. I establish\nthe convergence of GRock and explain why it often performs exceptionally well for\nsparse optimization. Extensive numerical results on a computer cluster and Amazon\nEC2 demonstrate the efficiency and elasticity of my algorithms.

Cite this paper

Formatted from the catalogue record. Check names, capitals and page numbers against the paper before you submit.

APA 7

Zhimin, P. (2013). Parallel Sparse Optimization. Rice Research Repository (Rice University). https://hdl.handle.net/1911/77447

MLA 9

Zhimin, Peng,. “Parallel Sparse Optimization.” Rice Research Repository (Rice University), 2013. https://hdl.handle.net/1911/77447.

Chicago

Zhimin, Peng,. 2013. “Parallel Sparse Optimization.” Rice Research Repository (Rice University). https://hdl.handle.net/1911/77447.

Harvard

Zhimin, P. (2013) ‘Parallel Sparse Optimization’, Rice Research Repository (Rice University). Available at: https://hdl.handle.net/1911/77447.

IEEE

P. Zhimin, “Parallel Sparse Optimization,” Rice Research Repository (Rice University), 2013.

BibTeX

@phdthesis{zhimin2013parallel,
  title     = {{Parallel Sparse Optimization}},
  author    = {Zhimin, Peng,},
  year      = {2013},
  url       = {https://hdl.handle.net/1911/77447}
}

Download for a reference manager: BibTeX (.bib) · RIS for Zotero, Mendeley and EndNote (.ris)

Topic and keywords

Physical Sciences › Computer Science › Signal Processing › Sparse and Compressive Sensing Techniques

  • sparse optimization
  • parallel algorithms
  • distributed algorithms
  • convex optimization
  • coordinate descent
  • convergence analysis
  • cloud computing
  • cluster computing

Work with this paper

Most-cited papers in Computer Science

All highly cited Computer Science papers

Questions about this paper

How do I cite this paper in APA style?

Zhimin, P. (2013). Parallel Sparse Optimization. Rice Research Repository (Rice University). https://hdl.handle.net/1911/77447

How many times has this paper been cited?

0 times, according to OpenAlex on 16 November 2026. Google Scholar and Scopus count different sets of sources, so their numbers differ.

Is this paper free to read?

Yes. It is open access: read the free full text at Rice Research Repository (Rice University).

Who wrote this paper?

Peng, Zhimin.

Bibliographic data from OpenAlex (CC0), last checked 16 November 2026. ResearchGuru does not host this paper; the links go to the publisher or the repository that does.