The DOI matches its Crossref record; 10 of the 10 references it cites were found in a registry or an index.
A parallel global multiobjective framework for optimization: pagmo
Open accessAbstract
Mathematical optimization is pervasive in all quantitative sciences.The ability to find good parameters values in a generic numerical experiment while meeting complex constraints is of great importance and, as such, has always been an active research topic of mathematics, numerics and, more recently, artificial intelligence.Given the vast amount and diversity of optimization problems, as well as of solution approaches, and considering the need to be able to exploit modern computational architectures, the development of a tool able to help in such a pervasive task is not trivial.In this paper we introduce pagmo, a C++ scientific library for massively parallel optimization.pagmo is built around the idea of providing a unified interface to optimization algorithms and problems, and to make their deployment in massively parallel environments easy.Efficient implementantions of bio-inspired and evolutionary algorithms are sided to state-ofthe-art optimization algorithms (Simplex Methods, SQP methods, interior points methods, etc.) and can be used concurrently (also together with algorithms coded by the user) to build an optimization pipeline exploiting algorithmic cooperation via the asynchronous, generalized island model (Izzo, Ruciński, & Biscani, 2012).pagmo can be used to solve constrained, unconstrained, single objective, multiple objectives, continuous and integer optimization problems, stochastic and deterministic problems, as well as to perform research on novel algorithms and paradigms and easily compare them to stateof-the-art implementations of established ones.For users that are more comfortable with the Python language, the package pygmo provides a complete set of Python bindings for pagmo closely following the C++ API.
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
Matplotlib: a 2D graphics environment
Hunter, J. D. (2007) · Computing in Science & Engineering · doi:10.1109/mcse.2007.55 · Cited by 39,249
SciPy 1.0: fundamental algorithms for scientific computing in Python
Virtanen, P., Gommers, R., Oliphant, T. E., Haberland, M., Reddy, T., Cournapeau, D., Burovski, E., Peterson, P., Weckesser, W., Bright, J., et al. (2020) · Nature Methods · doi:10.1038/s41592-019-0686-2 · Cited by 38,430
Storn, R., & Price, K. (1997) · Journal of Global Optimization · doi:10.1023/a:1008202821328 · Cited by 29,569
SciPy 1.0: fundamental algorithms for scientific computing in Python
Virtanen, P., Gommers, R., Oliphant, T. E., Haberland, M., Reddy, T., Cournapeau, D., Burovski, E., Peterson, P., Weckesser, W., Bright, J., et al. (2019) · Apollo - University of Cambridge Repository · doi:10.17863/cam.64134 · Cited by 10,460
The NumPy Array: A Structure for Efficient Numerical Computation
van der Walt, S., Colbert, S. C., & Varoquaux, G. (2011) · Computing in Science & Engineering · doi:10.1109/mcse.2011.37 · Cited by 9,381
Exploring Network Structure, Dynamics, and Function Using NetworkX
Hagberg, A. A., Schult, D. A., & Swart, P. J. (2008) · Proceedings of the Python in Science Conference · doi:10.25080/tcwv9851 · Cited by 7,477
DEAP: evolutionary algorithms made easy
Fortin, F.-A., Rainville, F.-M. D., Gardner, M.-A., Parizeau, M., & Gagné, C. (2012) · Cited by 1,642
Optimization Theory in Evolution
Smith, J. M. (1978) · Annual Review of Ecology and Systematics · doi:10.1146/annurev.es.09.110178.000335 · Cited by 1,137
jMetal: A Java framework for multi-objective optimization
Durillo, J. J., & Nebro, A. J. (2011) · Advances in Engineering Software · doi:10.1016/j.advengsoft.2011.05.014 · Cited by 1,134
Izzo, D., Ruciński, M., & Biscani, F. (2012) · Studies in computational intelligence · doi:10.1007/978-3-642-28789-3_7 · Cited by 106
Self-citation
Metadata
- Authors
- Biscani, F., & Izzo, D.
- Venue
- Journal of Open Source Software
- Publisher
- The Open Journal
- Published
- 2020-09-13
- Volume
- 5
- Issue
- 53
- Pages
- 2338
- ISSN
- 2475-9066 (ISSN-L)
- OpenAlex
- W3086784814
- Cited by
- 301
- References
- 10
- FWCI
- 12.88
- Type
- journal article
- Language
- en
- Open access
- diamond
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.