相关参考文献
注意：仅列出部分参考文献，下载原文获取全部文献信息。Nonsmooth optimization using Taylor-like models: error bounds, convergence, and termination criteria
D. Drusvyatskiy et al.
MATHEMATICAL PROGRAMMING (2021)
The multiproximal linearization method for convex composite problems
Jerome Bolte et al.
MATHEMATICAL PROGRAMMING (2020)
THE BOOSTED DIFFERENCE OF CONVEX FUNCTIONS ALGORITHM FOR NONSMOOTH FUNCTIONS
Francisco J. Aragon Artacho et al.
SIAM JOURNAL ON OPTIMIZATION (2020)
Efficiency of minimizing compositions of convex functions and smooth maps
D. Drusvyatskiy et al.
MATHEMATICAL PROGRAMMING (2019)
A refined convergence analysis of pDCAe with applications to simultaneous sparse recovery and outlier detection
Tianxiang Liu et al.
COMPUTATIONAL OPTIMIZATION AND APPLICATIONS (2019)
Non-smooth DC-constrained optimization: constraint qualification and minimizing methodologies
W. van Ackooij et al.
OPTIMIZATION METHODS & SOFTWARE (2019)
UNIFYING ABSTRACT INEXACT CONVERGENCE THEOREMS AND BLOCK COORDINATE VARIABLE METRIC IPIANO
Peter Ochs
SIAM JOURNAL ON OPTIMIZATION (2019)
Calculus of the Exponent of Kurdyka-Aojasiewicz Inequality and Its Applications to Linear Convergence of First-Order Methods
Guoyin Li et al.
FOUNDATIONS OF COMPUTATIONAL MATHEMATICS (2018)
A local search method for optimization problem with d.c. inequality constraints
Alexander S. Strekalovsky et al.
APPLIED MATHEMATICAL MODELLING (2018)
DC programming and DCA: thirty years of developments
Hoai An Le Thi et al.
MATHEMATICAL PROGRAMMING (2018)
Error Bounds, Quadratic Growth, and Linear Convergence of Proximal Methods
Dmitriy Drusvyatskiy et al.
MATHEMATICS OF OPERATIONS RESEARCH (2018)
DOUBLE BUNDLE METHOD FOR FINDING CLARKE STATIONARY POINTS IN NONSMOOTH DC PROGRAMMING
Kaisa Joki et al.
SIAM JOURNAL ON OPTIMIZATION (2018)
A proximal difference-of-convex algorithm with extrapolation
Bo Wen et al.
COMPUTATIONAL OPTIMIZATION AND APPLICATIONS (2018)
From error bounds to the complexity of first-order descent methods for convex functions
Jerome Bolte et al.
MATHEMATICAL PROGRAMMING (2017)
Majorization-Minimization Algorithms in Signal Processing, Communications, and Machine Learning
Ying Sun et al.
IEEE TRANSACTIONS ON SIGNAL PROCESSING (2017)
Computing B-Stationary Points of Nonsmooth DC Programs
Jong-Shi Pang et al.
MATHEMATICS OF OPERATIONS RESEARCH (2017)
A dual method for minimizing a nonsmooth objective over one smooth inequality constraint
Ron Shefi et al.
MATHEMATICAL PROGRAMMING (2016)
Douglas-Rachford splitting for nonconvex optimization with application to nonconvex feasibility problems
Guoyin Li et al.
MATHEMATICAL PROGRAMMING (2016)
A proximal method for composite minimization
A. S. Lewis et al.
MATHEMATICAL PROGRAMMING (2016)
Variations and extension of the convex-concave procedure
Thomas Lipp et al.
OPTIMIZATION AND ENGINEERING (2016)
Majorization-Minimization Procedures and Convergence of SQP Methods for Semi-Algebraic and Tame Programs
Jerome Bolte et al.
MATHEMATICS OF OPERATIONS RESEARCH (2016)
The value function approach to convergence analysis in composite optimization
Edouard Pauwels
OPERATIONS RESEARCH LETTERS (2016)
Robust compressive sensing of sparse signals: a review
Rafael E. Carrillo et al.
EURASIP JOURNAL ON ADVANCES IN SIGNAL PROCESSING (2016)
MINIMIZATION OF l1-2 FOR COMPRESSED SENSING
Penghang Yin et al.
SIAM JOURNAL ON SCIENTIFIC COMPUTING (2015)
Proximal alternating linearized minimization for nonconvex and nonsmooth problems
Jerome Bolte et al.
MATHEMATICAL PROGRAMMING (2014)
ANALYSIS OF THE CONVERGENCE RATE FOR THE CYCLIC PROJECTION ALGORITHM APPLIED TO BASIC SEMIALGEBRAIC CONVEX SETS
Jonathan M. Borwein et al.
SIAM JOURNAL ON OPTIMIZATION (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)
Exact penalty and error bounds in DC programming
Hoai An Le Thi et al.
JOURNAL OF GLOBAL OPTIMIZATION (2012)
Sequential Convex Approximations to Joint Chance Constrained Programs: A Monte Carlo Approach
L. Jeff Hong et al.
OPERATIONS RESEARCH (2011)
Robust Sampling and Reconstruction Methods for Sparse Signals in the Presence of Impulsive Noise
Rafael E. Carrillo et al.
IEEE JOURNAL OF SELECTED TOPICS IN SIGNAL PROCESSING (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 MOVING BALLS APPROXIMATION METHOD FOR A CLASS OF SMOOTH CONSTRAINED MINIMIZATION PROBLEMS
Alfred Auslender et al.
SIAM JOURNAL ON OPTIMIZATION (2010)
Sparse Reconstruction by Separable Approximation
Stephen J. Wright et al.
IEEE TRANSACTIONS ON SIGNAL PROCESSING (2009)
On the convergence of the proximal algorithm for nonsmooth functions involving analytic features
Hedy Attouch et al.
MATHEMATICAL PROGRAMMING (2009)
The restricted isometry property and its implications for compressed sensing
Emmanuel J. Candes
COMPTES RENDUS MATHEMATIQUE (2008)
PROBING THE PARETO FRONTIER FOR BASIS PURSUIT SOLUTIONS
Ewout van den Berg et al.
SIAM JOURNAL ON SCIENTIFIC COMPUTING (2008)
THE LOJASIEWICZ INEQUALITY FOR NONSMOOTH SUBANALYTIC FUNCTIONS WITH APPLICATIONS TO SUBGRADIENT DYNAMICAL SYSTEMS
Jerome Bolte et al.
SIAM JOURNAL ON OPTIMIZATION (2007)
The SECQ, linear regularity, and the strong chip for an infinite system of closed convex sets in normed linear spaces
Chong Li et al.
SIAM JOURNAL ON OPTIMIZATION (2007)
A modified Poisson regression approach to prospective studies with binary data
GY Zou
AMERICAN JOURNAL OF EPIDEMIOLOGY (2004)
Nonmonotone spectral projected gradient methods on convex sets
EG Birgin et al.
SIAM JOURNAL ON OPTIMIZATION (2000)
分享论文
