Branch- and bound algorithms for solving global optimization problems with Lipschitzian structure
- 1 January 1988
- journal article
- research article
- Published by Taylor & Francis in Optimization
- Vol. 19 (1) , 101-110
- https://doi.org/10.1080/02331938808843322
Abstract
Adaptive partition and search methods are proposed to solve mathematica programming problems which are formulated with Lipschitz-continuous functions; the problems considered may typically have a multiextremal objective function and a non-convex feasible set. The suggested methods are globally convergent; besides, their structure permits efficient numerical realizations.Keywords
This publication has 10 references indexed in Scilit:
- On the convergence of global methods in multiextremal optimizationJournal of Optimization Theory and Applications, 1987
- Global optimization on convex setsOR Spectrum, 1986
- A general class of branch-and-bound methods in global optimization with some new approaches for concave minimizationJournal of Optimization Theory and Applications, 1986
- Extended univariate algorithms for n-dimensional global optimizationComputing, 1986
- Globally convergent methods for n-dimensional multiextremal optimizationOptimization, 1986
- On the global minimization of concave functionsOR Spectrum, 1984
- Convergence properties of stochastic optimization proceduresMathematische Operationsforschung und Statistik. Series Optimization, 1984
- A stochastic method for global optimizationMathematical Programming, 1982
- Axiomatic approach to statistical models and their use in multimodal optimization theoryMathematical Programming, 1982
- A Sequential Method Seeking the Global Maximum of a FunctionSIAM Journal on Numerical Analysis, 1972