Accelerated proximal incremental algorithm schemes for non-strongly convex functions

DOI10.1016/j.tcs.2019.10.030zbMath1435.68280OpenAlexW2980433822WikidataQ127018841 ScholiaQ127018841MaRDI QIDQ2297863

Ashkan Panahi, Morteza Haghir Chehreghani, Devdatt P. Dubhashi

Publication date: 20 February 2020

Published in: Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.tcs.2019.10.030

zbMATH Keywords

stochastic optimizationconvex optimizationnon-smooth optimizationsupport vector machineSAGAstochastic average gradientrate analysisSAGvector clustering

Mathematics Subject Classification ID

Classification and discrimination; cluster analysis (statistical aspects) (62H30) Convex programming (90C25) Learning and adaptive systems in artificial intelligence (68T05) Stochastic programming (90C15)

Uses Software

• UNLocBoX
• Scikit
• CIFAR
• Saga
• clusterpath

Cites Work

• Unnamed Item
• Smooth minimization of non-smooth functions
• Proximal Splitting Methods in Signal Processing
• Smoothing and First Order Methods: A Unified Framework
• First-Order Methods in Optimization
• Optimization Methods for Large-Scale Machine Learning
• A Proximal Stochastic Gradient Method with Progressive Variance Reduction
• Proximité et dualité dans un espace hilbertien
• Smoothed Variable Sample-Size Accelerated Proximal Methods for Nonsmooth Stochastic Convex Programs

This page was built for publication: Accelerated proximal incremental algorithm schemes for non-strongly convex functions