A bundle-type method for nonsmooth DC programs

Cites Work

Title not available (Why is that?)
Robust Estimation of a Location Parameter
Benchmarking optimization software with performance profiles.
On the limited memory BFGS method for large scale optimization
Title not available (Why is that?)
Title not available (Why is that?)
Convex Analysis
Title not available (Why is that?)
An aggregate subgradient method for nonsmooth convex minimization
Optimization and nonsmooth analysis
Title not available (Why is that?)
Introduction to nonlinear optimization: theory, algorithms, and applications with MATLAB
Numerical solution for optimization over the efficient set by d.c. optimization algorithms
A Method for Minimization of Quasidifferentiable Functions
A heuristic algorithm for solving the minimum sum-of-squares clustering problems
Stopping criteria for linesearch methods without derivatives
A DC optimization-based clustering technique for edge detection
DC programming and DCA: thirty years of developments
Accelerating the DC algorithm for smooth functions
Minimizing nonsmooth DC functions via successive DC piecewise-affine approximations
Proximal bundle methods for nonsmooth DC programming
A proximal bundle method for nonsmooth DC optimization utilizing nonconvex cutting planes
Double bundle method for finding Clarke stationary points in nonsmooth DC programming
The Boosted Difference of Convex Functions Algorithm for Nonsmooth Functions
The ABC of DC programming
Title not available (Why is that?)
A bundle method for nonsmooth DC programming with application to chance-constrained problems

This page was built for publication: A bundle-type method for nonsmooth DC programs

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6154409)