Papers › Derivative-free global minimization for a class of multiple minima problems
Derivative-free global minimization for a class of multiple minima problems
Xiaopeng Luo, Xin Xu, Daoyi Dong
The archive published only this paper's code-link row. Authors, date and abstract are from arXiv's metadata (CC0), read from the Kaggle arXiv metadata snapshot of 2026-09-12 where its title matched the archive's; the title is the archive's.
We prove that the finite-difference based derivative-free descent (FD-DFD) methods have a capability to find the global minima for a class of multiple minima problems. Our main result shows that, for a class of multiple minima objectives that is extended from strongly convex functions with Lipschitz-continuous gradients, the iterates of FD-DFD converge to the global minimizer x_* with the linear convergence xₖ₊₁-x_*₂²⩽ρᵏ x₁-x_*₂² for a fixed 0<ρ<1 and any initial iteration x₁∈ℝᵈ when the parameters are properly selected. Since the per-iteration cost, i.e., the number of function evaluations, is fixed and almost independent of the dimension d, the FD-DFD algorithm has a complexity bound 𝒪(log1/ϵ) for finding a point x such that the optimality gap x-x_*₂² is less than ϵ>0. Numerical experiments in various dimensions from $5$ to $500$ demonstrate the benefits of the FD-DFD method.
Code
Repository list and official/mentioned flags are the archive's, frozen 2025-07-28. Reachability, where shown, is from one Syntology probe window (2026-09-16 to 2026-09-18); repositories not probed show nothing. GitHub stars are not tracked.
Code Syntology ran Syntology
Not run by Syntology. Nothing on this page verifies that the listed code works.
Results from the paper archive 2025-07-28
No leaderboard rows for this paper in the archive.
Report a problem or propose a change · a person checks every report against the paper or source before anything changes; decisions are listed on /corrections