Optimality Conditions and Duality for DC Programming in Locally Convex Spaces
Consider the DC programming problem (PA) inf⁡x∈X{f(x)−g(Ax)}, where f and g are proper convex functions defined on locally convex Hausdorff topological vector spaces X and Y, respectively, and A is a linear operator from X to Y. By using the properties of the epigrap...
| Main Author: | |
|---|---|
| Format: | Article |
| Language: | English |
| Published: |
SpringerOpen
2009-01-01
|
| Series: | Journal of Inequalities and Applications |
| Online Access: | http://dx.doi.org/10.1155/2009/258756 |