An accelerated Newton's method for projections onto the ℓ1-ball

Research output: Chapter in Book/Report/Conference proceedingConference contributionpeer-review

7 Scopus citations

Abstract

We present a simple and computationally efficient algorithm, based on the accelerated Newton's method, to solve the root finding problem associated with the projection onto the ℓ1-ball problem. Considering an interpretation of the Michelot's algorithm as Newton method, our algorithm can be understood as an accelerated version of the Michelot's algorithm, that needs significantly less major iterations to converge to the solution. Although the worst-case performance of the propose algorithm is O(n2), it exhibits in practice an O(n) performance and it is empirically demonstrated that it is competitive or faster than existing methods.

Original languageEnglish
Title of host publication2017 IEEE International Workshop on Machine Learning for Signal Processing, MLSP 2017 - Proceedings
EditorsNaonori Ueda, Jen-Tzung Chien, Tomoko Matsui, Jan Larsen, Shinji Watanabe
PublisherIEEE Computer Society
Pages1-4
Number of pages4
ISBN (Electronic)9781509063413
DOIs
StatePublished - 5 Dec 2017
Event2017 IEEE International Workshop on Machine Learning for Signal Processing, MLSP 2017 - Tokyo, Japan
Duration: 25 Sep 201728 Sep 2017

Publication series

NameIEEE International Workshop on Machine Learning for Signal Processing, MLSP
Volume2017-September
ISSN (Print)2161-0363
ISSN (Electronic)2161-0371

Conference

Conference2017 IEEE International Workshop on Machine Learning for Signal Processing, MLSP 2017
Country/TerritoryJapan
CityTokyo
Period25/09/1728/09/17

Keywords

  • Accelerated Newton's method
  • Simplex
  • ℓ-Norm ball

Fingerprint

Dive into the research topics of 'An accelerated Newton's method for projections onto the ℓ1-ball'. Together they form a unique fingerprint.

Cite this