scholarly journals Stable Zero Lagrange Duality for DC Conic Programming

2012 ◽  
Vol 2012 ◽  
pp. 1-17
Author(s):  
D. H. Fang

We consider the problems of minimizing a DC function under a cone-convex constraint and a set constraint. By using the infimal convolution of the conjugate functions, we present a new constraint qualification which completely characterizes the Farkas-type lemma and the stable zero Lagrange duality gap property for DC conical programming problems in locally convex spaces.

2013 ◽  
Vol 11 (11) ◽  
Author(s):  
Horaţiu-Vasile Boncea ◽  
Sorin-Mihai Grad

AbstractIn this paper we present different regularity conditions that equivalently characterize various ɛ-duality gap statements (with ɛ ≥ 0) for constrained optimization problems and their Lagrange and Fenchel-Lagrange duals in separated locally convex spaces, respectively. These regularity conditions are formulated by using epigraphs and ɛ-subdifferentials. When ɛ = 0 we rediscover recent results on stable strong and total duality and zero duality gap from the literature.


1992 ◽  
Vol 34 (2) ◽  
pp. 175-188
Author(s):  
Neill Robertson

By the term “locally convex space”, we mean a locally convex Hausdorff topological vector space (see [17]). We shall denote the algebraic dual of a locally convex space E by E*, and its topological dual by E′. It is convenient to think of the elements of E as being linear functionals on E′, so that E can be identified with a subspace of E′*. The adjoint of a continuous linear map T:E→F will be denoted by T′:F′→E′. If 〈E, F〈 is a dual pair of vector spaces, then we shall denote the corresponding weak, strong and Mackey topologies on E by α(E, F), β(E, F) and μ(E, F) respectively.


2002 ◽  
Vol 121 (1-2) ◽  
pp. 75-89 ◽  
Author(s):  
Fernando Garibay Bonales ◽  
F.Javier Trigos-Arrieta ◽  
Rigoberto Vera Mendoza

Sign in / Sign up

Export Citation Format

Share Document