A smoothed consensus-based optimization algorithm is shown to reach almost-sure consensus and, under a sufficient condition on initial data and parameters, to land near the global minimum of nonsmooth nonconvex functions.
Title resolution pending
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
fields
math.OC 1years
2025 1verdicts
CONDITIONAL 1representative citing papers
citing papers explorer
-
A Smoothing Consensus-Based Optimization Algorithm for Nonsmooth Nonconvex Optimization
A smoothed consensus-based optimization algorithm is shown to reach almost-sure consensus and, under a sufficient condition on initial data and parameters, to land near the global minimum of nonsmooth nonconvex functions.