Sufficient Fritz John optimality conditions for nondifferentiable convex programming
- 1 December 1976
- journal article
- research article
- Published by Cambridge University Press (CUP) in The Journal of the Australian Mathematical Society. Series B. Applied Mathematics
- Vol. 19 (4) , 462-468
- https://doi.org/10.1017/s0334270000001326
Abstract
The Fritz John necessary conditions for optimality of a differentiable nonlinear programming problem have been shown, given additional convexity hypotheses, to be also sufficient (by Gulati, Craven, and others). This sufficiency theorem is now extended to minimization (suitably defined) of a function taking values in a partially ordered space, and to (convex) objective and constraint functions which are not always differentiable. The results are expressed in terms of subgradients.Keywords
This publication has 7 references indexed in Scilit:
- Sufficient Fritz John optimality conditionsBulletin of the Australian Mathematical Society, 1975
- A class of nondifferentiable complex programming problemsMathematische Operationsforschung und Statistik, 1975
- A Fritz John type sufficient optimality theorem in complex spaceBulletin of the Australian Mathematical Society, 1974
- Conjugate Duality and OptimizationPublished by Society for Industrial & Applied Mathematics (SIAM) ,1974
- Transposition Theorems for Cone-Convex FunctionsSIAM Journal on Applied Mathematics, 1973
- Nonlinear programming in locally convex spacesJournal of Optimization Theory and Applications, 1972
- Convex AnalysisPublished by Walter de Gruyter GmbH ,1970