On the convergence of global methods in multiextremal optimization
- 1 August 1987
- journal article
- Published by Springer Nature in Journal of Optimization Theory and Applications
- Vol. 54 (2) , 253-271
- https://doi.org/10.1007/bf00939434
Abstract
No abstract availableKeywords
This publication has 7 references indexed in Scilit:
- A general class of branch-and-bound methods in global optimization with some new approaches for concave minimizationJournal of Optimization Theory and Applications, 1986
- Globally convergent methods for n-dimensional multiextremal optimizationOptimization, 1986
- The cubic algorithmJournal of Mathematical Analysis and Applications, 1985
- Convergent Algorithms for Minimizing a Concave FunctionMathematics of Operations Research, 1980
- An algorithm for nonconvex programming problemsMathematical Programming, 1976
- A Sequential Method Seeking the Global Maximum of a FunctionSIAM Journal on Numerical Analysis, 1972
- An algorithm for finding the absolute extremum of a functionUSSR Computational Mathematics and Mathematical Physics, 1972