A new quadratic semi-infinite programming algorithm based on dual parametrization (Q557361): Difference between revisions
From MaRDI portal
Created a new Item |
Set OpenAlex properties. |
||
| (5 intermediate revisions by 4 users not shown) | |||
| Property / author | |||
| Property / author: Q557359 / rank | |||
| Property / author | |||
| Property / author: Kok Lay Teo / rank | |||
| Property / author | |||
| Property / author: Soon-Yi Wu / rank | |||
| Property / author | |||
| Property / author: Kok Lay Teo / rank | |||
Normal rank | |||
| Property / author | |||
| Property / author: Soon-Yi Wu / rank | |||
Normal rank | |||
| Property / author | |||
| Property / author: Yanqun Liu / rank | |||
Normal rank | |||
| Property / review text | |||
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. | |||
| Property / review text: 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. / rank | |||
Normal rank | |||
| Property / Mathematics Subject Classification ID | |||
| Property / Mathematics Subject Classification ID: 90C34 / rank | |||
Normal rank | |||
| Property / Mathematics Subject Classification ID | |||
| Property / Mathematics Subject Classification ID: 90C20 / rank | |||
Normal rank | |||
| Property / Mathematics Subject Classification ID | |||
| Property / Mathematics Subject Classification ID: 90C25 / rank | |||
Normal rank | |||
| Property / zbMATH DE Number | |||
| Property / zbMATH DE Number: 2182305 / rank | |||
Normal rank | |||
| Property / zbMATH Keywords | |||
Semi-infinite programming | |||
| Property / zbMATH Keywords: Semi-infinite programming / rank | |||
Normal rank | |||
| Property / zbMATH Keywords | |||
numerical method | |||
| Property / zbMATH Keywords: numerical method / rank | |||
Normal rank | |||
| Property / reviewed by | |||
| Property / reviewed by: Ekkehard W. Sachs / rank | |||
Normal rank | |||
| Property / MaRDI profile type | |||
| Property / MaRDI profile type: MaRDI publication profile / rank | |||
Normal rank | |||
| 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 | |||
| links / mardi / name | links / mardi / name | ||
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
