Global optimization of univariate Lipschitz functions: II. New algorithms and computational comparison
Authors:
- 1 April 1992
- journal article
- Published by Springer Nature in Mathematical Programming
- Vol. 55 (1-3) , 273-292
Abstract
No abstract availableKeywords
This publication has 21 references indexed in Scilit:
- Bounds for min-max heapsBIT Numerical Mathematics, 1987
- Min-max heaps and generalized priority queuesCommunications of the ACM, 1986
- An optimal single-step algorithm for maximizing doubly differentiable functionsUSSR Computational Mathematics and Mathematical Physics, 1986
- The cubic algorithmJournal of Mathematical Analysis and Applications, 1985
- Optimal Search for the Global Maximum of Functions with Bounded SeminormSIAM Journal on Numerical Analysis, 1985
- Computing the range of values of real functions with accuracy higher than second orderComputing, 1984
- Iterative Methods for the Localization of the Global MaximumSIAM Journal on Numerical Analysis, 1982
- Global optimization using interval analysis: The one-dimensional caseJournal of Optimization Theory and Applications, 1979
- The Range of Possible Values of f(x)IMA Journal of Applied Mathematics, 1978
- Numerical methods for finding global extrema (Case of a non-uniform mesh)USSR Computational Mathematics and Mathematical Physics, 1971