
doi: 10.1007/bf01096533
This paper studies acceleration techniques for a class of deterministic algorithms for global optimization. The acceleration techniques are applicable if the functions to be minimized have certain smoothness properties. They use the Lipschitz constant of the function and derivative information to construct better lower envelopes for the function. The acceleration techniques are derived from a geometric viewpoint. Numerical tests are performed, which compare the original algorithm and its accelerated version.
Nonlinear programming, lower envelopes, global optimization, multidimensional bisection, acceleration techniques, deterministic algorithms
Nonlinear programming, lower envelopes, global optimization, multidimensional bisection, acceleration techniques, deterministic algorithms
| selected citations These citations are derived from selected sources. This is an alternative to the "Influence" indicator, which also reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically). | 23 | |
| popularity This indicator reflects the "current" impact/attention (the "hype") of an article in the research community at large, based on the underlying citation network. | Average | |
| influence This indicator reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically). | Top 10% | |
| impulse This indicator reflects the initial momentum of an article directly after its publication, based on the underlying citation network. | Top 10% |
