An inexact boosted difference of convex algorithm for nondifferentiable functions
From MaRDI portal
Cites work
- A boosted DC algorithm for non-differentiable DC components with non-monotone line search
- A boosted-DCA with power-sum-DC decomposition for linearly constrained polynomial programs
- A bundle-type method for nonsmooth DC programs
- 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 Nonmonotone Line Search Technique and Its Application to Unconstrained Optimization
- A Nonmonotone Line Search Technique for Newton’s Method
- A proximal point algorithm for DC functions on Hadamard manifolds
- Abstract regularized equilibria: application to Becker's household behavior theory
- Accelerating the DC algorithm for smooth functions
- An Easy Path to Convex Analysis and Applications
- An inertial algorithm for DC programming
- An inexact successive quadratic approximation method for a class of difference-of-convex optimization problems
- An interior proximal linearized method for DC programming based on Bregman distance or second-order homogeneous kernels
- Codifferential method for minimizing nonsmooth DC functions
- Convergence guarantees for a class of non-convex and non-smooth optimization problems
- Convex analysis and beyond. Volume I. Basic theory
- 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
- First-order methods in optimization
- Global convergence of a proximal linearized algorithm for difference of convex functions
- scientific article; zbMATH DE number 439380 (Why is no real title available?)
- scientific article; zbMATH DE number 4041643 (Why is no real title available?)
- scientific article; zbMATH DE number 46303 (Why is no real title available?)
- scientific article; zbMATH DE number 477581 (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?)
- Inexact proximal DC Newton-type method for nonconvex composite functions
- Minimization of \(\ell_{1-2}\) for compressed sensing
- Minimizing nonsmooth DC functions via successive DC piecewise-affine approximations
- Nesterov's smoothing technique and minimizing differences of convex functions for hierarchical clustering
- Nonsmooth DC programming approach to clusterwise linear regression: optimality conditions and algorithms
- On the convergence of an approximate proximal method for DC functions
- Open issues and recent advances in DC programming and DCA
- Proximal bundle methods for nonsmooth DC programming
- Second-order variational analysis in optimization, variational stability, and control. Theory, algorithms, applications
- Solving a continuous multifacility location problem by DC algorithms
- The ABC of DC programming
- The boosted DC algorithm for linearly constrained DC programming
- The Boosted Difference of Convex Functions Algorithm for Nonsmooth Functions
This page was built for publication: An inexact boosted difference of convex algorithm for nondifferentiable functions
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6874617)
