The DOI matches its Crossref record; 21 of the 21 references it cites were found in a registry or an index.
Scatter Search and Local NLP Solvers: A Multistart Framework for Global Optimization
Open accessAbstract
The algorithm described here, called OptQuest/NLP or OQNLP, is a heuristic designed to find global optima for pure and mixed integer nonlinear problems with many constraints and variables, where all problem functions are differentiable with respect to the continuous variables. It uses OptQuest, a commercial implementation of scatter search developed by OptTek Systems, Inc., to provide starting points for any gradient-based local solver for nonlinear programming (NLP) problems. This solver seeks a local solution from a subset of these points, holding discrete variables fixed. The procedure is motivated by our desire to combine the superior accuracy and feasibility-seeking behavior of gradient-based local NLP solvers with the global optimization abilities of OptQuest. Computational results include 155 smooth NLP and mixed integer nonlinear program (MINLP) problems due to Floudas et al. (1999), most with both linear and nonlinear constraints, coded in the GAMS modeling language. Some are quite large for global optimization, with over 100 variables and 100 constraints. Global solutions to almost all problems are found in a small number of local solver calls, often one or two.
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
(2021) · A First Course in Statistical Programming with R · doi:10.1017/9781108993456.011 · Cited by 13,724
Bertsekas, D. P. (1997) · Journal of the Operational Research Society · doi:10.1038/sj.jors.2600425 · Cited by 11,726
(1999) · Springer Series in Operations Research and Financial Engineering · doi:10.1007/b98874 · Cited by 9,482
Optimization of Chemical Processes
Edgar, T. F., Himmelblau, D. M., & Lasdon, L. S. (1987) · Cited by 922
Self-citationLinear and Non Linear Programming
Nash, S. G. (1996) · UCLA - Biblioteca de Ciencias y Tecnologia Felix Morales Bueno · Cited by 841
Linear and nonlinear programming
(2005) · Economists’ Mathematical Manual · doi:10.1007/3-540-28518-0_15 · Cited by 766
A template for scatter search and path relinking
Glover, F. (1998) · Lecture notes in computer science · doi:10.1007/bfb0026589 · Cited by 727
Self-citationZimmermann, H. (1979) · European Journal of Operational Research · doi:10.1016/0377-2217(79)90240-6 · Cited by 698
Drud, A. S. (1994) · ORSA Journal on Computing · doi:10.1287/ijoc.6.2.207 · Cited by 690
Handbook of Test Problems in Local and Global Optimization
Floudas, C. A., Pardalos, P. M., Adjiman, C. S., Esposito, W. R., Gümüş, Z. H., Harding, S. T., Klepeis, J. L., Meyer, C. A., & Schweiger, C. A. (1999) · Nonconvex Optimization and Its Applications · doi:10.1007/978-1-4757-3040-1 · Cited by 636
Cited by
A Stochastic Radial Basis Function Method for the Global Optimization of Expensive Functions
Regis, R. G., & Shoemaker, C. A. (2007) · INFORMS Journal on Computing · doi:10.1287/ijoc.1060.0182 · Cited by 528
Automated Algorithm Selection: Survey and Perspectives
Kerschke, P., Hoos, H. H., Neumann, F., & Trautmann, H. (2019) · Evolutionary Computation · doi:10.1162/evco_a_00242 · Cited by 435
Su, X., Masoum, M. A. S., & Wolfs, P. J. (2014) · IEEE Transactions on Sustainable Energy · doi:10.1109/tste.2014.2313862 · Cited by 342
Bringing a Blurry Frame Alive at High Frame-Rate With an Event Camera
Pan, L., Scheerlinck, C., Yu, X., Hartley, R., Liu, M., & Dai, Y. (2019) · 2019 IEEE/CVF Conference on Computer Vision and Pattern Recognition (CVPR) · doi:10.1109/cvpr.2019.00698 · Cited by 308
State-of-the-Art and Comparative Review of Adaptive Sampling Methods for Kriging
Fuhg, J. N., Fau, A., & Nackenhorst, U. (2021) · Archives of Computational Methods in Engineering · doi:10.1007/s11831-020-09474-6 · Cited by 295
Iturria-Medina, Y., Carbonell, F., Assadi, A., Adewale, Q., Khan, A. F., Baumeister, T. R., & Sanchez-Rodriguez, L. (2021) · Communications Biology · doi:10.1038/s42003-021-02133-x · Cited by 37
Morettini, M., Burattini, L., Göbl, C., Pacini, G., Ahrén, B., & Tura, A. (2021) · Frontiers in Endocrinology · doi:10.3389/fendo.2021.611147 · Cited by 27
“To find the global minimum among several possible local minima, a total of 10 runs of the lsqnonlin local solver from different starting point (randomly generated, between 0 and 1) have been performed using theMultiStart algorithm (36), which repeatedly runs the solver of the model starting from different initial valu…”
MethodBibliometric Literature Review of Adaptive Learning Systems
Koutsantonis, D., Koutsantonis, K., Bakas, N. P., Plevris, V., Langousis, A., & Chatzichristofis, S. A. (2022) · Sustainability · doi:10.3390/su141912684 · Cited by 21
Market Power and Joint Ownership: Evidence from Nuclear Plants in Sweden
Lundin, E. (2016) · doi:10.2139/ssrn.2743221 · Cited by 11
Metadata
- Authors
- Ugray, Z., Lasdon, L., Plummer, J., Glover, F., Kelly, J., & Martí, R.
- Venue
- INFORMS Journal on Computing
- Published
- 2007-08
- Volume
- 19
- Issue
- 3
- Pages
- 328-340
- ISSN
- 0899-1499 (ISSN-L)
- 1091-9856
- 1526-5528
- OpenAlex
- W2145633829
- Cited by
- 726
- References
- 21
- FWCI
- 3.65
- 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.