Fetching the paper…
Reading the bibliography…
Difference of convex (DC) functions cover a broad family of non-convex and possibly non-smooth and non-differentiable functions, and have wide applications in machine learning and statistics.
A fast iterative shrinkage-thresholding algorithm for linear inverse problems
Amir Beck and Marc Teboulle · 1936
Earlier work this paper cites.
Convex analysis
R. Tyrrell Rockafellar · 1970
Earlier work this paper cites.
Fast incremental method for smooth nonconvex optimization
Sashank J. Reddi, Suvrit Sra, Barnabás Póczos, and Alexander J. Smola · 1977
Earlier work this paper cites.
A method of solving a convex programming problem with convergence rate O(1/sqr(k))
Yurii Nesterov · 1983
Earlier work this paper cites.
Generalized differentiability / duality and optimization for problems dealing with differences of convex functions
J.-B. Hiriart-Urruty · 1985
Earlier work this paper cites.
Variational Analysis
R. Tyrrell Rockafellar and Roger J.-B. Wets · 1998
Earlier work this paper cites.
Dc programming: Overview
R. Horst and N. V. Thoai · 1999
Earlier work this paper cites.
Variable selection via nonconcave penalized likelihood and its oracle properties
Jianqing Fan and Runze Li · 2001
Earlier work this paper cites.
Enhancing sparsity by reweighted l1 minimization
Emmanuel J. Candès, Michael B. Wakin, and Stephen P. Boyd · 2008
Earlier work this paper cites.
Composite objective mirror descent
John C. Duchi, Shai Shalev-Shwartz, Yoram Singer, and Ambuj Tewari · 2010
Earlier work this paper cites.
Adaptive subgradient methods for online learning and stochastic optimization
John Duchi, Elad Hazan, and Yoram Singer · 2011
Earlier work this paper cites.
Convergence of descent methods for semi-algebraic and tame problems: proximal algorithms, forward–backward splitting, and regularized gauss–seidel methods
Hedy Attouch, Jérôme Bolte, and Benar Fux Svaiter · 2013
Earlier work this paper cites.
Stochastic first- and zeroth-order methods for nonconvex stochastic programming
Saeed Ghadimi and Guanghui Lan · 2013
Earlier work this paper cites.
A general iterative shrinkage and thresholding algorithm for non-convex regularized optimization problems
Pinghua Gong, Changshui Zhang, Zhaosong Lu, Jianhua Huang, and Jieping Ye · 2013
Earlier work this paper cites.
Gradient methods for minimizing composite functions
Yu. Nesterov · 2013
Earlier work this paper cites.
Proximal alternating linearized minimization for nonconvex and nonsmooth problems
Jérôme Bolte, Shoham Sabach, and Marc Teboulle · 2014
Earlier work this paper cites.
A proximal stochastic gradient method with progressive variance reduction
Lin Xiao and Tong Zhang · 2014
Cited alongside, same era.
Shuai Zhang and Jack Xin · 2014
Cited alongside, same era.
Gradient descent with proximal average for nonconvex and composite regularization
Wenliang Zhong and James T. Kwok · 2014
Cited alongside, same era.
Convex formulation for learning from positive and unlabeled data
Marthinus Du Plessis, Gang Niu, and Masashi Sugiyama · 2015
Cited alongside, same era.
Accelerated proximal gradient methods for nonconvex programming
Huan Li and Zhouchen Lin · 2015
Cited alongside, same era.
Stochastic Difference of Convex Algorithm and its Application to Training Deep Boltzmann Machines
Atsushi Nitanda and Taiji Suzuki · 2017
Later among the works it cites.
Stochastic DCA for the large-sum of non-convex functions problem and its application to group variable selection in classification
Hoai An Le Thi, Hoai Minh Le, Duy Nhat Phan, and Bach Tran · 2017
Later among the works it cites.
Zaiyi Chen and Tianbao Yang · 2018
Closest in time.
Stochastic subgradient method converges on tame functions
Damek Davis, Dmitriy Drusvyatskiy, Sham Kakade, and Jason D. Lee · 2018
Closest in time.
Efficiency of minimizing compositions of convex functions and smooth maps
D. Drusvyatskiy and C. Paquette · 2018
alphaXiv searches the wider corpus for related work and actual follow-ups.
alphaXiv is searching for related work…
Universal gradient methods for convex optimization problems
Yu Nesterov · 2015
Cited alongside, same era.
Minimization of ℓ1-2 for compressed sensing
Penghang Yin, Yifei Lou, Qi He, and Jack Xin · 2015
Cited alongside, same era.
Minimizing nonconvex non-separable functions
Yaoliang Yu, Xun Zheng, Micol Marchetti-Bowick, and Eric P. Xing · 2015
Cited alongside, same era.
Stochastic optimization with importance sampling for regularized loss minimization
Peilin Zhao and Tong Zhang · 2015
Cited alongside, same era.
Variance reduction for faster non-convex optimization
Zeyuan Allen-Zhu and Elad Hazan · 2016
Cited alongside, same era.
An inertial forward–backward algorithm for the minimization of the sum of two nonconvex functions
Radu Ioan Bot, Ernö Robert Csetnek, and Szilárd Csaba László · 2016
Cited alongside, same era.
Douglas-rachford splitting for nonconvex optimization with application to nonconvex feasibility problems
Guoyin Li and Ting Kei Pong · 2016
Cited alongside, same era.
Closest in time.
Convergence guarantees for a class of non-convex and non-smooth optimization problems
Koulik Khamaru and Martin Wainwright · 2018
Closest in time.
Accelerated stochastic algorithms for nonconvex finite-sum and multi-block optimization
Guanghui Lan and Yu Yang · 2018
Closest in time.
A successive difference-of-convex approximation method for a class of nonconvex nonsmooth optimization problems
Tianxiang Liu, Ting Kei Pong, and Akiko Takeda · 2018
Closest in time.
Dc programming and dca: thirty years of developments
Hoai An Le Thi and Tao Pham Dinh · 2018
Closest in time.
A proximal difference-of-convex algorithm with extrapolation
Bo Wen, Xiaojun Chen, and Ting Kei Pong · 2018
Closest in time.
Learning with non-convex truncated losses by SGD
Yi Xu, Shenghuo Zhu, Sen Yang, Chi Zhang, Rong Jin, and Tianbao Yang · 2018
Closest in time.
Lei Yang · 2018
Closest in time.
Minimization of transformed l _ 1 l\_1 penalty: theory, difference of convex function algorithm, and robust application in compressed sensing
Shuai Zhang and Jack Xin · 2018
Closest in time.
On the convergence rate of stochastic mirror descent for nonsmooth nonconvex optimization
Siqi Zhang and Niao He · 2018
Closest in time.
Stochastic gradient methods for non-smooth non-convex regularized optimization
Michael R. Metel and Akiko Takeda · 2019
Closest in time.