Fenchel duality in infinite-dimensional setting and its applications

Nonlinear Analysis, Theory, Methods and Applications

Volumn 55, Issue 7-8, 2003, Pages 845-858

  Ng, Kung Fu ^a   Song, Wen ^b  

^a CHINESE UNIVERSITY OF HONG KONG   (Hong Kong)

^b HARBIN NORMAL UNIVERSITY   (China)

Author keywords

Convex optimization; Fenchel duality; Polyhedron; The strong conical hull intersection property

Indexed keywords

FUNCTIONS; SET THEORY; THEOREM PROVING; TOPOLOGY; VECTORS;

FENCHEL DUALITY;

NONLINEAR SYSTEMS;

EID: 0242365790     PISSN: 0362546X     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.na.2003.07.008     Document Type: Article

References (19)

1. Attouch H., Brézis H. Duality for the sum of convex functions in general Banach spaces. Barroso J. Aspect of Mathematics and its Applications. 1986;125-133 North-Holland, Amsterdam.
2. Aubin J.P., Ekeland I. Applied Nonlinear Analysis. 1984;Wiley, New York.
3. Bauschke H.H. Proof of a conjecture by Deutsch, LI, and Swettis on duality of optimization problems. J. Optim. Theory Appl. 102:1999;697-703.
4. Borwein J.M., Lewis A.S. Partially finite convex programming, part I. quasi relative interiors and duality Math. Programming. 57:1992;15-48.
5. Deutsch F., Li W., Swettis J. Fenchel duality and the strong conical hull intersection property. J. Optim. Theory Appl. 102:1999;681-695.
6. Deutsch F., Li W., Ward J.D. A dual approach to constrained interpolation from a convex subset of Hilber space. SIAM J. Optim. 90:1997;385-414.
7. Deutsch F., Li W., Ward J.D. Best approximation from the intersection of a closed convex set and a polyhedron in Hilbert space, weak Slater conditions, and the strong conical hull intersection property. SIAM J. Optim. 10:1999;252-268.
8. Gowda M.S., Teboulle M. A comparison of constraint qualification in infinite-dimensional convex programming. SIAM J. Control Optim. 28:1990;925-935.
9. Holmes R.B. Geometric Functional Analysis and Its Applications. 1975;Springer, New York.
10. Jeyakumar V. Duality and infinite dimensional optimization. Nonlinear Anal. TMA. 15:1990;1111-1122.
11. Jeyakumar V., Wolkowicz H. Generalization of Slater's constraint qualification for infinite convex programs. Math. Programming. 57B:1992;85-101.
12. Köthe G. Topological Vector Spaces. I. 1969;Springer, New York.
13. Rockafellar R.T. Level sets and continuity of conjugate convex functions. Trans. Amer. Math. Soc. 123:1966;46-63.
14. Rockafellar R.T. Convex Analysis. 1970;Princeton University Press, Princeton, NJ.
15. R.T. Rockafellar, Conjugate Duality and Optimization, CBMS-NSF Regional Conference in Applied Mathematics, Vol. 16, SIAM, Philadephia, PA, 1974.
16. Rodrigues B., Simons S. Conjugate functions and subdiffrerentials in nonnormed situations for operators with complete graphs. Nonlinear Anal. TMA. 12:1988;1069-1078.
17. Singer I. Duality for optimization and best approximation over finite intersections. Numer. Func. Anal. Optim. 19(7&8):1998;903-915.
18. Zǎlinescu C. A comparison of constraint qualifications in infinite-dimensional convex programming revisited. J. Austral. Math. Soc. Ser. B40:1999;353-378.
19. E. Zeidler, Nonlinear Functional Analysis and Its Applications, Vol. III, Springer, New York, 1985.