Surrogate‐Free Annealing Random Search for Continuous Stochastic Optimization

Feng Xu et al.

Naval Research Logistics2026https://doi.org/10.1002/nav.70057article
AJG 3ABDC B
Weight
0.50

What the paper says

ABSTRACT Optimizing blackbox stochastic systems, where only outputs are observable, is challenging due to difficulties in estimating objective function values. Surrogate‐based methods, such as interpolation, are widely used but struggle with stochastic noise and high computational costs. To overcome these limitations, we propose surrogate‐free annealing random search (SFARS), a novel algorithm that eliminates explicit surrogate models. SFARS employs a value aggregation mechanism based on a predefined discrete point set, enabling efficient Monte Carlo estimators. Theoretical analysis establishes a finite‐time probability error bound and guarantees almost sure global convergence with a sub‐exponential rate. Numerical experiments demonstrate superior efficiency and robustness, particularly in high‐noise environments.

Open paper page →

Cite this paper

https://doi.org/https://doi.org/10.1002/nav.70057

Or copy a formatted citation

@article{feng2026,
  title        = {{Surrogate‐Free Annealing Random Search for Continuous Stochastic Optimization}},
  author       = {Feng Xu et al.},
  journal      = {Naval Research Logistics},
  year         = {2026},
  doi          = {https://doi.org/https://doi.org/10.1002/nav.70057},
}

Paste directly into BibTeX, Zotero, or your reference manager.

Flag this paper

Surrogate‐Free Annealing Random Search for Continuous Stochastic Optimization

Flags are reviewed by the Arbiter methodology team within 5 business days.


Evidence weight

0.50

Balanced mode · F 0.40 / M 0.15 / V 0.05 / R 0.40

F · citation impact0.50 × 0.4 = 0.20
M · momentum0.50 × 0.15 = 0.07
V · venue signal0.50 × 0.05 = 0.03
R · text relevance †0.50 × 0.4 = 0.20

† Text relevance is estimated at 0.50 on the detail page — for your query’s actual relevance score, open this paper from a search result.