Abstract
This paper provides some theorems of the alternative for non-linear functions (sublinearconvex) between topological vector spaces. These results are then applied to establish optimality conditions for convex programming and general non-differentiable programming problems.
Zusammenfassung
Diese Arbeit gibt einige Alternativsätze für nichtlineare (sublinear-konvexe) Funktionen zwischen topologischen Vektorräumen. Diese Resultate werden benutzt, um Optimalitätsbedingungen für konvexe und allgemeine nichtdifferenzierbare Optimierungsprobleme aufzustellen.
Similar content being viewed by others
References
Bazaraa, M.S., andC.M. Shetty: Foundations of Optimization, Springer-Verlag, 1976.
Bender, P.J.: An application of Guignard's generalized Kuhn-Tucker conditions. J.O.T.A.25 No. 4, 1978.
Borwein, J.M., andWolkowicz: Characterization of optimality without constraint qualification for the abstract convex programming. Math. Programming Study19, 1982, 77–100.
Craven, B.D.: Non-linear programming in locally convex spaces. J.O.T.A.10. No. 4, 1972, 197–210.
—: Mathematical programming and control theory. Chapman and Hall, London 1978.
-: On quasidifferentiable optimization. Research Report, No.23, University of Melbourne, Department of Mathematics, 1982.
Craven, B.D., andB. Mond: Lagrange conditions for quasidifferentiable optimization.IX Intern. Symp. on Math. Prog. (Budapest, (1976). In: Surveys of Mathematical programming,1, A. Prekops (ed.), North-Holland, Amsterdam, 1976, 177–191.
Glover, B.M.: Generalized Farkas Lemma and applications to quasi-differentiable programming. Zeitschrift für Operations Research26, 1982a, 125–141.
-: Non-differentiable programming. M.Sc. Thesis, University of Melbourne, 1982b.
Holmes, R.B.: Geometric Functional Analysis and its applications. Springer-Verlag, 1975.
Kanniappan, P.B., andS.M.A. Sastry: Duality Theorems and an optimality condition for non-differentiable convex programming. J. Aust. Math. Soc. (Series A)32, 1982, 369–379.
Kelley, J.L.: General Topology. Van Nostrand, Princeton, N.J. 1955.
Kurcyusz, S.: On the existence and non-existence of Lagrange multipliers in Banach spaces. J.O.T.A.20, No. 1, 1976, 81–110.
Levine, P. andPomerol: Infinite programming and Duality in topological vector spaces. J. Math. App.46, 1974, 169–174.
Luenberger, G.: Optimization by vector space methods, J. Wiley, New York 1969.
Mangasarian, O.L.: Non-linear programming, McGraw-Hill Book Company, 1969.
Nieumenhuis, J. W.: Another application of Guignard's generalized Kuhn-Tucker conditions, J.O.T.A.30, No. 2, 1980.
Penot, J.P.: On the existence of Lagrange multipliers in non-linear programming in Banach spaces. Lecture notes in Control and Information Sciences,30, optimization and optimal control, conference, Oberwolfach, 1980, 89–104.
Robinson, S.M.: Normed convex process. Trans. Amer. Math. Soc.174, 1972, 127–140.
Rockafellar, R.T.: Convex Analysis. Princeton University Press, Princeton, N.J., 1972.
Trudzik, L.T.: Asymptotic Kuhn-Tucker conditions in abstract spaces. Numer. Fun. Anal. and optim.4, 1982, 355–369.
Zalinescu, C.: A generalization of the Farkas Lemma and applications to convex programming. J. Math. Anal. App.66, No. 3, 1978, 651–678.
—: On an abstract control problem. Numer. Fun. Anal and optim.2 (6), 1980, 531–542.
Zlobec, S.: Extensions of asymptotic Kuhn-Tucker conditions in mathematical programming. S.I.A.M. J. Appl. Math.,21, No. 3, 1971, 448–460.
Zowe, J., andS. Kurcyusz: Regularity and Stability for the mathematical programming problem in Banach spaces. Appl. Math. Optim,5, 1979, 49–62.
Author information
Authors and Affiliations
Rights and permissions
About this article
Cite this article
Jeyakumar, V. Nonlinear alternative theorems and nondifferentiable programming. Zeitschrift für Operations Research 28, 175–187 (1984). https://doi.org/10.1007/BF01920919
Received:
Issue Date:
DOI: https://doi.org/10.1007/BF01920919