A duality theorem for semi-infinite convex programs and their finite subprograms

1983 ◽  
Vol 27 (1) ◽  
pp. 75-82 ◽  
Author(s):  
Dennis F. Karney
Keyword(s):  
Duality Theorem ◽  
Convex Programs

Further Development in the Global Resolution of Convex Programs with Complementarity Constraints

2014 ◽  
Author(s):  
John E. Mitchell ◽  
Jong-Shi Pang ◽  
Yu-Ching Lee ◽  
Bin Yu ◽  
Lijie Bai
Keyword(s):  
Complementarity Constraints ◽  
Convex Programs ◽  
Further Development

On the Monge-Kantorovitch Duality Theorem

2001 ◽  
Vol 45 (2) ◽  
pp. 350-356 ◽  
Author(s):  
D. Ramachandran ◽  
L. Rüschendorf
Keyword(s):  
Duality Theorem

scholarly journals The Eilenberg-Borsuk duality theorem

1972 ◽  
Vol 75 (1) ◽  
pp. 68-72 ◽  
Author(s):  
J.M Aarts ◽  
T Nishiura
Keyword(s):  
Duality Theorem

scholarly journals A Fenchel-Rockafellar type duality theorem for maximization

1979 ◽  
Vol 20 (2) ◽  
pp. 193-198 ◽  
Author(s):  
Ivan Singer
Keyword(s):  
Convex Space ◽  
Duality Theorem ◽  
Locally Convex Space ◽  
Bounded Subset ◽  
Convex Functional ◽  
Lower Semi ◽  
Locally Convex

We prove that sup(f-h)(E) = sup(h*-f*)(E*), where f is a proper lower semi-continuous convex functional on a real locally convex space E, h: E → = [-∞, +∞] is an arbitrary-functional and, f*, h* are their convex conjugates respectively. When h = δG, the indicator of a bounded subset G of E, this yields a formula for sup f(G).

Takesaki–Takai Duality Theorem in Hilbert C*-Modules

2004 ◽  
Vol 20 (6) ◽  
pp. 1079-1088
Author(s):  
Mao Zheng Guo ◽  
Xiao Xia Zhang
Keyword(s):  
Duality Theorem
Sign in / Sign up

Export Citation Format

Share Document