An interior semi-infinite programming method (Q1093544)
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 4023034
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | An interior semi-infinite programming method |
scientific article; zbMATH DE number 4023034 |
Statements
An interior semi-infinite programming method (English)
0 references
1988
0 references
A new method for semi-infinite programming problems with convex constraints is presented. The method generates a sequence of feasible points whose cluster points are solutions of the original problem. No maximization over the index set is required. Some computational results are also presented.
0 references
discretization
0 references
convex constraints
0 references
sequence of feasible points
0 references
cluster points
0 references
0.873173713684082
0 references
0.8596665263175964
0 references
0.845943808555603
0 references
0.8337938189506531
0 references
