Service interruption on Monday 11 July from 12:30 to 13:00: all the sites of the CCSD (HAL, Epiciences, SciencesConf, AureHAL) will be inaccessible (network hardware connection).
Skip to Main content Skip to Navigation
Preprints, Working Papers, ...

PRISMA: PRoximal Iterative SMoothing Algorithm

Abstract : Motivated by learning problems including max-norm regularized matrix completion and clustering, robust PCA and sparse inverse covariance selection, we propose a novel optimization algorithm for minimizing a convex objective which decomposes into three parts: a smooth part, a simple non-smooth Lipschitz part, and a simple non-smooth non-Lipschitz part. We use a time variant smoothing strategy that allows us to obtain a guarantee that does not depend on knowing in advance the total number of iterations nor a bound on the domain.
Document type :
Preprints, Working Papers, ...
Complete list of metadata
Contributor : Puneet Kumar Dokania Connect in order to contact the contributor
Submitted on : Friday, August 30, 2013 - 11:57:56 AM
Last modification on : Friday, January 21, 2022 - 3:01:24 AM

Links full text


  • HAL Id : hal-00855993, version 1
  • ARXIV : 1206.2372



Francesco Orabona, Andreas Argyriou, Nathan Srebro. PRISMA: PRoximal Iterative SMoothing Algorithm. 2012. ⟨hal-00855993⟩



Record views