Branch-and-bound methods for solving systems of Lipschitzian equations and inequalities (Q1090614): Difference between revisions
From MaRDI portal
Set profile property. |
ReferenceBot (talk | contribs) Changed an Item |
||
| Property / cites work | |||
| Property / cites work: On the convergence of global methods in multiextremal optimization / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Deterministic global optimization with partition sets whose feasibility is not known: Application to concave minimization, reserve convex constraints, DC-programming and Lipschitzian optimization / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Extended univariate algorithms for \(n\)-dimensional global optimization / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: The Approximation of Fixed Points of a Continuous Mapping / rank | |||
Normal rank | |||
Revision as of 19:17, 17 June 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
