Abstract
In this note, we show how branch-and-bound methods previously proposed for solving broad classes of multiextremal global optimization problems can be applied for solving systems of Lipschitzian equations and inequalities over feasible sets defined by various types of constraints. Some computational results are given.
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
References
Horst, R., andTuy, H.,On the Convergence of Global Methods in Multiextremal Optimization, Journal of Optimization Theory and Applications, Vol. 54, pp. 253–271, 1987.
Horst, R.,Deterministic Global Optimization with Partition Sets Whose Feasibility Is Not Known: Applications to Concave Minimization, Reverse Convex Constraints, DC-Programming, and Lipschitzian Optimization, Journal of Optimization Theory and Applications, Vol. 58, pp. 11–37, 1988.
Pinter, J.,Extended Univariate Algorithms for n-Dimensional Global Optimization, Computing, Vol. 36, pp. 91–103, 1986.
Scarf, H.,Approximation of Fixed Points, SIAM Journal on Applied Mathematics, Vol. 15, pp. 1328–1343, 1967.
Author information
Authors and Affiliations
Additional information
Communicated by G. Leitmann
This research was accomplished while the second author was a fellow of the Alexander von Humboldt Foundation at the University of Trier, Trier, West Germany.
Rights and permissions
About this article
Cite this article
Horst, R., Thoai, N.V. Branch-and-bound methods for solving systems of Lipschitzian equations and inequalities. J Optim Theory Appl 58, 139–145 (1988). https://doi.org/10.1007/BF00939776
Issue Date:
DOI: https://doi.org/10.1007/BF00939776