A bundle-type method for nonsmooth DC programs

DOI10.1007/s10898-023-01325-5OpenAlexW4386994313MaRDI QIDQ6154409

Christian Kanzow, Tanja Neder

Publication date: 15 February 2024

Published in: Journal of Global Optimization (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s10898-023-01325-5

zbMATH Keywords

global convergencecritical pointsbundle methodDC optimization

Mathematics Subject Classification ID

Mathematical programming (90Cxx)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• A DC optimization-based clustering technique for edge detection
• The ABC of DC programming
• On the limited memory BFGS method for large scale optimization
• 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
• A heuristic algorithm for solving the minimum sum-of-squares clustering problems
• A bundle method for nonsmooth DC programming with application to chance-constrained problems
• Proximal bundle methods for nonsmooth DC programming
• A proximal bundle method for nonsmooth DC optimization utilizing nonconvex cutting planes
• Numerical solution for optimization over the efficient set by d.c. optimization algorithms
• Introduction to Nonlinear Optimization
• An aggregate subgradient method for nonsmooth convex minimization
• Stopping criteria for linesearch methods without derivatives
• Optimization and nonsmooth analysis
• Double Bundle Method for finding Clarke Stationary Points in Nonsmooth DC Programming
• A Method for Minimization of Quasidifferentiable Functions
• The Boosted Difference of Convex Functions Algorithm for Nonsmooth Functions
• Robust Estimation of a Location Parameter
• Convex Analysis
• Benchmarking optimization software with performance profiles.

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