Abstract
In this paper it is shown that the (GOP) algorithm is guaranteed to be convergent for a large class of smooth mathematical programming problems.
References
Floudas, C. A. and Visweswaran, V. (1990) A global optimization algorithm (GOP) for certain classes of nonconvex NLPs I-II,Computer Chemical Engineering,14, 1398–1434.
Floudas, C. A., and Visweswaran, V. (1993) A primal-relaxed dual global optimization approach,Journal of Optimization Theory and Applications,78, (2), 187–225.
Liu, W. B., and Floudas, C. A., (1993) A remark on the GOP algorithm for global optimization,Journal of Global Optimization,3, 519–521.
Liu, W. B., and Floudas, C. A., (1995) A generalized primal-relaxed dual approach for global optimization, to appear in JOTA.
Maranas, C. D., and Floudas, C. A., (1992) A global optimization approach for Lennard-Jones microclusters,Journal of Chemical Physics,97 (10), 7667–7678.
Visweswaran, V., and Floudas, C. A., (1992) Unconstrained and constrained global optimization of polynomial functions in one variable,Journal of Global Optimization,2, 73–100.
Visweswaran, V. and Floudas, C. A. (1993) New properties and computational improvement of the GOP algorithm for problems with quadratic objective functions and constraints,Journal of Global Optimization,3, 439–462.
Maranas, C. D. and Floudas, C. A. (1993) Global optimization in molecular conformation,Annals of Operations Research,42, 85–117.
Maranas, C. D. and Floudas, C. A. (1994) Global minimum potential energy conformations of small molecules,Journal of Global Optimization,4, 135–170.
Author information
Authors and Affiliations
Rights and permissions
About this article
Cite this article
Liu, W.B., Floudas, C.A. Convergence of the (GOP) algorithm for a large class of smooth optimization problems. J Glob Optim 6, 207–211 (1995). https://doi.org/10.1007/BF01096769
Received:
Accepted:
Issue Date:
DOI: https://doi.org/10.1007/BF01096769