Branch-and-bound methods for solving systems of Lipschitzian equations and inequalities
- 1 July 1988
- journal article
- Published by Springer Nature in Journal of Optimization Theory and Applications
- Vol. 58 (1) , 139-145
- https://doi.org/10.1007/bf00939776
Abstract
No abstract availableKeywords
This publication has 4 references indexed in Scilit:
- Deterministic global optimization with partition sets whose feasibility is not known: Application to concave minimization, reverse convex constraints, DC-programming, and Lipschitzian optimizationJournal of Optimization Theory and Applications, 1988
- On the convergence of global methods in multiextremal optimizationJournal of Optimization Theory and Applications, 1987
- Extended univariate algorithms for n-dimensional global optimizationComputing, 1986
- The Approximation of Fixed Points of a Continuous MappingSIAM Journal on Applied Mathematics, 1967