A bundle-type method for nonsmooth DC programs

DOI10.1007/S10898-023-01325-5MaRDI QIDQ6154409zbMATH OpenOpenAlexFDO

Authors Christian Kanzow, Tanja Neder

Publication date 15 February 2024

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

Copyright license Creative Commons Attribution 4.0 International

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)

Recommendations

• Proximal bundle methods for nonsmooth DC programming
• Minimizing nonsmooth DC functions via successive DC piecewise-affine approximations
• A bundle method for nonsmooth DC programming with application to chance-constrained problems
• A proximal bundle method for nonsmooth DC optimization utilizing nonconvex cutting planes
• A redistributed bundle algorithm based on local convexification models for nonlinear nonsmooth DC programming

Cites work

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

Cited in

(1)

• Minimizing the difference of convex and weakly convex functions via bundle method

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)