The DOI matches its Crossref record; 78 of the 78 references it cites were found in a registry or an index.
Retrospective on optimization
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 Simplex Method for Function Minimization
Nelder, J. A., & Mead, R. (1965) · The Computer Journal · doi:10.1093/comjnl/7.4.308 · Cited by 28,905
(1999) · Springer Series in Operations Research and Financial Engineering · doi:10.1007/b98874 · Cited by 9,482
Practical Methods of Optimization
Fletcher, R. (2000) · Wiley eBooks · doi:10.1002/9781118723203 · Cited by 7,605
Introduction to Stochastic Programming
Birge, J. R., & Louveaux, F. (2011) · Springer Series in Operations Research and Financial Engineering · doi:10.1007/978-1-4614-0237-4 · Cited by 6,469
Applied Optimal Control: Optimization, Estimation, and Control
Bryson, A. E., & Ho, Y.-C. (2018) · Routledge eBooks · doi:10.1201/9781315137667 · Cited by 6,015
Linear Programming and Extensions
Dantzig, G. (1963) · RAND Corporation eBooks · doi:10.7249/r366 · Cited by 5,755
Integer and Combinatorial Optimization
Williams, H. P., Nemhauser, G. L., & Wolsey, L. A. (1990) · Journal of the Operational Research Society · doi:10.2307/2583737 · Cited by 5,485
Powell, M. J. D. (1964) · The Computer Journal · doi:10.1093/comjnl/7.2.155 · Cited by 4,632 · cited 1×
“Methods that fall into this class include the conjugate direction method of Powell (1964), simplex and complex searches, in particular Nelder-Mead (1965), the adaptive random search methods of Luus-Jaakola (1973), Goulcher and Cesares Long and Banga et al. All of these methods are based on well…”
Method`` Direct Search'' Solution of Numerical and Statistical Problems
Hooke, R., & Jeeves, T. A. (1961) · Journal of the ACM · doi:10.1145/321062.321069 · Cited by 4,254
The Mathematical Theory of Optimal Processes
Bellman, R., Pontryagin, L. S., Boltyanskii, V. G., Gamkrelidze, R. V., Mishchenko, E. F., Trirogoff, K. N., & Neustadt, L. W. (1965) · Econometrica · doi:10.2307/1911909 · Cited by 4,211
Partitioning procedures for solving mixed-variables programming problems
Benders, J. F. (1962) · Numerische Mathematik · doi:10.1007/bf01386316 · Cited by 3,855
Mathematical Theory of Optimal Processes
Pontryagin, L. S. (2018) · Routledge eBooks · doi:10.1201/9780203749319 · Cited by 3,713
Practical Methods of Optimization.
Witzgall, C., & Fletcher, R. (1989) · Mathematics of Computation · doi:10.2307/2008742 · Cited by 3,591
Introduction to Operations Research
Leimkuhler, F. F. (1968) · Technometrics · doi:10.1080/00401706.1968.10490578 · Cited by 3,405
Integer and Combinatorial Optimization
Nemhauser, G., & Wolsey, L. (1988) · Wiley eBooks · doi:10.1002/9781118627372 · Cited by 3,176
Conn, A. R., Gould, N. I. M., & Toint, P. L. (2000) · Society for Industrial and Applied Mathematics eBooks · doi:10.1137/1.9780898719857 · Cited by 2,981
Brook, A., Kendrick, D., & Meeraus, A. (1988) · ACM SIGNUM Newsletter · doi:10.1145/58859.58863 · Cited by 2,973
Simulated annealing: theory and applications.
(1988) · Mathematics and Computers in Simulation · doi:10.1016/0378-4754(88)90023-7 · Cited by 2,966
Linear Programming and Extensions
Dantzig, G. (1963) · Princeton University Press eBooks · doi:10.1515/9781400884179 · Cited by 2,713
Applied Optimal Control: Optimization, Estimation, and Control
Bryson, A. E., Ho, Y.-C., & Siouris, G. M. (1979) · IEEE Transactions on Systems, Man, and Cybernetics · doi:10.1109/tsmc.1979.4310229 · Cited by 2,582
Generalized Benders decomposition
Geoffrion, A. M. (1972) · Journal of Optimization Theory and Applications · doi:10.1007/bf00934810 · Cited by 2,478
Handbooks in operations research and management science
Nemhauser, G. L., & Kan, A. H. G. R. (1989) · Elsevier eBooks · Cited by 2,436
Primal-Dual Interior-Point Methods
Wright, S. J. (1997) · Society for Industrial and Applied Mathematics eBooks · doi:10.1137/1.9781611971453 · Cited by 2,391
Simulated Annealing: Theory and Applications
van Laarhoven, P. J. M., & Aarts, E. H. L. (1987) · Springer eBooks · doi:10.1007/978-94-015-7744-1 · Cited by 2,385
Nonlinear Programming: Theory and Algorithms
Bazaraa, M. S., Sherali, H. D., & Shetty, C. M. (2006) · Wiley eBooks · doi:10.1002/0471787779 · Cited by 2,369
Branch-and-price: column generation for solving huge integer programs
Barnhart, C., Johnson, E. L., Nemhauser, G. L., Savelsbergh, M. W. P., & Vance, P. H. (1998) · Operations Research · doi:10.1287/opre.46.3.316 · Cited by 2,219
AMPL : a modeling language for mathematical programming
Fourer, R., & Kernighan, B. W. (1993) · Cited by 1,860
An Interior Point Algorithm for Large-Scale Nonlinear Programming
Byrd, R. H., Hribar, M. E., & Nocedal, J. (1999) · SIAM Journal on Optimization · doi:10.1137/s1052623497325107 · Cited by 1,739
The Cutting-Plane Method for Solving Convex Programs
Kelley, Jr. (1960) · Journal of the Society for Industrial and Applied Mathematics · doi:10.1137/0108053 · Cited by 1,549
(1998) · Spoken Language System and Corpus Design · doi:10.1515/9783110809817.1 · Cited by 1,488
An outer-approximation algorithm for a class of mixed-integer nonlinear programs
Duran, M. A., & Grossmann, I. E. (1986) · Mathematical Programming · doi:10.1007/bf02592064 · Cited by 1,447
Self-citationPractical Methods for Optimal Control using Nonlinear Programming
Betts, & Kolmanovsky (2002) · Applied Mechanics Reviews · doi:10.1115/1.1483351 · Cited by 1,443
A Multiple Shooting Algorithm for Direct Solution of Optimal Control Problems *
Bock, H. G., & Plitt, K. J. (1984) · IFAC Proceedings Volumes · doi:10.1016/s1474-6670(17)61205-9 · Cited by 1,306
Optimization under uncertainty: state-of-the-art and opportunities
Sahinidis, N. V. (2003) · Computers & Chemical Engineering · doi:10.1016/j.compchemeng.2003.09.017 · Cited by 1,182
Linear Programming Under Uncertainty
Dantzig, G. B. (2004) · Management Science · doi:10.1287/mnsc.1040.0261 · Cited by 1,173
More Test Examples for Nonlinear Programming Codes
Schittkowski, K. (1987) · Lecture notes in economics and mathematical systems · doi:10.1007/978-3-642-61582-5 · Cited by 1,163
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
Polak, E. (1997) · Applied Mathematical Sciences · doi:10.1007/978-1-4612-0663-7 · Cited by 914
BARON: A general purpose global optimization software package
Sahinidis, N. V. (1996) · Journal of Global Optimization · doi:10.1007/bf00138693 · Cited by 840
Partitioning procedures for solving mixed-variables programming problems
Benders, J. F. (2005) · Computational Management Science · doi:10.1007/s10287-004-0020-y · Cited by 837
Introduction to Operations Research
(1968) · Mathematics in Science and Engineering/Mathematics in science and engineering · doi:10.1016/s0076-5392(08)x6025-4 · Cited by 793
Optimization of Chemical Processes
Edgar, T. F., Himmelblau, D. M., & Lasdon, L. S. (1987) · Cited by 758
Accelerating Benders Decomposition: Algorithmic Enhancement and Model Selection Criteria
Magnanti, T. L., & Wong, R. T. (1981) · Operations Research · doi:10.1287/opre.29.3.464 · Cited by 731
A tree-search algorithm for mixed integer programming problems
Dakin, R. J. (1965) · The Computer Journal · doi:10.1093/comjnl/8.3.250 · Cited by 640
Numerical Techniques for Stochastic Optimization
(1988) · Springer Series in Computational Mathematics · doi:10.1007/978-3-642-61370-8 · Cited by 632
Evolutionary Operation: A Method for Increasing Industrial Productivity
Box, G. E. P. (1957) · Applied Statistics · doi:10.2307/2985505 · Cited by 576
Application of Interior-Point Methods to Model Predictive Control
Rao, C. V., Wright, S. J., & Rawlings, J. B. (1998) · Journal of Optimization Theory and Applications · doi:10.1023/a:1021711402723 · Cited by 536
Vassiliadis, V. S., Sargent, R. W. H., & Pantelides, C. C. (1994) · Industrial & Engineering Chemistry Research · doi:10.1021/ie00033a014 · Cited by 530
An LP/NLP based branch and bound algorithm for convex MINLP optimization problems
Quesada, I., & Grossmann, I. E. (1992) · Computers & Chemical Engineering · doi:10.1016/0098-1354(92)80028-8 · Cited by 455
Self-citationRuszczyński, A., & Shapiro, A. (2003) · Handbooks in Operations Research and Management Science · doi:10.1016/s0927-0507(03)10001-1 · Cited by 452
On the optimization of differential‐algebraic process systems
Cuthrell, J. E., & Biegler, L. T. (1987) · AIChE Journal · doi:10.1002/aic.690330804 · Cited by 450
Self-citationAdvances in simultaneous strategies for dynamic process optimization
Biegler, L. T., Cervantes, A. M., & Wächter, A. (2002) · Chemical Engineering Science · doi:10.1016/s0009-2509(01)00376-1 · Cited by 428
Self-citationSimultaneous optimization and solution methods for batch reactor control profiles
Cuthrell, J. E., & Biegler, L. T. (1989) · Computers & Chemical Engineering · doi:10.1016/0098-1354(89)89006-4 · Cited by 339
Self-citationSolution of a Class of Multistage Dynamic Optimization Problems. 2. Problems with Path Constraints
Vassiliadis, V. S., Sargent, R. W. H., & Pantelides, C. C. (1994) · Industrial & Engineering Chemistry Research · doi:10.1021/ie00033a015 · Cited by 307
Global Convergence of a Trust-Region SQP-Filter Algorithm for General Nonlinear Programming
Fletcher, R., Gould, N. I. M., Leyffer, S., Toint, P. L., & Wächter, A. (2002) · SIAM Journal on Optimization · doi:10.1137/s1052623499357258 · Cited by 279
Direct Search Methods on Parallel Machines
Dennis, J. E., & Torczon, V. (1992) · Operations Research ’91 · doi:10.1007/978-3-642-48417-9_2 · Cited by 279
Smith, E. M. B., & Pantelides, C. C. (1999) · Computers & Chemical Engineering · doi:10.1016/s0098-1354(98)00286-5 · Cited by 263
On the Convergence of the Multidirectional Search Algorithm
Torczon, V. (1991) · SIAM Journal on Optimization · doi:10.1137/0801010 · Cited by 260
MIP: Theory and Practice — Closing the Gap
Bixby, E. R., Fenelon, M., Gu, Z., Rothberg, E., & Wunderling, R. (2000) · IFIP Advances in Information and Communication Technology · doi:10.1007/978-0-387-35514-6_2 · Cited by 258
Recent progress in unconstrained nonlinear optimization without derivatives
Conn, A. R., Scheinberg, K., & Toint, P. L. (1997) · Mathematical Programming · doi:10.1007/bf02614326 · Cited by 255
Direct Search Methods on Parallel Machines
Dennis, Jr., & Torczon, V. (1991) · SIAM Journal on Optimization · doi:10.1137/0801027 · Cited by 251
Introduction to Model Based Optimization of Chemical Processes on Moving Horizons
Binder, T., Blank, L., Bock, H. G., Bulirsch, R., Dahmen, W., Diehl, M., Kronseder, T., Marquardt, W., Schlöder, J. P., & von Stryk, O. (2001) · Online Optimization of Large Scale Systems · doi:10.1007/978-3-662-04331-8_18 · Cited by 206
Progress in Linear Programming-Based Algorithms for Integer Programming: An Exposition
Johnson, E. L., Nemhauser, G. L., & Savelsbergh, M. W. P. (2000) · INFORMS Journal on Computing · doi:10.1287/ijoc.12.1.2.11900 · Cited by 206
(2011) · SpringerReference · doi:10.1007/springerreference_6206 · Cited by 177
On the Optimisation of Periodic Adsorption Processes
Nilchan, S., & Pantelides, C. C. (1998) · Adsorption · doi:10.1023/a:1008823102106 · Cited by 156
Vassiliadis, V. S. (1993) · Spiral (Imperial College London) · Cited by 144
Gradient Optimization and Nonlinear Control
Hasdorff, L. (1976) · Medical Entomology and Zoology · Cited by 137
Trust-Region Interior-Point SQP Algorithms for a Class of Nonlinear Programming Problems
Dennis, J. E., Heinkenschloss, M., & Vicente, L. N. (1998) · SIAM Journal on Control and Optimization · doi:10.1137/s036012995279031 · Cited by 121
(1995) · Lecture notes in economics and mathematical systems · doi:10.1007/978-3-642-88272-2 · Cited by 120
Sensor network design of linear processes using genetic algorithms
Sen, S., Narasimhan, S., & Deb, K. (1998) · Computers & Chemical Engineering · doi:10.1016/s0098-1354(97)00242-1 · Cited by 120
Global Optimization of Chemical Processes using Stochastic Algorithms
Banga, J. R., & Seider, W. D. (1996) · Nonconvex optimization and its applications · doi:10.1007/978-1-4613-3437-8_33 · Cited by 108
Failure of global convergence for a class of interior point methods for nonlinear programming
Wächter, A., & Biegler, L. T. (2000) · Mathematical Programming · doi:10.1007/pl00011386 · Cited by 100
Self-citationStable Decomposition for Dynamic Optimization
Tanartkit, P., & Biegler, L. T. (1995) · Industrial & Engineering Chemistry Research · doi:10.1021/ie00043a029 · Cited by 68
Self-citationIncorporating joint confidence regions into design under uncertainty
Rooney, W. C., & Biegler, L. T. (1999) · Computers & Chemical Engineering · doi:10.1016/s0098-1354(99)00311-7 · Cited by 65
Self-citationGeneralized branch-and-cut framework for mixed-integer nonlinear optimization problems
Kesavan, P., & Barton, P. I. (2000) · Computers & Chemical Engineering · doi:10.1016/s0098-1354(00)00421-x · Cited by 60
Use of random admissible values for control in iterative dynamic programming
Bojkov, B., & Luus, R. (1992) · Industrial & Engineering Chemistry Research · doi:10.1021/ie00005a011 · Cited by 46
Goulcher, R. W., & Long, J. J. C. (1978) · Computers & Chemical Engineering · doi:10.1016/0098-1354(78)80004-0 · Cited by 42
A cutting plane method for minimizing pseudo-convex functions in the mixed integer case
Pörn, R., & Westerlund, T. (2000) · Computers & Chemical Engineering · doi:10.1016/s0098-1354(00)00622-0 · Cited by 32
Cited by
Parameter estimation for differential equations: a generalized smoothing approach
Ramsay, J. O., Hooker, G., Campbell, D., & Cao, J. (2007) · Journal of the Royal Statistical Society Series B: Statistical Methodology · doi:10.1111/j.1467-9868.2007.00610.x · Cited by 613
Tapia, J. F. D., Lee, J.-Y., Ooi, R. E. H., Foo, D. C. Y., & Tan, R. R. (2018) · Sustainable Production and Consumption · doi:10.1016/j.spc.2017.10.001 · Cited by 455
Ning, C., & You, F. (2019) · Computers & Chemical Engineering · doi:10.1016/j.compchemeng.2019.03.034 · Cited by 343
Process systems engineering – The generation next?
Pistikopoulos, E. N., Barbosa-Povoa, A., Lee, J. H., Misener, R., Mitsos, A., Reklaitis, G. V., Venkatasubramanian, V, You, F., & Gani, R. (2021) · Computers & Chemical Engineering · doi:10.1016/j.compchemeng.2021.107252 · Cited by 260
Ajagekar, A., Humble, T., & You, F. (2020) · Computers & Chemical Engineering · doi:10.1016/j.compchemeng.2019.106630 · Cited by 191
“Over the past years, deterministic optimization techniques, especially nonlinear programming and mixed-integer nonlinear programming (MINLP) algorithms, have received growing attention from academia and industry [3, 4].”
Background
Metadata
- Authors
- Biegler, L. T., & Grossmann, I. E.
- Venue
- Computers & Chemical Engineering
- Publisher
- Elsevier BV
- Published
- 2004-07
- Volume
- 28
- Issue
- 8
- Pages
- 1169-1192
- ISSN
- 0098-1354 (ISSN-L)
- OpenAlex
- W2149518557
- Cited by
- 593
- References
- 78
- FWCI
- 38.27
- 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.