A new quadratic semi-infinite programming algorithm based on dual parametrization (Q557361): Difference between revisions
From MaRDI portal
Set profile property. |
Set OpenAlex properties. |
||
| Property / full work available at URL | |||
| Property / full work available at URL: https://doi.org/10.1023/b:jogo.0000047910.80739.95 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W1964806748 / rank | |||
Normal rank | |||
Latest revision as of 10:47, 30 July 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | A new quadratic semi-infinite programming algorithm based on dual parametrization |
scientific article |
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
