Student or educator? Sign up with your school email and get 6 months of Pro free.
Cited by 158

The DOI matches its Crossref record; 1 of the 1 references it cites were found in a registry or an index.

TGMin: A global-minimum structure search program based on a constrained basin-hopping algorithm

Zhao, Yafan, Chen, Xin, Li, Jun·2017·Nano Research

Abstract

In this article, we introduce Tsinghua Global Minimum (TGMin) as a new program for the global minimum searching of geometric structures of gas-phase or surface-supported atomic clusters, and the constrained basin-hopping (BH) algorithm implemented in this program. To improve the efficiency of the BH algorithm, several types of constraints are introduced to reduce the vast search space, including constraints on the random displacement step size, displacement of low-coordination atoms, and geometrical structure adjustment after displacement. The ultrafast shape-recognition (USR) algorithm and its variants are implemented to identify duplicate structures during the global minimum search. In addition to the Metropolis acceptance criterion, we also implemented a morphology-based constraint that confines the global minimum search to a specific type of morphology, such as planar or non-planar structures, which offers a strict divide-and-conquer strategy for the BH algorithm. These improvements are implemented in the TGMin program, which was developed over the past decade and has been used in a number of publications. We tested our TGMin program on global minimum structural searches for a number of metal and main-group clusters including C60, Au20 and B20 clusters. Over the past five years, the TGMin program has been used to determine the global minimum structures of a series of boron atomic clusters (such as [B26]–, [B28]–, [B30]–, [B35]–, [B36]–, [B39]–, [B40]–, [MnB16]–, [CoB18]–, [RhB18]–, and [TaB20]–), metal-containing clusters Li n (n = 3–20), Au9(CO)8 + and [Cr6O19]2–, and the oxide-supported metal catalyst Au7/γ-Al2O3, as well as other isolated and surface-supported atomic clusters. In this article we present the major features of TGMin program and show that it is highly efficient at searching for global-minimum structures of atomic clusters in the gas phase and on various surface supports.

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.

A few free checks a day · papers already verified open instantly · results are public

Integrity signals

Registry

Crossref · 10.1007/s12274-017-1553-z

Cites

1 of 1 references verified0 citation errors · 0 not checkable

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.

A few free checks a day · papers already verified open instantly · results are public

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

Cites

  • Chemistry with ADF

    te Velde, G., Bickelhaupt, F. M., Baerends, E. J., Fonseca Guerra, C., van Gisbergen, S. J. A., Snijders, J. G., & Ziegler, T. (2001) · Journal of Computational Chemistry · doi:10.1002/jcc.1056 · Cited by 10,152

Show all 1 references

Cited by

See all 158

Metadata

Authors
Zhao, Y., Chen, X., & Li, J.
Venue
Nano Research
Published
2017-07-29
Volume
10
Issue
10
Pages
3407-3420
ISSN
  • 1998-0000 (ISSN-L)
  • 1998-0124
OpenAlex
W2741720794
Cited by
158
References
1
FWCI
6.61
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: TGMin: A global-minimum structure search program based on a constrained basin-hopping algorithm. https://app.cochat.ai/papers/10.1007/s12274-017-1553-z
The paper
Zhao, Y., Chen, X., & Li, J. (2017). TGMin: A global-minimum structure search program based on a constrained basin-hopping algorithm. Nano Research. https://doi.org/10.1007/s12274-017-1553-z

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.