Preprint · 2016 · Open access
Sparse Learning with Semi-Proximal-Based Strictly Contractive Peaceman-Rachford Splitting Method
arXiv (Cornell University) · Published 30 December 2016 · DOI 10.48550/arxiv.1612.09357
In brief
“Sparse Learning with Semi-Proximal-Based Strictly Contractive Peaceman-Rachford Splitting Method” is a 2016 preprint by Sen Na and Cho‐Jui Hsieh, published in arXiv (Cornell University). OpenAlex counts 3 citations as of 15 November 2026. It is open access: the full text is free to read at arXiv (Cornell University).
- Citations
- 3
- Most cited in
- 2018 (2)
- References
- 12
- Authors
- 2
Abstract
Minimizing sum of two functions under a linear constraint is what we called splitting problem. This convex optimization has wide applications in machine learning problems, such as Lasso, Group Lasso and Sparse logistic regression. A recent paper by Gu et al (2015) developed a Semi-Proximal-Based Strictly Contractive Peaceman-Rachford Splitting Method (SPB-SPRSM), which is an extension of Strictly Contractive Peaceman-Rachford Splitting Method (SPRSM) proposed by He et al (2014). By introducing semi-proximal terms and using two different relaxation factors, SPB-SPRSM showed a more flexiable applicability comparing to its origin SPRSM and widely-used Alternating Direction Method of Multipliers (ADMM) algorithm, although all of them have $O(1/t)$ convergence rate. In this paper, we develop a stochastic version of SPB-SPRSM algorithm, where only a subset of samples (even one sample) are used at each iteration. The resulting algorithm, Stochastic SPB-SPRSM, is more flexiable than Stochastic ADMM and other ADMM-based algorithms on both simulations and real datasets. Moreover, we prove $O(1/\sqrt{t})$ convergence rate in ergodic sense, which is the same with Stochastic ADMM algorithm under the same assumption. But as shown in He et al (2014) that SPRSM based algorithms will always converge faster than ADMM in apllication, our proposed algorithm will also preserve this advantage.
Cite this paper
Formatted from the catalogue record. Check names, capitals and page numbers against the paper before you submit.
APA 7
Na, S., & Hsieh, C. (2016). Sparse Learning with Semi-Proximal-Based Strictly Contractive Peaceman-Rachford Splitting Method. arXiv (Cornell University). https://doi.org/10.48550/arxiv.1612.09357
MLA 9
Na, Sen, and Cho‐Jui Hsieh. “Sparse Learning with Semi-Proximal-Based Strictly Contractive Peaceman-Rachford Splitting Method.” arXiv (Cornell University), 2016. https://doi.org/10.48550/arxiv.1612.09357.
Chicago
Na, Sen and Cho‐Jui Hsieh. 2016. “Sparse Learning with Semi-Proximal-Based Strictly Contractive Peaceman-Rachford Splitting Method.” arXiv (Cornell University). https://doi.org/10.48550/arxiv.1612.09357.
Harvard
Na, S. and Hsieh, C. (2016) ‘Sparse Learning with Semi-Proximal-Based Strictly Contractive Peaceman-Rachford Splitting Method’, arXiv (Cornell University). doi:10.48550/arxiv.1612.09357.
IEEE
S. Na and C. Hsieh, “Sparse Learning with Semi-Proximal-Based Strictly Contractive Peaceman-Rachford Splitting Method,” arXiv (Cornell University), 2016, doi: 10.48550/arxiv.1612.09357.
BibTeX
@misc{na2016sparse,
title = {{Sparse Learning with Semi-Proximal-Based Strictly Contractive Peaceman-Rachford Splitting Method}},
author = {Na, Sen and Hsieh, Cho‐Jui},
howpublished = {arXiv (Cornell University)},
year = {2016},
doi = {10.48550/arxiv.1612.09357},
url = {https://doi.org/10.48550/arxiv.1612.09357}
}
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
- convex optimization
- sparse learning
- stochastic optimization
- LASSO
- group lasso
- sparse logistic regression
- linear constraints
- convergence rate
Work with this paper
Most-cited papers in Computer Science
- ImageNet classification with deep convolutional neural networksAlex Krizhevsky, Ilya Sutskever, Geoffrey E. Hinton · Communications of the ACM · 2017 · 114,726 citations
- Long Short-Term MemorySepp Hochreiter, Jürgen Schmidhuber · Neural Computation · 1997 · 109,097 citations
- A Mathematical Theory of CommunicationClaude E. Shannon · Bell System Technical Journal · 1948 · 91,736 citations
- Deep learningYann LeCun, Yoshua Bengio, Geoffrey E. Hinton · Nature · 2015 · 90,226 citations
- Faster R-CNN: Towards Real-Time Object Detection with Region Proposal NetworksShaoqing Ren, Kaiming He, Ross Girshick and 1 more · IEEE Transactions on Pattern Analysis and Machine Intelligence · 2016 · 74,143 citations
Questions about this paper
How do I cite this paper in APA style?
Na, S., & Hsieh, C. (2016). Sparse Learning with Semi-Proximal-Based Strictly Contractive Peaceman-Rachford Splitting Method. arXiv (Cornell University). https://doi.org/10.48550/arxiv.1612.09357
How many times has this paper been cited?
3 times, according to OpenAlex on 15 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 arXiv (Cornell University).
Who wrote this paper?
Sen Na, Cho‐Jui Hsieh.
What is the DOI of this paper?
10.48550/arxiv.1612.09357. The permanent link is https://doi.org/10.48550/arxiv.1612.09357.
Bibliographic data from OpenAlex (CC0), last checked 15 November 2026. ResearchGuru does not host this paper; the links go to the publisher or the repository that does.