A refined inertial DC algorithm for DC programming
From MaRDI portal
Publication:6159465
DOI10.1007/s11081-022-09716-5zbMath1514.90194arXiv2104.14750OpenAlexW4226155457MaRDI QIDQ6159465
Publication date: 20 June 2023
Published in: Optimization and Engineering (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/2104.14750
image denoisingKurdyka-Łojasiewicz propertydifference-of-convex programmingchecking copositivity of matricesrefined inertial DC algorithm
Nonconvex programming, global optimization (90C26) Nonlinear programming (90C30) Computing methodologies for image processing (68U10)
Related Items
A variable metric and Nesterov extrapolated proximal DCA with backtracking for a composite DC program ⋮ Preface to the special issue dedicated to the 6th world congress on global optimization held in Metz, France, July 8--10, 2019
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Global convergence of a proximal linearized algorithm for difference of convex functions
- Gradient methods for minimizing composite functions
- Testing copositivity with the help of difference-of-convex optimization
- Proximal alternating linearized minimization for nonconvex and nonsmooth problems
- Exact penalty and error bounds in DC programming
- On functions representable as a difference of convex functions
- The ABC of DC programming
- On the surfaces representable as difference of convex functions
- On the convergence of the proximal algorithm for nonsmooth functions involving analytic features
- Convex analysis approach to d. c. programming: Theory, algorithms and applications
- A proximal difference-of-convex algorithm with extrapolation
- DC programming and DCA: thirty years of developments
- Accelerating the DC algorithm for smooth functions
- The DC (Difference of convex functions) programming and DCA revisited with DC models of real world nonconvex optimization problems
- Convergence of descent methods for semi-algebraic and tame problems: proximal algorithms, forward-backward splitting, and regularized Gauss-Seidel methods
- DC programming: overview.
- Alternating DC algorithm for partial DC programming problems
- An inertial algorithm for DC programming
- A proximal bundle method for nonsmooth DC optimization utilizing nonconvex cutting planes
- A refined convergence analysis of \(\mathrm{pDCA}_{e}\) with applications to simultaneous sparse recovery and outlier detection
- Enhanced proximal DC algorithms with extrapolation for a class of structured nonsmooth DC minimization
- The boosted DC algorithm for linearly constrained DC programming
- iPiano: Inertial Proximal Algorithm for Nonconvex Optimization
- Computing B-Stationary Points of Nonsmooth DC Programs
- Inertial Proximal Alternating Linearized Minimization (iPALM) for Nonconvex and Nonsmooth Problems
- A D.C. Optimization Algorithm for Solving the Trust-Region Subproblem
- First-Order Methods in Optimization
- Convex-Concave Backtracking for Inertial Bregman Proximal Gradient Algorithms in Nonconvex Optimization
- The Boosted Difference of Convex Functions Algorithm for Nonsmooth Functions
- Fast Gradient-Based Algorithms for Constrained Total Variation Image Denoising and Deblurring Problems
- The Łojasiewicz Inequality for Nonsmooth Subanalytic Functions with Applications to Subgradient Dynamical Systems
- Convex Analysis
- Heavy-ball method in nonconvex optimization problems
