Abstract
In this paper we show how saddle point theorems for a quasiconvex—quasiconcave function can be derived from duality theory. A symmetric duality framework that provides the machinery for deriving saddle point theorems is presented. Generating the theorems,via the framework, provides a deeper understanding of assumptions employed in existing theorems which do not utilize duality theory.
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
References
J.P. Crouzeix, “A duality framework in quasi-convex programming,” in: S. Schaible and W.T. Zimba, eds.,Generalized Concavity in Optimization and Economics (Academic Press, New York, 1981) pp. 207–225.
S. Dolecki and S. Kurcysuz, “Onψ-convexity in external problems,”SIAM Journal of Control and Optimization 16 (1978) 277–300.
W. Fenchel, “Convex cones, sets and functions,” mimeographed lecture notes, Department of Mathematics, Princeton University (Princeton, NJ, 1951).
J. Flachs and M.A. Pollatschek, “Duality theorems for certain programs involving minimum or maximum operators,”Mathematical Programming 16 (1979) 340–370.
J. Flachs, “Global saddle point duality for quasiconcave programs, I and II,”Mathematical Programming 20 (1981) 327–347 andMethematical Programming 24 (1982) 326–345.
H.J. Greenberg and W.P. Pierskalla, “Surrogate mathematical programming,”Operations Research 18 (1970) 924–939.
H.J. Greenberg and W.P. Pierskalla, “Quasi-conjugate functions and surrogate duality,”Cahiers du Centre d'Etudes de Recherche Operationelle 15 (1973) 437–448.
H.J. Greenberg, “The generalized penalty function-surrogate model,”Operations Research 21 (1977) 162–178.
D.G. Luenberger, “Quasi-convex programming,”SIAM Journal (1968) 1090–1095.
J.E. Martinez Legaz, “Exact quasiconvex conjugation,”Zeitschrift für Operations Research 27 (1983) 257–266.
L. McLinden, “A minimax theorem,”Mathematics of Operations Research 9 (1984) 576–581.
J.J. Moreau, “Inf convolution, sous-additivite, convexite des fonctions numeriques,”Journal de Mathematiques Pureset Appliquées 49 (1970) 105–154.
H. Nikaido, “On Von Neumann's min—max theorems,”Pacific Journal of Mathematics 4 (1954) 65–70.
U. Passy and E.Z. Prisman, “Conjugacy in quasi-convex programming,”Mathematical Programming 30 (1984) 121–146.
U. Passy and E.Z. Prisman, “A convex-like duality framework for quasi-convex programming,”Mathematical Programming 32 (1984) 278–300.
U. Passy and E.Z. Prisman, “Saddle functions in min—max problems in the quasi-convex quasi-concave case,” College of Management Report, No. M-5-84-5, Georgia Institute of Technology (Atlanta, GA, 1984).
R.T. Rockafellar,Convex Analysis (Princeton University Press, Princeton, NJ 1970).
I. Singer, “Optimization and best approximation,” Proceedings of the Seventh International Summer School (Academie-Verlag, Berlin, 1981).
I. Singer, “Optimization by level set methods IV: Generalizations and complements,”Numerical Functional Analysis and Optimization 4 (1981–1982) 279–320.
I. Singer, “Generalized convexity, functional hulls and applications to conjugate duality in optimization,” in: G. Hammer and D. Pallaschke, eds.,Selected Topics in Operations Research and Mathematical Economics (Springer, Berlin, 1984) pp. 49–79.
M. Sion, “On general minimax theorems,”Pacific Journal of Mathematics 8 (1950) 171–176.
J. Von Neumann, “Zur Theorie der Gesellschaftsspiele,”Mathematische Annalen 100 (1928) 295–320.
J. Von Neumann, “Über ein Ökonomisches Gleischungssystem und eine Verallgemeinerung der Brouwerschen Fixpunktsatizes,” in: K. Menger, ed.,Ergebnisse eines Mathematischen Kolloquiums No. 8 (Deuticke, Vienna, 1937) pp. 73–83.
M. Volle, “Conjugaison par tranches,”Annali di Mathematica Pura Applicata 130 (1985) 279–311.
Author information
Authors and Affiliations
Rights and permissions
About this article
Cite this article
Passy, U., Prisman, E.Z. A duality approach to minimax results for quasi-saddle functions in finite dimensions. Mathematical Programming 55, 81–98 (1992). https://doi.org/10.1007/BF01581192
Received:
Revised:
Issue Date:
DOI: https://doi.org/10.1007/BF01581192