Trap-doors in the solution set of semi-infinite optimization problems (Q4362999)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 1086749
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Trap-doors in the solution set of semi-infinite optimization problems |
scientific article; zbMATH DE number 1086749 |
Statements
1997
0 references
0.8427107930183411
0 references
Trap-doors in the solution set of semi-infinite optimization problems (English)
0 references
For one-parametric optimization problems it is well known that, in the generic case, each generalized critical (g.c.) point belongs to one of exactly five different types, where the degenerate points (type 2 to 5) form the boundary of the set of nondegenerate points (type 1). In particular, the set of g.c. points is closed. This is not the case in generic one-parametric semi-infinite programming, where three additional types of degenerate g.c. points occur. An example shows that the endpoint of a path of nondegenerate critical points does not have to be a g.c. point. Moreover, a pathfollowing algorithm cannot detect this point by using only local information, and even if global tests allow a detection, no descent direction for a jump to another connected component can be given. The author discusses the consequences of this phenomenon for pathfollowing methods in semi-infinite programming. Under the additional assumption of continuous dependence of the index set on the parameter, the closedness of the g.c. point set is derived. For the entire collection see [Zbl 0868.00068].
0 references