A note on an implementation of a method for quadratic semi-infinite programming (Q913660): Difference between revisions
From MaRDI portal
Changed an Item |
ReferenceBot (talk | contribs) Changed an Item |
||
(One intermediate revision by one other user not shown) | |||
Property / MaRDI profile type | |||
Property / MaRDI profile type: MaRDI publication profile / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: An implementation of a discretization method for semi-infinite programming / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q4194751 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: On the quadratic programming algorithm of Goldfarb and Idnani / rank | |||
Normal rank |
Revision as of 15:48, 20 June 2024
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | A note on an implementation of a method for quadratic semi-infinite programming |
scientific article |
Statements
A note on an implementation of a method for quadratic semi-infinite programming (English)
0 references
1990
0 references
The authors consider the following convex quadratic semi-infinite optimization problem: \[ \text{Minimize } F(x)=c^ Tx+x^ TCx, \] \[ \text{subject to }x^ Ta(t)\leq b(t)\text{ for all }t\in T. \] Here, \(c\in R^ n\) and C is a real \(n\times n\) matrix which is assumed to be positive semi-definite. T may be a compact, or finite or infinite set. A first coarse grid is successively refined in such a way that the solution on the foregoing grids can be used on the one hand as starting points for the subsequent grids and on the other hand to considerably reduce the number of constraints which have to be considered in the subsequent problems. This enables an efficient treatment of large problems with moderate storage requirements. A modification of a program supplied by \textit{M. J. D. Powell} [Math. Program. Study 25, 46-61 (1985; Zbl 0584.90069)] has been used to solve the discretized QP-subproblems.
0 references
convex quadratic semi-infinite optimization
0 references