The DOI matches its Crossref record; 44 of the 44 references it cites were found in a registry or an index.
Direct Multisearch for Multiobjective Optimization
Open accessAbstract
In practical applications of optimization it is common to have several conflicting objective functions to optimize. Frequently, these functions are subject to noise or can be of black-box type, preventing the use of derivative-based techniques. We propose a novel multiobjective derivative-free methodology, calling it direct multisearch (DMS), which does not aggregate any of the objective functions. Our framework is inspired by the search/poll paradigm of direct-search methods of directional type and uses the concept of Pareto dominance to maintain a list of nondominated points (from which the new iterates or poll centers are chosen). The aim of our method is to generate as many points in the Pareto front as possible from the polling procedure itself, while keeping the whole framework general enough to accommodate other disseminating strategies, in particular, when using the (here also) optional search step. DMS generalizes to multiobjective optimization (MOO) all direct-search methods of directional type. We prove under the common assumptions used in direct search for single objective optimization that at least one limit point of the sequence of iterates generated by DMS lies in (a stationary form of) the Pareto front. However, extensive computational experience has shown that our methodology has an impressive capability of generating the whole Pareto front, even without using a search step. Two by-products of this paper are (i) the development of a collection of test problems for MOO and (ii) the extension of performance and data profiles to MOO, allowing a comparison of several solvers on a large set of test problems, in terms of their efficiency and robustness to determine Pareto fronts.
Overview
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
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
A fast and elitist multiobjective genetic algorithm: NSGA-II
Deb, K., Pratap, A., Agarwal, S., & Meyarivan, T. (2002) · IEEE Transactions on Evolutionary Computation · doi:10.1109/4235.996017 · Cited by 50,053
(2021) · A First Course in Statistical Programming with R · doi:10.1017/9781108993456.011 · Cited by 13,724
Optimization and Nonsmooth Analysis
Clarke, F. H. (1990) · Society for Industrial and Applied Mathematics eBooks · doi:10.1137/1.9781611971309 · Cited by 10,264
Multiple Attribute Decision Making: Methods and Applications
Chen, S.-J. J., Hwang, C. L., Beckmann, M. J., & Krelle, W. E. (1981) · Medical Entomology and Zoology · Cited by 8,207
McKay, M. D., Beckman, R. J., & Conover, W. J. (2000) · Technometrics · doi:10.2307/1271432 · Cited by 7,415
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
Comparison of Multiobjective Evolutionary Algorithms: Empirical Results
Zitzler, E., Deb, K., & Thiele, L. (2000) · Evolutionary Computation · doi:10.1162/106365600568202 · Cited by 5,697
Survey of multi-objective optimization methods for engineering
Marler, R. T., & Arora, J. S. (2004) · Structural and Multidisciplinary Optimization · doi:10.1007/s00158-003-0368-6 · Cited by 4,710
Nonlinear Multiobjective Optimization
Miettinen, K. (1998) · International Series in Operations Research & Management Science · doi:10.1007/978-1-4615-5563-6 · Cited by 4,710
Benchmarking optimization software with performance profiles
Dolan, E. D., & Moré, J. J. (2002) · Mathematical Programming · doi:10.1007/s101070100263 · Cited by 4,412
Multiple Criteria Optimization: Theory, Computation, and Application
Laundy, R. S. (1989) · Cited by 3,420
Multiple Objective Optimization with Vector Evaluated Genetic Algorithms
Schaffer, J. D. (1985) · international conference on Genetic algorithms · Cited by 3,326
Das, I., & Dennis, J. E. (1998) · SIAM Journal on Optimization · doi:10.1137/s1052623496307510 · Cited by 2,654
MOPSO: a proposal for multiple objective particle swarm optimization
Coello Coello, C. A., & Lechuga, M. S. (2002) · Proceedings of the 2002 Congress on Evolutionary Computation. CEC'02 (Cat. No.02TH8600) · doi:10.1109/cec.2002.1004388 · Cited by 2,437
Approximating the Nondominated Front Using the Pareto Archived Evolution Strategy
Knowles, J. D., & Corne, D. W. (2000) · Evolutionary Computation · doi:10.1162/106365600568167 · Cited by 2,286
A review of multiobjective test problems and a scalable test problem toolkit
Huband, S., Hingston, P., Barone, L., & While, L. (2006) · IEEE Transactions on Evolutionary Computation · doi:10.1109/tevc.2005.861417 · Cited by 2,090
AMPL : a modeling language for mathematical programming
Fourer, R., & Kernighan, B. W. (1993) · Cited by 1,860
Multiple Objective Decision Making ― Methods and Applications: A State-of-the-Art Survey
Hwang, C.-L., & Yoon, K. (1979) · Medical Entomology and Zoology · Cited by 1,853
Introduction to Derivative-Free Optimization
Conn, A. R., Scheinberg, K., & Vicente, L. N. (2009) · Society for Industrial and Applied Mathematics eBooks · doi:10.1137/1.9780898718768 · Cited by 1,840
Self-citationOptimization by Direct Search: New Perspectives on Some Classical and Modern Methods
Kolda, T. G., Lewis, R. M., & Torczon, V. (2003) · SIAM Review · doi:10.1137/s003614450242889 · Cited by 1,653
Scalable multi-objective optimization test problems
Deb, K., Thiele, L., Laumanns, M., & Zitzler, E. (2003) · Proceedings of the 2002 Congress on Evolutionary Computation. CEC'02 (Cat. No.02TH8600) · doi:10.1109/cec.2002.1007032 · Cited by 1,627
Multi-objective Genetic Algorithms: Problem Difficulties and Construction of Test Problems
Deb, K. (1999) · Evolutionary Computation · doi:10.1162/evco.1999.7.3.205 · Cited by 1,451
On the Convergence of Pattern Search Algorithms
Torczon, V. (1997) · SIAM Journal on Optimization · doi:10.1137/s1052623493250780 · Cited by 1,336
Mesh Adaptive Direct Search Algorithms for Constrained Optimization
Audet, C., & Dennis, J. E. (2006) · SIAM Journal on Optimization · doi:10.1137/040603371 · Cited by 1,243
Fonseca, C. M., & Fleming, P. J. (1998) · IEEE Transactions on Systems, Man, and Cybernetics - Part A: Systems and Humans · doi:10.1109/3468.650319 · Cited by 1,234
Das, I., & Dennis, J. E. (1997) · Structural Optimization · doi:10.1007/bf01197559 · Cited by 1,208
Analysis of Generalized Pattern Searches
Audet, C., & Dennis, J. E. (2002) · SIAM Journal on Optimization · doi:10.1137/s1052623400378742 · Cited by 1,022
A Simulated Annealing-Based Multiobjective Optimization Algorithm: AMOSA
Bandyopadhyay, S., Saha, S., Maulik, U., & Deb, K. (2008) · IEEE Transactions on Evolutionary Computation · doi:10.1109/tevc.2007.900837 · Cited by 852
A Modeling Language for Mathematical Programming
Fourer, R., Gay, D. M., & Kernighan, B. W. (1990) · Management Science · doi:10.1287/mnsc.36.5.519 · Cited by 660
A variant of evolution strategies for vector optimization
Kursawe, F. (2006) · Lecture Notes in Computer Science · doi:10.1007/bfb0029752 · Cited by 597
Benchmarking Derivative-Free Optimization Algorithms
Moré, J. J., & Wild, S. M. (2009) · SIAM Journal on Optimization · doi:10.1137/080724083 · Cited by 573
Jones, D., & Tamiz, M. (2010) · International Series in Operations Research & Management Science · doi:10.1007/978-1-4419-5771-9 · Cited by 403
A Scalable Multi-objective Test Problem Toolkit
Huband, S., Barone, L., While, L., & Hingston, P. (2005) · Lecture Notes in Computer Science · doi:10.1007/978-3-540-31880-4_20 · Cited by 384
A particle swarm pattern search method for bound constrained global optimization
Vaz, A. I. F., & Vicente, L. N. (2007) · Journal of Global Optimization · doi:10.1007/s10898-007-9133-5 · Cited by 316
Self-citationTowards a Quick Computation of Well-Spread Pareto-Optimal Solutions
Deb, K., Mohan, M., & Mishra, S. (2003) · Lecture Notes in Computer Science · doi:10.1007/3-540-36970-8_16 · Cited by 252
Jin, Y., Olhofer, M., & Sendhoff, B. (2007) · Cited by 211
Multiobjective GAs, Quantitative Indices, and Pattern Classification
Bandyopadhyay, S., Pal, S. K., & Aruna, B. (2004) · IEEE Transactions on Systems, Man and Cybernetics, Part B (Cybernetics) · doi:10.1109/tsmcb.2004.834438 · Cited by 209
Using Sampling and Simplex Derivatives in Pattern Search Methods
Custódio, A. L., & Vicente, L. N. (2007) · SIAM Journal on Optimization · doi:10.1137/050646706 · Cited by 149
Self-citationIncorporating minimum Frobenius norm models in direct search
Custódio, A. L., Rocha, H., & Vicente, L. N. (2009) · Computational Optimization and Applications · doi:10.1007/s10589-009-9283-0 · Cited by 142
Self-citationPSwarm: a hybrid solver for linearly constrained global derivative-free optimization
Vaz, A. I. F., & Vicente, L. N. (2009) · Optimization methods & software · doi:10.1080/10556780902909948 · Cited by 120
Self-citationOn Test Functions for Evolutionary Multi-objective Optimization
Okabe, T., Jin, Y., Olhofer, M., et al. (2004) · Lecture notes in computer science · doi:10.1007/978-3-540-30217-9_80 · Cited by 115
Analysis of direct searches for discontinuous functions
Vicente, L. N., & Custódio, A. L. (2010) · Mathematical Programming · doi:10.1007/s10107-010-0429-8 · Cited by 80
Self-citationUsing simplex gradients of nonsmooth functions in direct search methods
Custódio, A. L., Dennis, J. E., & Vicente, L. N. (2008) · IMA Journal of Numerical Analysis · doi:10.1093/imanum/drn045 · Cited by 67
Self-citationA SYNTHETIC APPROACH TO MULTIOBJECTIVE OPTIMIZATIONPreprint
Lovison, A. (2010) · arXiv (Cornell University) · Cited by 7
Cited by
A tutorial on multiobjective optimization: fundamentals and evolutionary methods
Emmerich, M. T. M., & Deutz, A. H. (2018) · Natural Computing · doi:10.1007/s11047-018-9685-y · Cited by 731
Derivative-free optimization methods
Larson, J., Menickelly, M., & Wild, S. M. (2019) · Acta Numerica · doi:10.1017/s0962492919000060 · Cited by 381
A Review of Multi-objective Optimization: Methods and Algorithms in Mechanical Engineering Problems
Pereira, J. L. J., Oliver, G. A., Francisco, M. B., Cunha, S. S., & Gomes, G. F. (2022) · Archives of Computational Methods in Engineering · doi:10.1007/s11831-021-09663-x · Cited by 351
Chugh, T., Sindhya, K., Hakanen, J., & Miettinen, K. (2019) · Soft Computing · doi:10.1007/s00500-017-2965-0 · Cited by 305
Metadata
- Authors
- Custódio, A. L., Madeira, J. F. A., Vaz, A. I. F., & Vicente, L. N.
- Venue
- SIAM Journal on Optimization
- Published
- 2011-07
- Volume
- 21
- Issue
- 3
- Pages
- 1109-1140
- ISSN
- 1052-6234 (ISSN-L)
- 1095-7189
- OpenAlex
- W2561080469
- Cited by
- 392
- References
- 44
- FWCI
- 10.46
- Type
- journal article
- Language
- en
- Open access
- green
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.