论文信息 - A generalization of the Farkas lemma and applications to convex programming - 字舞流文

A generalization of the Farkas lemma and applications to convex programming

Constantin Zălinescu | C. Zălinescu

[1] N. Levinson,et al. Linear programming in complex space , 1966 .

[2] R. Weatherwax. General Lagrange multiplier theorems , 1974 .

[3] V. Klee. Separation properties of convex cones , 1955 .

[4] Bertram Mond. A class of nondifferentiable mathematical programming problems , 1974 .

[5] Infinite programming and duality in topological vector spaces , 1974 .

[6] Ky Fan,et al. Asymptotic cones and duality of linear relations , 1969 .

[7] Richard B. Holmes,et al. A Course on Optimization and Best Approximation , 1972 .

[8] I. Singer. Best Approximation in Normed Linear Spaces by Elements of Linear Subspaces , 1970 .

[9] Jochem Zowe,et al. Subdifferentiability of Convex Functions with Values in an Ordered Vector Space. , 1974 .

[10] V. Barbu,et al. Convexity and optimization in banach spaces , 1972 .

[11] J. Dieudonné,et al. Sur la Séparation des Ensembles Convexes , 1966 .

[12] Murray Schechter. Linear programs in topological vector spaces , 1972 .