Solving quadratic semi-infinite programming problems by using relaxed cutting-plane scheme (Q5936072)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: Solving quadratic semi-infinite programming problems by using relaxed cutting-plane scheme |
scientific article; zbMATH DE number 1612933
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Solving quadratic semi-infinite programming problems by using relaxed cutting-plane scheme |
scientific article; zbMATH DE number 1612933 |
Statements
Solving quadratic semi-infinite programming problems by using relaxed cutting-plane scheme (English)
0 references
12 May 2002
0 references
cutting-plane scheme
0 references
semi-infinite programming
0 references
quadratic programming
0 references
relaxation
0 references
interior-point method
0 references
explicit constraints
0 references
convergence
0 references
numerical experiments
0 references
0 references
0.96119756
0 references
0.9462332
0 references
0.94167775
0 references
0.93889284
0 references
0.93021905
0 references
0.92517245
0 references
0.9247336
0 references
0.9143825
0 references
The cutting-plane approach for solving quadratic semi-infinite programming problems is studied. Several relaxation techniques and their combinations are proposed and discussed. The proposed scheme is very general and flexible. The results obtained in this paper generalize most, if not all, known relaxation results for both linear and convex quadratic semi-infinite programming problems.NEWLINENEWLINENEWLINEMain result: A flexible convergence proof is provided to cover different settings of a relaxation scheme. The implementation issues are addressed with some numerical experiments to illustrate the computational behavior of each different combination.
0 references
