A new quadratic semi-infinite programming algorithm based on dual parametrization (Q557361)
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 2182305
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | A new quadratic semi-infinite programming algorithm based on dual parametrization |
scientific article; zbMATH DE number 2182305 |
Statements
A new quadratic semi-infinite programming algorithm based on dual parametrization (English)
0 references
23 June 2005
0 references
In this paper strictly convex quadratic semi-infinite programming problems are considered. The dual problem is formulated in terms of Borel measures. With Carathéodory's theorem it is shown that the optimal measure has finite support and this fact is used in an algorithm. Under the assumption of an approximation property for the index set, the convergence of the method is shown.
0 references
Semi-infinite programming
0 references
numerical method
0 references
0.9557785391807556
0 references
0.8737301230430603
0 references
0.87071293592453
0 references
0.8500044941902161
0 references
