Complete characterization of optimality for convex programming in banach spacesFootnote^†

^† Research partly supported by the National Research Council of Canada.

References

• Abrams , R. A. and Kerzner , L. 1978 . A simplified test for optimality . J. Optimiz. Th. Appi , 25 : 161 – 170 .
   Web of Science ®Google Scholar
• Ben-Israel , A. 1969 . Linear equations and inequalities on finite dimensional, real or complex, vector spaces: a unified theory . J. Math. Anal. Appl , 27 : 367 – 389 .
   Web of Science ®Google Scholar
• Ben-Israel , A. and Ben-Tal , A. 1976 . On a characterization of optimality in convex programming . Math. Prog , 11 : 81 – 88 .
   Google Scholar
• Ben-Israel , A. and Ben-Tal , A. 1976 . Characterizations of optimality in convex programming: the nondifferentiable case . Applicable Analysis , 11
   Google Scholar
• Ben-Israel , A. , Ben-Tal , A. and Charnes , A. 1977 . Necessary and sufficient conditions for a Pareto-optimum in convex programming . Econometrica , 45 : 811 – 820 .
   Google Scholar
• Ben-Israel A. Ben-Tal A. Zlobec S. Optimality conditions in convex programming Budapest
   Google Scholar
• Ben-Tal , A. and Ben-Israel , A. 1976 . Primal geometric programs treated by linear programming . SIAM J. Appl. Math. , 30 : 538 – 556 .
   Google Scholar
• Ben-Tal , A. , Ben-Israel , A. and Zlobec , S. 1976 . Characterization of optimality in convex programming without a constraint qualification . J. Optimiz. Th. Appi , 20 : 417 – 437 .
   Google Scholar
• Ben-Tal , A. and Zlobec , S. 1977 . Convex programming and lexicographic multicriteria problems . Mathematische Operationsforschung und Statistik, ser. Optimization , 8 : 61 – 73 .
   Google Scholar
• Ben-Tal A. Zlobec S. A new class of feasible direction methods, Center for Cybernetic Studies The University of Texas
   Google Scholar
• Borwein , J.M. 1976 . A note on Fritz John sufficiency . Bull. Austral. Math. Soc , 15 : 293 – 296 .
   Google Scholar
• Cesari , L. and Suryanarayana , M.B. 1976 . Existence theorems for Pareto optimization in Banach spaces . Bull. Am. Math. Soc , 82 : 306 – 308 .
   Google Scholar
• Craven , B.D. 1972 . Nonlinear programming in locally convex spaces . J. Optimiz. Th. Appi , 10 : 197 – 210 .
   Google Scholar
• Craven , B.D. 1975 . Sufficient Fritz John optimality conditions . Bull. Austral. Math. Soc , 13 : 411 – 419 .
   Google Scholar
• Craven , B.D. 1977 . Lagrangean conditions and quasiduality . Bull. Austral. Math. Soc , 16 : 325 – 339 .
   Google Scholar
• Craven B.D. Non-differentiable Pontryagin principle Department of Mathematics, University of Melbourne 1976
   Google Scholar
• Craven , B.D. and Mond , B. 1973 . ansposition theorems for cone-convex functions . SIAM J. Appi Math , 24 : 603 – 612 .
   Web of Science ®Google Scholar
• Craven , B.D. and Mond , B. 1976 . Sufficient Fritz John optimality conditions for non- djfferentiable convex programming . J. Austral Math. Soc , 19 : 462 – 468 .
   Google Scholar
• Craven B.D. Mond B. Lagrangean conditions for quasidifferentiable optimization Hungarian Academy of Sciences
   Google Scholar
• Craven , B.D. 1978 . Mathematical Programming and Control Theory , London : Chapman and Hall .
   Google Scholar
• Eremin , I.I. and Astafiev , N.N. 1976 . Introduction to the Theory of Linear and Convex Programming , Moscow : Nauka .
   Google Scholar
• Fedorov , V.V. 1975 . Optimization problems with an ordered set of constraints . Z. Vic. Mat. i Mat. Fiz , 15 : 1126 – 1137 .
   Google Scholar
• Fleming , W.H. and Rishel , R.W. 1975 . Deterministic and Stochastic Optimal Control , New York : Springer-Verlag .
   Google Scholar
• Guignard , M. 1969 . Generalized Kuhn-Tucker conditions for mathematical programming problems in a Banach space . SIAM J. Control , 7 : 232 – 241 .
   Web of Science ®Google Scholar
• John F. Extremum problems with inequalities as side conditions Wiley-Interscience 1948
   Google Scholar
• Kuhn H.W. Tucker A.W. Nonlinear programming J. Neyman 1951
   Google Scholar
• Luenberger , D.G. 1969 . Optimization by Vector Space Methods , New York : Wiley .
   Google Scholar
• Mangasarian , O. L. 1966 . Sufficient conditions for the optimal control of nonlinear systems . SIAM J. Control , 4 : 139 – 152 .
   Google Scholar
• Mangasarian , O. L. 1969 . Nonlinear Programming , New York : McGraw-Hill .
   Google Scholar
• Massam , H. M. 1977 . Convex Programming with Cones , Montreal : McGill University, Department of Mathematics .
   Google Scholar
• Massam H. M. Optimality conditions for a cone-convex programming problem 1977
   Google Scholar
• Massam , H. M. and Zlobec , S. 1974 . Various definitions of the derivative in mathematical programming . Math. Prog , 7 : 144 – 161 .
   Google Scholar
• Mazurov , V.D. 1972 . The solution of an ill-posed linear optimization problem under contradictory conditions . Ekonom. i. Mat. Metody , 7 : 17 – 23 .
   Google Scholar
• Podinovskii , V. V. and Gavrilov , V. M. 1975 . Optimization with Respect to Successive Criteria , Moscow : Soviet Radio .
   Google Scholar
• Rockafellar R. T. Some convex programs whose duals are linearly constrained Academic Press 1970
   Google Scholar
• Rockafellar R. T. Conjugate Duality and Optimization Philadelphia 1974
   Google Scholar
• Tihonov , A. N. 1974 . On incorrectly posed problems of optimal planning . Z. Vic. Mat. i Mat Fiz ,
   Google Scholar
• Varaiya , P. P. 1967 . Nonlinear programming in Banach spaces . SI AM J. Appl. Math , 15 : 284 – 293 .
   Web of Science ®Google Scholar
• Varaiya , P. P. 1972 . Notes on Optimization , New York : Van Nostrand .
   Google Scholar
• Wolfe , P. 1961 . A duality theorem for nonlinear programming . Quarterly of Applied Mathematics , 19 : 239 – 244 .
   Google Scholar
• Zlobec , S. 1971 . Extensions of asymptotic Kuhn-Tucker conditions in mathematics programming . SI AM J. Appl. Math , 21 : 448 – 460 .
   Web of Science ®Google Scholar
• Zlobec , S. 1978 . Feasible direction methods in the absence of Slater's condition . Mathematische Operationsforschung und Statistik, ser. Optimization , 9 : 189 – 200 .
   Google Scholar
• Zowe , J. 1977 . The saddle point theorem of Kuhn and Tucker in ordered vector spaces . J. Math. Anal Appl , 57 : 41 – 55 .
   Web of Science ®Google Scholar