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

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

Evolutionary Programming for High-Dimensional Constrained Expensive Black-Box Optimization Using Radial Basis Functions

Regis, Rommel G. · 2014 · IEEE Transactions on Evolutionary Computation

Abstract

This paper develops a surrogate-assisted evolutionary programming (EP) algorithm for constrained expensive black-box optimization that can be used for high-dimensional problems with many black-box inequality constraints. The proposed method does not use a penalty function and it builds surrogates for the objective and constraint functions. Each parent generates a large number of trial offspring in each generation. Then, the surrogate functions are used to identify the trial offspring that are predicted to be feasible with the best predicted objective function values or those with the minimum number of predicted constraint violations. The objective and constraint functions are then evaluated only on the most promising trial offspring from each parent, and the method proceeds in the same way as in a standard EP. In the numerical experiments, the type of surrogate used to model the objective and each of the constraint functions is a cubic radial basis function (RBF) augmented by a linear polynomial. The resulting RBF-assisted EP is applied to 18 benchmark problems and to an automotive problem with 124 decision variables and 68 black-box inequality constraints. The proposed method is much better than a traditional EP, a surrogate-assisted penalty-based EP, stochastic ranking evolution strategy, scatter search, and CMODE, and it is competitive with ConstrLMSRBF on the problems used.

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.1109/tevc.2013.2262111

Cites

42 of 42 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

Show all 42 references

Cited by

See all 268

Metadata

Authors
Regis, R. G.
Venue
IEEE Transactions on Evolutionary Computation
Published
2014-06
Volume
18
Issue
3
Pages
326-347
ISSN
  • 1089-778X (ISSN-L)
  • 1941-0026
OpenAlex
W2096369439
Cited by
268
References
42
FWCI
6.99
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: Evolutionary Programming for High-Dimensional Constrained Expensive Black-Box Optimization Using Radial Basis Functions. https://app.cochat.ai/papers/10.1109/tevc.2013.2262111
The paper
Regis, R. G. (2014). Evolutionary Programming for High-Dimensional Constrained Expensive Black-Box Optimization Using Radial Basis Functions. IEEE Transactions on Evolutionary Computation. https://doi.org/10.1109/tevc.2013.2262111

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.