The DOI matches its Crossref record; 19 of the 19 references it cites were found in a registry or an index.
Evolutionary Optimization of Computationally Expensive Problems via Surrogate Modeling
Abstract
We present a parallel evolutionary optimization algorithm that leverages surrogate models for solving computationally expensive design problems with general constraints, on a limited computational budget. The essential backbone of our framework is an evolutionary algorithm coupled with a feasible sequential quadratic programming solver in the spirit of Lamarckian learning. We employ a trust-region approach for interleaving use of exact models for the objective and constraint functions with computationally cheap surrogatemodels during local search. In contrast to earlier work, we construct local surrogate models using radial basis functions motivated by the principle of transductive inference. Further, the present approach retains the intrinsic parallelism of evolutionary algorithms and can hence be readily implemented on grid computing infrastructures. Experimental results are presented for some benchmark test functions and an aerodynamic wing design problem to demonstrate that our algorithm converges to good designs on a limited computational budget.
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
Cites
Wu, Y. (1999) · Technometrics · doi:10.1080/00401706.1999.10485951 · Cited by 27,221
Neural networks for pattern recognition
(1994) · Choice Reviews Online · doi:10.5860/choice.31-5500 · Cited by 18,538
Neural Networks for Pattern Recognition
Bishop, C. M. (1995) · doi:10.1093/oso/9780198538493.001.0001 · Cited by 12,287
The Grid 2: Blueprint for a New Computing Infrastructure
Foster, I. T., & Kesselman, C. (1998) · Cited by 7,637
Design and Analysis of Computer Experiments
Sacks, J., Welch, W. J., Mitchell, T. J., & Wynn, H. P. (1989) · Statistical Science · doi:10.1214/ss/1177012413 · Cited by 6,919
Advances in neural information processing systems 11
Peter Sollich, A. (1999) · Cited by 3,168
Proceedings of the Genetic and Evolutionary Computation Conference, GECCO 2019
Auger, A., & Stützle, T. (2019) · Dépôt institutionnel de l'Université libre de Bruxelles (Université Libre de Bruxelles) · Cited by 1,749
Comparative studies of metamodelling techniques under multiple modelling criteria
Jin, R., Chen, W., & Simpson, T. W. (2001) · Structural and Multidisciplinary Optimization · doi:10.1007/s00158-001-0160-4 · Cited by 1,709
Interpolation of Scattered Data: Distance Matrices and Conditionally Positive Definite Functions
Micchelli, C. A. (1984) · Approximation Theory and Spline Functions · doi:10.1007/978-94-009-6466-2_7 · Cited by 1,297
Interpolation of scattered data: Distance matrices and conditionally positive definite functions
Micchelli, C. A. (1986) · Constructive Approximation · doi:10.1007/bf01893414 · Cited by 1,247
Gaussian Processes for Regression
Williams, C. K. I., & Rasmussen, C. E. (1995) · Aston Publications Explorer (Aston University) · Cited by 1,246
A rigorous framework for optimization of expensive functions by surrogates
Booker, A. J., Dennis, J. E., Frank, P. D., Serafini, D. B., Torczon, V., & Trosset, M. W. (1999) · Structural Optimization · doi:10.1007/bf01197708 · Cited by 960
The approximation power of moving least-squares
Levin, D. (1998) · Mathematics of Computation · doi:10.1090/s0025-5718-98-00974-0 · Cited by 808
A framework for evolutionary optimization with approximate fitness functions
Jin, Y., Olhofer, M., & Sendhoff, B. (2002) · IEEE Transactions on Evolutionary Computation · doi:10.1109/tevc.2002.800884 · Cited by 662
A trust-region framework for managing the use of approximation models in optimization
Alexandrov, N. M., Dennis, J. E., Lewis, R. M., & Torczon, V. J. (1998) · Structural and Multidisciplinary Optimization · doi:10.1007/bf01197433 · Cited by 642
Approximation methods in multidisciplinary analysis and optimization: a panel discussion
Simpson, T. W., Booker, A. J., Ghosh, D., Giunta, A. A., Koch, P. N., & Yang, R.-J. (2004) · Structural and Multidisciplinary Optimization · doi:10.1007/s00158-004-0389-9 · Cited by 412
A Computationally Efficient Feasible Sequential Quadratic Programming Algorithm
Lawrence, C. T., & Tits, A. L. (2001) · SIAM Journal on Optimization · doi:10.1137/s1052623498344562 · Cited by 275
A framework for managing models in nonlinear optimization of computationally expensive functions
Serafini, D., & Dennis, J. E. (1999) · Cited by 53
Evolution strategies with controlled model assistance
Ulmer, H., Streichert, F., & Zell, A. (2005) · IEEE Congress on Evolutionary Computation (CEC) · doi:10.1109/cec.2004.1331083 · Cited by 36
Cited by
Review of Metamodeling Techniques in Support of Engineering Design Optimization
Wang, G. G., & Shan, S. (2007) · Journal of Mechanical Design · doi:10.1115/1.2429697 · Cited by 1,706
Evolutionary Optimization in Uncertain Environments—A Survey
Jin, Y., & Branke, J. (2005) · IEEE Transactions on Evolutionary Computation · doi:10.1109/tevc.2005.846356 · Cited by 1,572
Surrogate-assisted evolutionary computation: Recent advances and future challenges
Jin, Y. (2011) · Swarm and Evolutionary Computation · doi:10.1016/j.swevo.2011.05.001 · Cited by 1,514
Knowles, J. (2006) · IEEE Transactions on Evolutionary Computation · doi:10.1109/tevc.2005.851274 · Cited by 1,254
A comprehensive survey of fitness approximation in evolutionary computation
Jin, Y. (2005) · Soft Computing · doi:10.1007/s00500-003-0328-5 · Cited by 1,229
Metadata
- Authors
- Ong, Y. S., Nair, P. B., & Keane, A. J.
- Venue
- AIAA Journal
- Published
- 2003-04
- Volume
- 41
- Issue
- 4
- Pages
- 687-696
- ISSN
- 0001-1452 (ISSN-L)
- 1533-385X
- OpenAlex
- W2013695155
- Cited by
- 555
- References
- 19
- FWCI
- 17.12
- 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
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.