A global optimization algorithm (GOP) for certain classes of nonconvex NLPs—I. Theory
Authors:
- C.A. FloudasCFC.A. Floudas
- V. VisweswaranVVV. Visweswaran
- 1 December 1990
- journal article
- Published by Elsevier in Computers & Chemical Engineering
- Vol. 14 (12) , 1397-1417
Abstract
No abstract availableThis publication has 22 references indexed in Scilit:
- A global optimization algorithm (GOP) for certain classes of nonconvex NLPs—II. Application of theory and test problemsComputers & Chemical Engineering, 1990
- Global optimum search for nonconvex NLP and MINLP problemsComputers & Chemical Engineering, 1989
- Computational experience with dicopt solving MINLP problems in process systems engineeringComputers & Chemical Engineering, 1989
- Global optimization of nonconvex mixed-integer nonlinear programming (MINLP) problems in process synthesisIndustrial & Engineering Chemistry Research, 1988
- Checking local optimality in constrained quadratic programming is NP-hardOperations Research Letters, 1988
- Globally minimizing polynomials without evaluating derivativesInternational Journal of Computer Mathematics, 1985
- A survey on the global optimization problem: General theory and computational approachesAnnals of Operations Research, 1984
- Optimization by Simulated AnnealingScience, 1983
- Assuring a global optimum by the use of an upper bound on the lower (dual) boundComputers & Chemical Engineering, 1978
- An algorithm for finding the absolute extremum of a functionUSSR Computational Mathematics and Mathematical Physics, 1972