Abstract
In this paper, we consider first the most important classes of cone convexlike vector-valued functions and give a dual characterization for some of these classes. It turns out that these characterizations are strongly related to the closely convexlike and Ky Fan convex bifunctions occurring within minimax problems. Applying the Lagrangian perturbation approach, we show that some of these classes of cone convexlike vector-valued functions show up naturally in verifying strong Lagrangian duality for finite-dimensional optimization problems. This is achieved by extending classical convexity results for biconjugate functions to the class of so-called almost convex functions. In particular, for a general class of finite-dimensional optimization problems, strong Lagrangian duality holds if some vector-valued function related to this optimization problem is closely K-convexlike and satisfies some additional regularity assumptions. For K a full-dimensional convex cone, it turns out that the conditions for strong Lagrangian duality simplify. Finally, we compare the results obtained by the Lagrangian perturbation approach worked out in this paper with the results achieved by the so-called image space approach initiated by Giannessi.
Similar content being viewed by others
References
Rockafellar, R.T.: Convex Analysis. Princeton University Press, Princeton (1970)
Rockafellar, R.T.: Conjugate Duality and Optimization. SIAM, Philadelphia (1974)
Yu, P.L.: Cone extreme points and nondominated solutions in decision problems with multiobjectives. J. Optim. Theory Appl. 14, 319–377 (1974)
Hayashi, M., Komiya, H.: Perfect duality for convexlike programs. J. Optim. Theory Appl. 38, 179–189 (1982)
Jeyakumar, V.: A generalization of a minimax theorem of Fan via a theorem of the alternative. J. Optim. Theory Appl. 48, 525–533 (1986)
Paeck, S.: Convexlike and concavelike conditions in alternative, minmax and minimization theorems. J. Optim. Theory Appl. 74, 317–332 (1992)
Li, Z.P., Wang, S.Y.: Lagrange multipliers and saddlepoints in multiobjective programming. J. Optim. Theory Appl. 83, 63–81 (1994)
Breckner, W.W., Kassay, G.: A systematization of convexity concepts for sets and functions. J. Convex Anal. 4, 1–19 (1997)
Frenk, J.B.G., Kassay, G.: On classes of generalized convex functions, Gordan–Farkas type theorems and Lagrangian duality. J. Optim. Theory Appl. 102, 315–343 (1999)
Mastroeni, G., Rapcsák, T.: On convex generalized systems. J. Optim. Theory Appl. 104, 605–627 (2000)
Frenk, J.B.G., Kassay, G.: Introduction to convex and quasiconvex analysis. In: Hadjisavvas, N., Komlósi, S., Schaible, S. (eds.) Handbook of Generalized Convexity and Generalized Monotonicity. Nonconvex Optimization and Its Applications, vol. 76, pp. 3–87. Springer, Dordrecht (2005)
Giannessi, F.: Theorems of the alternative and optimality conditions. J. Optim. Theory Appl. 42, 331–365 (1984)
Frenk, J.B.G., Kassay, G., Kolumbán, J.: On equivalent results in minimax theory. Eur. J. Oper. Res. 157, 46–58 (2004)
Frenk, J.B.G., Kassay, G.: Lagrangian duality and cone convexlike functions. Report ERS-2005-019, Econometric Institute, Erasmus University Rotterdam. Website https://ep.eur.nl/handle/1765/1931
Cambini, R., Komlósi, S.: On the scalarization of pseudoconcavity and pseudomonotonicity concepts for vector-valued functions. In: Crouzeix, J.P., Martinez-Legaz, J.E., Volle, M. (eds.) Generalized Convexity, Generalized Monotonicity. Nonconvex Optimization and Its Applications, vol. 27, pp. 277–283. Kluwer Academic, Dordrecht (1998)
Sturm, J.F.: Theory and algorithms of semidefinite programming. In: Frenk, J.B.G., Roos, K., Terlaky, T., Zhang, S. (eds.) High Performance Optimization. Applied Optimization, vol. 33, pp. 3–194. Kluwer Academic, Dordrecht (2000)
Kreyszig, E.: Introductory Functional Analysis with Applications. Wiley, New York (1978)
Fan, K.: Minimax theorems. Proc. Natl. Acad. Sci. U.S.A. 39, 42–47 (1953)
Frenk, J.B.G., Kassay, G.: Minimax results and finite dimensional separation. J. Optim. Theory Appl. 113, 409–421 (2002)
Mastroeni, G., Pappalardo, M., Yen, N.D.: Image of a parametric optimization problem and continuity of the perturbation function. J. Optim. Theory Appl. 81, 193–202 (1994)
Author information
Authors and Affiliations
Corresponding author
Additional information
Communicated by T. Rapcsák
Rights and permissions
About this article
Cite this article
Frenk, J.B.G., Kassay, G. Lagrangian Duality and Cone Convexlike Functions. J Optim Theory Appl 134, 207–222 (2007). https://doi.org/10.1007/s10957-007-9221-1
Published:
Issue Date:
DOI: https://doi.org/10.1007/s10957-007-9221-1