Related references
Note: Only part of the references are listed.From error bounds to the complexity of first-order descent methods for convex functions
Jerome Bolte et al.
MATHEMATICAL PROGRAMMING (2017)
A unified approach to error bounds for structured convex optimization problems
Zirui Zhou et al.
MATHEMATICAL PROGRAMMING (2017)
An Inertial Tseng's Type Proximal Algorithm for Nonsmooth and Nonconvex Optimization Problems
Radu Ioan Bot et al.
JOURNAL OF OPTIMIZATION THEORY AND APPLICATIONS (2016)
Douglas-Rachford splitting for nonconvex optimization with application to nonconvex feasibility problems
Guoyin Li et al.
MATHEMATICAL PROGRAMMING (2016)
Alternating direction method of multipliers for penalized zero-variance discriminant analysis
Brendan P. W. Ames et al.
COMPUTATIONAL OPTIMIZATION AND APPLICATIONS (2016)
CONVERGENCE ANALYSIS OF ALTERNATING DIRECTION METHOD OF MULTIPLIERS FOR A FAMILY OF NONCONVEX PROBLEMS
Mingyi Hong et al.
SIAM JOURNAL ON OPTIMIZATION (2016)
On the Convergence of the Iterates of the Fast Iterative Shrinkage/Thresholding Algorithm
A. Chambolle et al.
JOURNAL OF OPTIMIZATION THEORY AND APPLICATIONS (2015)
GLOBAL CONVERGENCE OF SPLITTING METHODS FOR NONCONVEX COMPOSITE OPTIMIZATION
Guoyin Li et al.
SIAM JOURNAL ON OPTIMIZATION (2015)
Splitting Methods with Variable Metric for Kurdyka-Aojasiewicz Functions and General Convergence Rates
Pierre Frankel et al.
JOURNAL OF OPTIMIZATION THEORY AND APPLICATIONS (2015)
New fractional error bounds for polynomial systems with applications to Holderian stability in optimization and spectral theory of tensors
G. Li et al.
MATHEMATICAL PROGRAMMING (2015)
iPiano: Inertial Proximal Algorithm for Nonconvex Optimization
Peter Ochs et al.
SIAM JOURNAL ON IMAGING SCIENCES (2014)
Convergence of descent methods for semi-algebraic and tame problems: proximal algorithms, forward-backward splitting, and regularized Gauss-Seidel methods
Hedy Attouch et al.
MATHEMATICAL PROGRAMMING (2013)
A Block Coordinate Descent Method for Regularized Multiconvex Optimization with Applications to Nonnegative Tensor Factorization and Completion
Yangyang Xu et al.
SIAM JOURNAL ON IMAGING SCIENCES (2013)
NEARLY UNBIASED VARIABLE SELECTION UNDER MINIMAX CONCAVE PENALTY
Cun-Hui Zhang
ANNALS OF STATISTICS (2010)
Approximation accuracy, gradient methods, and error bound for structured convex optimization
Paul Tseng
MATHEMATICAL PROGRAMMING (2010)
Proximal Alternating Minimization and Projection Methods for Nonconvex Problems: An Approach Based on the Kurdyka-Lojasiewicz Inequality
Hedy Attouch et al.
MATHEMATICS OF OPERATIONS RESEARCH (2010)
A coordinate gradient descent method for nonsmooth separable minimization
Paul Tseng et al.
MATHEMATICAL PROGRAMMING (2009)
Iterative Thresholding for Sparse Approximations
Thomas Blumensath et al.
JOURNAL OF FOURIER ANALYSIS AND APPLICATIONS (2008)
Efficient Reconstruction of Piecewise Constant Images Using Nonsmooth Nonconvex Minimization
Mila Nikolova et al.
SIAM Journal on Imaging Sciences (2008)
Convergence of neural networks for programming problems via a nonsmooth Lojasiewicz inequality
Mauro Forti et al.
IEEE TRANSACTIONS ON NEURAL NETWORKS (2006)
Geometrical interpretation of the predictor-corrector type algorithms in structured optimization problems
Aris Daniilidis et al.
OPTIMIZATION (2006)
Model selection and estimation in regression with grouped variables
M Yuan et al.
JOURNAL OF THE ROYAL STATISTICAL SOCIETY SERIES B-STATISTICAL METHODOLOGY (2006)
Active sets, nonsmoothness, and sensitivity
AS Lewis
SIAM JOURNAL ON OPTIMIZATION (2003)
Share Paper
