Branch-and-bound methods for solving systems of Lipschitzian equations and inequalities (Q1090614)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: Branch-and-bound methods for solving systems of Lipschitzian equations and inequalities |
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Branch-and-bound methods for solving systems of Lipschitzian equations and inequalities |
scientific article |
Statements
Branch-and-bound methods for solving systems of Lipschitzian equations and inequalities (English)
0 references
1988
0 references
We show how branch-and-bound methods that previously have been 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.
0 references
branch-and-bound
0 references
multiextremal global optimization
0 references
systems of Lipschitzian equations
0 references
systems of inequalities
0 references
fixed points
0 references
