Branch-and-bound methods for solving systems of Lipschitzian equations and inequalities (Q1090614): Difference between revisions
From MaRDI portal
Removed claims |
Changed an Item |
||
| Property / author | |||
| Property / author: Reiner Horst / rank | |||
Normal rank | |||
| Property / author | |||
| Property / author: Nguyen Van Thoai / rank | |||
Normal rank | |||
Revision as of 19:50, 9 February 2024
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
