The DOI matches its Crossref record.
Numerical Methods for Non-Linear 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
Cited by
A training algorithm for optimal margin classifiers
Boser, B. E., Guyon, I. M., & Vapnik, V. N. (1992) · Proceedings of the fifth annual workshop on Computational learning theory · doi:10.1145/130385.130401 · Cited by 11,992
Optimization of Control Parameters for Genetic Algorithms
Grefenstette, J. (1986) · IEEE Transactions on Systems, Man, and Cybernetics · doi:10.1109/tsmc.1986.289288 · Cited by 2,854
Survey of Numerical Methods for Trajectory Optimization
Betts, J. T. (1998) · Journal of Guidance, Control, and Dynamics · doi:10.2514/2.4231 · Cited by 2,602
McCormick, G. P. (1976) · Mathematical Programming · doi:10.1007/bf01580665 · Cited by 2,281
Sequential quadratic programming
Boggs, P. T., & Tolle, J. W. (1995) · Acta Numerica · doi:10.1017/s0962492900002518 · Cited by 1,858
Restart procedures for the conjugate gradient method
Powell, M. J. D. (1977) · Mathematical Programming · doi:10.1007/bf01593790 · Cited by 1,717
A fast algorithm for nonlinearly constrained optimization calculations
Powell, M. J. D. (1978) · Lecture Notes in Mathematics · doi:10.1007/bfb0067703 · Cited by 1,661
A generalized synchronous transit method for transition state location
Govind, N., Petersen, M., Fitzgerald, G., King-Smith, D., & Andzelm, J. (2003) · Computational Materials Science · doi:10.1016/s0927-0256(03)00111-3 · Cited by 1,305
A literature survey of benchmark functions for global optimisation problems
Jamil, M., & Yang, X. S. (2013) · International Journal of Mathematical Modelling and Numerical Optimisation · doi:10.1504/ijmmno.2013.055204 · Cited by 1,301
Direct trajectory optimization using nonlinear programming and collocation
Hargraves, C. R., & Paris, S. W. (1987) · Journal of Guidance, Control, and Dynamics · doi:10.2514/3.20223 · Cited by 1,161
A numerically stable dual method for solving strictly convex quadratic programs
Goldfarb, D., & Idnani, A. (1983) · Mathematical Programming · doi:10.1007/bf02591962 · Cited by 1,059
Econometrics: Alchemy or Science?: Essays in Econometric Methodology
Hendry, D. F. (2000) · doi:10.1093/0198293542.001.0001 · Cited by 634
Global Optimization of Stochastic Black-Box Systems via Sequential Kriging Meta-Models
Huang, D., Allen, T. T., Notz, W. I., & Zeng, N. (2006) · Journal of Global Optimization · doi:10.1007/s10898-005-2454-3 · Cited by 625
Augmented Lagrange Multiplier Functions and Duality in Nonconvex Programming
Rockafellar, R. T. (1974) · SIAM Journal on Control · doi:10.1137/0312021 · Cited by 587
THE CONVERGENCE OF VARIABLE METRIC METHODS FOR NONLINEARLY CONSTRAINED OPTIMIZATION CALCULATIONS
Powell, M. J. D. (1978) · Nonlinear Programming 3 · doi:10.1016/b978-0-12-468660-1.50007-4 · Cited by 541
Algorithms for nonlinear constraints that use lagrangian functions
Powell, M. J. D. (1978) · Mathematical Programming · doi:10.1007/bf01588967 · Cited by 514
Superlinearly convergent variable metric algorithms for general nonlinear programming problems
Han, S.-P. (1976) · Mathematical Programming · doi:10.1007/bf01580395 · Cited by 477
Hendry, D. F., & Mizon, G. E. (2000) · Econometrics: Alchemy or Science? · doi:10.1093/0198293542.003.0007 · Cited by 430
Stochastic global optimization methods part II: Multi level methods
Rinnooy Kan, A. H. G., & Timmer, G. T. (1987) · Mathematical Programming · doi:10.1007/bf02592071 · Cited by 379
Bertsekas, D. P. (1976) · Automatica · doi:10.1016/0005-1098(76)90077-7 · Cited by 347
An interior point algorithm for nonlinear quantile regression
Koenker, R., & Park, B. J. (1996) · Journal of Econometrics · doi:10.1016/0304-4076(96)84507-6 · Cited by 339
Theory of algorithms for unconstrained optimization
Nocedal, J. (1992) · Acta Numerica · doi:10.1017/s0962492900002270 · Cited by 333
The solution of nonlinear inverse problems and the Levenberg-Marquardt method
Pujol, J. (2007) · Geophysics · doi:10.1190/1.2732552 · Cited by 258
Robinson, S. M. (1974) · Mathematical Programming · doi:10.1007/bf01585500 · Cited by 254
Effect of dimensionality on the Nelder–Mead simplex method
Han, L., & Neumann, M. (2006) · Optimization Methods and Software · doi:10.1080/10556780512331318290 · Cited by 127
Metadata
- Authors
- Vajda, S., & Lootsma, F. A.
- Venue
- Operational Research Quarterly (1970-1977)
- Publisher
- JSTOR
- Published
- 1973-12
- Volume
- 24
- Issue
- 4
- Pages
- 646
- ISSN
- 0030-3623 (ISSN-L)
- OpenAlex
- W4254522940
- Cited by
- 589
- References
- 0
- FWCI
- 20.22
- 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.