Abstract
Several authors have been intersted in optimality conditions in ε-programming and in ε-minimas problem (see, for example, the references [11,16]).
In this paper, we present some results for approximating ε-programming and ε-minimax problems with penalty techniques. From a computational point of view, such results may be used in order to improve algorithms within a given level of accuracy.
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
References
A. Auslender, “Problèmes de minimax via l'analyse convexe et les inégalités variationnelles: Théorie et algorithmes”.Lecture Notes in Economics and Mathematical Systems 77 (1972).
E. Cavazutti and J. Morgan, “Problèmes d'optimisation unformément bien posés et méthodes de pénalisation”,Bollettino U.M.I. 1 (1982) 423–450.
E. Cavazutti and J. Morgan, “Problèmes de point de selle bien posés”, Contributed paper, Colloque d'Optimisation, Université de Clermont II (Confolant, March 1981).
I. Ekeland, “On the variational principle”,Journal of Mathematical Analysis and Applications 47 (1974) 324–353.
I. Ekeland and R. Teman,Analyse convexe et problèmes variationnels (Dunod, Paris, 1974).
J.P. Evans, F.J. Gould and J.W. Tolle, “Exact penalty functions in nonlinear programming”,Mathematical Programming 4 (1973) 72–97.
A. V. Fiacco and G.P. Mc. Cormick,Nonlinear programming: sequential unconstrained minimization techniques (Wiley, New York, 1968).
S.P. Han and O.L. Mangasarian, “Exact penalty functions in nonlinear programming”,Mathematical Programming 17 (1979) 251–269.
J.B. Hiriart-Urruty, “Lipschitzr-continuity of the approximate subdifferential of a convex function”,Mathematica Scandinavica 47 (1980) 123–134.
B. Lemaire, “Problèmes min-max et applications applications au contrôle optimal de systèmes gouvernés par des équations aux dérivées partielles linéaires.”, Thèse d'Etat, Université de Paris VI (Paris. 1970).
P. Loridan, “Conditions de Kuhn et Tucher à ε près pour des solutions approchées de problèmes d'optimisation avec contraintes”,Compte-Rendus Académie des Sciences de Paris 285 (1977) 449–450.
P. Loridan, “Necessary conditions for ε-optimality”.Mathematical Programming Study 19 (1982) 140–152.
L. McLinden, “An application of Ekeland's Theorem to minimax problems” Technical Report, University of Illinois (Urbana, IL, 1981).
L. McLinden, “A minimax theorem”, Technical report, University of Illinois (Urbana, IL, 1981).
P. Michel, “Almost optimality”, Unpublished manuscript. Université de Paris I (Paris, 1981).
J. J. Strodiot, V. H. Nguyen and N. Heukenes. “ε-optimal solutions in nondifférentiable convex programming and some related questions” Report 80-12. Facultés Universitaires de Namur (Namur, December 1980).
W. I. Zangwill, “Nonlinear, programming via penalty functions”,Management Science 13 (1967) 344–358.
T. Zolezzi, “On equiwellset minimum problems”,Applied Mathematics and Optimization 4 (1978) 209–223.
J. Zowe and A. Ben-Tal, “Discretel 1-approximation and related nonlinear nondifferentiable problems”, Contributed paper. Colloque d'Optimisation, Université de Clermont II (Confolant, March 1981).
Author information
Authors and Affiliations
Rights and permissions
About this article
Cite this article
Loridan, P., Morgan, J. Penalty functions in ε-programming and ε-minimax problems. Mathematical Programming 26, 213–231 (1983). https://doi.org/10.1007/BF02592056
Received:
Accepted:
Issue Date:
DOI: https://doi.org/10.1007/BF02592056