论文信息 - Direct theorems in semi-infinite convex programming

Direct theorems in semi-infinite convex programming

We show that a semi-infinite quasi-convex program with certain regularity conditions possesses finitely constrained subprograms with the same optimal value. This result is applied to various problems.

J. M. Borwein | J. Borwein

[1] R. J. Duffin,et al. An Infinite Linear Program with a Duality Gap , 1965 .

[2] Abraham Charnes,et al. ON REPRESENTATIONS OF SEMI-INFINITE PROGRAMS WHICH HAVE NO DUALITY GAPS. , 1965 .

[3] J. Stoer,et al. Convexity and Optimization in Finite Dimensions I , 1970 .

[4] A. Wilansky. Modern Methods in Topological Vector Spaces , 1978 .

[5] Helly’s theorem and minima of convex functions , 1965 .

[6] David G. Luenberger,et al. Quasi-Convex Programming , 1968 .

[7] W W Cooper,et al. DUALITY, HAAR PROGRAMS, AND FINITE SEQUENCE SPACES. , 1962, Proceedings of the National Academy of Sciences of the United States of America.

[8] A. M. Geoffrion. Proper efficiency and the theory of vector maximization , 1968 .

[9] B. N. Pshenichnyi. Necessary Conditions for an Extremum , 1971 .

[10] V. Klee. The Critical Set of a Convex Body , 1953 .

[11] J. Ponstein,et al. Seven kinds of convexity , 1967 .

[12] V. Klee,et al. Helly's theorem and its relatives , 1963 .

[13] D. Luenberger. Optimization by Vector Space Methods , 1968 .

[14] J. Borwein. The limiting Lagrangian as a consequence of Helly's theorem , 1981 .

[15] J. Borwein. Proper Efficient Points for Maximizations with Respect to Cones , 1977 .

[16] Affine minorants minimizing the sum of convex functions , 1978 .

[17] A. Charnes,et al. Duality in Semi-Infinite Programs and some Works of Haar and Caratheodory , 1963 .