A boosted DC algorithm for non-differentiable DC components with non-monotone line search
From MaRDI portal
(Redirected from Publication:6568924)
A boosted DC algorithm for non-differentiable DC components with non-monotone line search (scientific article; zbMATH DE number 7878090)
A boosted DC algorithm for non-differentiable DC components with non-monotone line search (scientific article; zbMATH DE number 7878090)
Recommendations
- The Boosted Difference of Convex Functions Algorithm for Nonsmooth Functions
- The boosted DC algorithm for linearly constrained DC programming
- Using positive spanning sets to achieve d-stationarity with the boosted DC algorithm
- A new boosted proximal point algorithm for minimizing nonsmooth DC functions
- Nonmonotone enhanced proximal DC algorithms for a class of structured nonsmooth DC programming
Cites work
- A D.C. algorithm via convex analysis approach for solving a location problem involving sets
- A DC programming approach for solving multicast network design problems via the Nesterov smoothing technique
- A generalized proximal linearized algorithm for DC functions with application to the optimal size of the firm problem
- A heuristic algorithm for solving the minimum sum-of-squares clustering problems
- A modified proximal point method for DC functions on Hadamard manifolds
- A Nonmonotone Line Search Technique and Its Application to Unconstrained Optimization
- A Nonmonotone Line Search Technique for Newton’s Method
- A proximal bundle method for nonsmooth DC optimization utilizing nonconvex cutting planes
- A weighted difference of anisotropic and isotropic total variation model for image processing
- Accelerating the DC algorithm for smooth functions
- An inertial algorithm for DC programming
- An interior proximal linearized method for DC programming based on Bregman distance or second-order homogeneous kernels
- An introduction to total variation for image analysis
- Benchmarking optimization software with performance profiles.
- Codifferential method for minimizing nonsmooth DC functions
- Convergence guarantees for a class of non-convex and non-smooth optimization problems
- Convergence of descent methods for semi-algebraic and tame problems: proximal algorithms, forward-backward splitting, and regularized Gauss-Seidel methods
- Convex analysis approach to d. c. programming: Theory, algorithms and applications
- DC formulations and algorithms for sparse optimization problems
- DC programming and DCA: thirty years of developments
- Double bundle method for finding Clarke stationary points in nonsmooth DC programming
- Fast Gradient-Based Algorithms for Constrained Total Variation Image Denoising and Deblurring Problems
- First-order methods in optimization
- Global convergence of a proximal linearized algorithm for difference of convex functions
- Global optimization. Theory, algorithms, and applications
- scientific article; zbMATH DE number 439380 (Why is no real title available?)
- scientific article; zbMATH DE number 3650320 (Why is no real title available?)
- scientific article; zbMATH DE number 4041643 (Why is no real title available?)
- scientific article; zbMATH DE number 2076851 (Why is no real title available?)
- scientific article; zbMATH DE number 1795206 (Why is no real title available?)
- Improving the efficiency of DC global optimization methods by improving the DC representation of the objective function
- Minimization of \(\ell_{1-2}\) for compressed sensing
- Nesterov's smoothing technique and minimizing differences of convex functions for hierarchical clustering
- Nonmonotone line searches for optimization algorithms
- Nonsmooth DC programming approach to clusterwise linear regression: optimality conditions and algorithms
- On the convergence of an approximate proximal method for DC functions
- On the Convergence to Stationary Points of Deterministic and Randomized Feasible Descent Directions Methods
- On the worst-case evaluation complexity of non-monotone line search algorithms
- Optimization and nonsmooth analysis
- Proximal Alternating Minimization and Projection Methods for Nonconvex Problems: An Approach Based on the Kurdyka-Łojasiewicz Inequality
- Proximal bundle methods for nonsmooth DC programming
- Proximité et dualité dans un espace hilbertien
- Qualitative properties of the minimum sum-of-squares clustering problem
- The ABC of DC programming
- The Boosted Difference of Convex Functions Algorithm for Nonsmooth Functions
- The Fermat-Weber location problem revisited
- Undominated d.c. decompositions of quadratic functions and applications to branch-and-bound approaches
Cited in
(7)- An inexact boosted difference of convex algorithm for nondifferentiable functions
- The boosted double-proximal subgradient algorithm for nonconvex optimization
- Convergence of descent optimization algorithms under Polyak-Łojasiewicz-Kurdyka conditions
- Convergence of ZH-type nonmonotone descent method for Kurdyka-Łojasiewicz optimization problems
- A preconditioned difference of convex functions algorithm with extrapolation and line search
- A proximal difference of convex functions algorithm using Barzilai-Borwein step size with nonmonotone line search and extrapolation
- Inexact proximal linearized algorithm for difference of convex composite functions
This page was built for publication: A boosted DC algorithm for non-differentiable DC components with non-monotone line search
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6568924)
