Abstract | ||
---|---|---|
We formulate convex semi-infinite programming problems in a functional analytic setting and derive optimality conditions and several duality results, based on which we develop a computational framework for solving convex semi-infinite programs. |
Year | DOI | Venue |
---|---|---|
2000 | 10.1023/A:1019208524259 | Annals OR |
Keywords | Field | DocType |
semi-infinite programming,convex programming,optimality condition,duality,converse duality,quadratic semi-infinite programming,linear semi-infinite programming | Discrete mathematics,Mathematical optimization,Convex combination,Nonlinear programming,Subderivative,Duality (optimization),Proper convex function,Convex optimization,Convex analysis,Linear matrix inequality,Mathematics | Journal |
Volume | Issue | ISSN |
98 | 1-4 | 1572-9338 |
Citations | PageRank | References |
16 | 2.05 | 13 |
Authors | ||
3 |
Name | Order | Citations | PageRank |
---|---|---|---|
Satoshi Ito | 1 | 25 | 5.59 |
Y. Liu | 2 | 33 | 4.70 |
K. L. Teo | 3 | 1643 | 211.47 |