A clustering heuristic to improve a derivative-free algorithm for nonsmooth optimization

DOI10.1007/s11590-023-02042-4arXiv2302.05278OpenAlexW4384200229MaRDI QIDQ6181363

Stefano Lucidi, Manlio Gaudioso, Giampaolo Liuzzi

Publication date: 22 January 2024

Published in: Optimization Letters (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/2302.05278

zbMATH Keywords

nonsmooth optimizationderivative-free methodsCS-DFN

Mathematics Subject Classification ID

Mathematical programming (90Cxx)

Cites Work

• Unnamed Item
• Unnamed Item
• A DC optimization-based clustering technique for edge detection
• Discrete gradient method: Derivative-free method for nonsmooth optimization
• A bundle-Newton method for nonsmooth unconstrained minimization
• A Linesearch-Based Derivative-Free Approach for Nonsmooth Constrained Optimization
• Algorithm 909
• Piecewise-quadratic Approximations in Convex Numerical Optimization
• K-Means-Type Algorithms: A Generalized Convergence Theorem and Characterization of Local Optimality
• Least squares quantization in PCM
• Benchmarking Derivative-Free Optimization Algorithms
• Trust-Region Methods for the Derivative-Free Optimization of Nonsmooth Black-Box Functions
• Algorithm 1027: NOMAD Version 4: Nonlinear Optimization with the MADS Algorithm
• Benchmarking optimization software with performance profiles.