Optimization by direct search and systematic reduction of the size of search region
- 1 July 1973
- journal article
- research article
- Published by Wiley in AIChE Journal
- Vol. 19 (4) , 760-766
- https://doi.org/10.1002/aic.690190413
Abstract
A direct search procedure utilizing pseudo random numbers over a region is presented to solve nonlinear programming problems. After each iteration the size of the region is reduced so that the optimum can be found as accurately as desired. The ease of programming, the speed of convergence, and the reliability of results make the procedure very attractive for solving nonlinear programming problems.Keywords
This publication has 13 references indexed in Scilit:
- A direct approach to optimization of a complex systemAIChE Journal, 1973
- Letters to the editorThe Canadian Journal of Chemical Engineering, 1973
- Simpat: Self-Bounding Direct Search Method for OptimizationIndustrial & Engineering Chemistry Process Design and Development, 1973
- A pseudo Newton-Raphson method for function minimizationJournal of Optimization Theory and Applications, 1972
- Mathematical model and optimization of drying process for a through‐circulation dryerThe Canadian Journal of Chemical Engineering, 1972
- Process optimization by the “complex” methodAIChE Journal, 1972
- Chemical Process Optimization Using Penalty FunctionsIndustrial & Engineering Chemistry Process Design and Development, 1970
- Pracniques: construction of nonlinear programming test problemsCommunications of the ACM, 1965
- Process Optimization by Nonlinear ProgrammingIndustrial & Engineering Chemistry Process Design and Development, 1965
- Chemical Equilibrium in Complex MixturesThe Journal of Chemical Physics, 1958