LP-form inclusion functions for global optimization (Q1174536): Difference between revisions
From MaRDI portal
Removed claim: reviewed by (P1447): Item:Q587149 |
Changed an Item |
||
| Property / reviewed by | |||
| Property / reviewed by: Ping-Qi Pan / rank | |||
Normal rank | |||
Revision as of 17:29, 16 February 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | LP-form inclusion functions for global optimization |
scientific article |
Statements
LP-form inclusion functions for global optimization (English)
0 references
25 June 1992
0 references
The paper presents a new approach to the bounding problem within branch- and-bound methods for global optimization where the objective and constraints are factorable \(C^ 1\) functions. For a given subregion generated by a branching strategy, a polyhedral envelope for each function is constructed, and the range of it is then computed by linear programs, determining bounds on the functions. ''Partial monotonicity'' is exploited to reduce the effective dimension of subregions.
0 references
LP-form inclusion functions
0 references
branch-and-bound methods
0 references
global optimization
0 references
polyhedral envelope
0 references
linear programs
0 references
partial monotonicity
0 references
