Papers › Global Optimization with A Power-Transformed Objective and Gaussian Smoothing
Global Optimization with A Power-Transformed Objective and Gaussian Smoothing
Chen Xu
We propose a novel method that solves global optimization problems in two steps: (1) perform a (exponential) power-N transformation to the not-necessarily differentiable objective function f and get f_N, and (2) optimize the Gaussian-smoothed f_N with stochastic approximations. Under mild conditions on f, for any δ>0, we prove that with a sufficiently large power N_δ, this method converges to a solution in the δ-neighborhood of f's global optimum point. The convergence rate is O(d²σ⁴ε⁻²), which is faster than both the standard and single-loop homotopy methods if σ is pre-selected to be in (0,1). In most of the experiments performed, our method produces better solutions than other algorithms that also apply smoothing techniques.
Syntology This paper's arXiv id is not in Syntology's Atlas id list (549,449 ids, as this build read them; the read time is in the build record), so this page links to no Syntology page for it. The list is not the whole graph; Syntology's feed shows papers as they enter the graph.
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.
Tasks
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