The DOI matches its Crossref record.
Diffusion for Global Optimization in $\mathbb{R}^n $
Abstract
We seek a global minimum of $U:\mathbb{R}^n \to \mathbb{R}$. The solution to $( * )({d / {dt}})X(t) = - \nabla U(X(t))$ will find local minima. Using the idea of simulated annealing, we consider the diffusion process, $dX(t) = - \nabla U(X(t))dt + \sigma (t)dW(t)$, $X(0) = x$, where $W( \cdot )$ is the n-dimensional standard Brownian motion and $\frac{1}{2}\sigma ^2 (t)$ is the annealing rate which decreases to zero as t goes to $\infty $. Under suitable condition on $U(x)$, we prove that $X(t)$ converges weakly to a probability measure $\pi $ if for large t, $\sigma ^2 (t) = {c / {\log t}}$ with $c > c_0 $, where $c_0 $ has a simple expression involving the action function of the dynamical system $( * )$, $\pi $ concentrates on the global minima of U and is the weak limit of the Gibbs densities $\pi _t (x) \propto \exp ({{ - 2U(x)} / {\sigma ^2 (t)}})$. The above result can also be formulated as follows: consider the Fokker–Planck equation (forward equation) \[\frac{\partial }{{\partial t}}V(t,y) = \frac{1}{2}\sigma ^2 (t)\Delta V(t,y) + \nabla \cdot (V(t,y)\nabla U(y))\] with $V(0,y) = \delta _x (y)$. If $\sigma ^2 (t) = {c / {\log t}}$ for large t and $c > c_0 $, then $V(t,y) \to \pi $ weakly.
Overview
The claims and statistics of this paper haven’t been checked yet.
Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.
Self-check
Percentages, sums and reported differences re-computed from the paper’s own numbers.
The self-check needs the paper’s full text.
Citations
Cited by
Image Parsing: Unifying Segmentation, Detection, and Recognition
Tu, Z., Chen, X., Yuille, A. L., & Zhu, S.-C. (2005) · International Journal of Computer Vision · doi:10.1007/s11263-005-6642-x · Cited by 498
Hwang, C.-R. (1988) · Acta Applicandae Mathematicae · doi:10.1007/bf00047572 · Cited by 335
Self-citationAccelerating Gaussian diffusions
Hwang, C.-R., Hwang-Ma, S.-Y., & Sheu, S.-J. (1993) · The Annals of Applied Probability · doi:10.1214/aoap/1177005371 · Cited by 108
Self-citation
Metadata
- Authors
- Chiang, T.-S., Hwang, C.-R., & Sheu, S. J.
- Venue
- SIAM Journal on Control and Optimization
- Published
- 1987-05
- Volume
- 25
- Issue
- 3
- Pages
- 737-753
- ISSN
- 0363-0129 (ISSN-L)
- 1095-7138
- OpenAlex
- W2041898787
- Cited by
- 205
- References
- 0
- FWCI
- 6.15
- Type
- journal article
- Language
- en
- Open access
- closed
About these checks
Registry, retraction, Cites and statistics results are computed, not judged, with one exception: a printed reference that no index lists is read once by a model before it counts as a citation error. Claims are extracted by a model and kept only when their quote appears verbatim in the text; each cited source is then checked, with a model’s help, for whether it says what the claim relies on. Those verdicts can be wrong — read the claim’s quote and the cited source before relying on one.
Statistics and arithmetic are recomputed, not judged.
Confidence bands are shown only for fields calibrated on our annotated test set. None is calibrated yet, so no band is shown.
What counts as a claim ›How we measure confidence ›How we check this ›
Are you an author, or do you see a problem with this page? Request a review
How to cite
Cite CoChat for the checks on this page, and the paper for its own findings.
- This page
- CoChat. (2026). Citation check: Diffusion for Global Optimization in $\mathbb{R}^n $. https://app.cochat.ai/papers/10.1137/0325042
- The paper
- Chiang, T.-S., Hwang, C.-R., & Sheu, S. J. (1987). Diffusion for Global Optimization in $\mathbb{R}^n $. SIAM Journal on Control and Optimization. https://doi.org/10.1137/0325042
Data sources
Bibliographic data: Semantic Scholar, OpenAlex, Crossref.
Contains information from the Semantic Scholar Academic Graph Datasets, made available under the ODC Attribution License (ODC-BY 1.0).
Semantic Scholar’s data is described in: Kinney, R., et al. (2023). The Semantic Scholar Open Data Platform. arXiv:2301.10140.