Hostname: page-component-848d4c4894-m9kch Total loading time: 0 Render date: 2024-05-17T05:07:49.077Z Has data issue: false hasContentIssue false
  • English
  • Français

Sufficient Fritz John optimality conditions for nondifferentiable convex programming

Published online by Cambridge University Press:  17 February 2009

B. D. Craven  and
B. Mond
B. D. Craven
Affiliation:
Department of Mathematics, University of Melbourne, Parkville 3052, Australia.
B. Mond
Affiliation:
Department of Mathematics, La Trobe University, Bundoora 3083, Australia.
Rights & Permissions [Opens in a new window]

Abstract

Core share and HTML view are not available for this content. However, as you have access to this content, a full PDF is available via the ‘Save PDF’ action button.

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.

Type
Research Article
Information
The ANZIAM Journal , Volume 19 , Issue 4 , December 1976 , pp. 462 - 468
Copyright
Copyright © Australian Mathematical Society 1976

References

[1]Bector, C. R., Chandra, Suresh, and Gulati, T. R., Complex nonlinear programming with equality constraints, Proc. Fourth Manitoba Conference on Numerical Mathematics (1974), 205–216.Google Scholar
[2]Bector, C. R. and Gulati, T. R., Sufficient optimality conditions in presence of quasiconvex equality and inequality constraints, Zeitschrift für Mathematische Operationsforschung und Statistik, to appear.Google Scholar
[3]Borwein, J. M.. Optimization with respect to partial orderings. D. Phil. thesis, Oxford, 1974.Google Scholar
[4]Craven, B. D., Nonlinear programming in locally convex spaces, J. Optim. Theor. Appl. 10 (1972), 197–210.CrossRefGoogle Scholar
[5]Craven, B. D., Sufficient Fritz John optimality conditions, Bull. Austral. Math. Soc. 13 (1975), 411–419.CrossRefGoogle Scholar
[6]Craven, B. D., Lagrangean conditions for optimization in Banach spaces, University of Melbourne, School of Mathematical Sciences, Research Report No. 6 (1976)Google Scholar
[7]Craven, B. D. and Mond, B., Transposition theorems for cone-convex functions, SIAM. J. Appl. Math. 24 (1973), 603–612.CrossRefGoogle Scholar
[8]Craven, B. D. and Mond, B., A class of nondifferentiable complex programming problems, Mathematische Operationsforschung und Statistik 6 (1975) 581–591.Google Scholar
[9]Craven, B. D. and Mond, B., Lagrangean conditions for quasidifferentiable optimization, University of Melbourne, School of Mathematical Sciences, Research Report No. 7 (1976).Google Scholar
[10]Gulati, T. R., A Fritz John type sufficient optimality theorem in complex space, Bull. Austral. Math. Soc. 11 (1974), 219–224.CrossRefGoogle Scholar
[11]Gulati, T. R., Optimality criteria and duality in complex mathematical programming, Ph.D. thesis, Indian Institute of Technology, Hauz-Khas, New Delhi (1975).Google Scholar
[12]Rockafellar, R. T., Convex analysis, Princeton University Press, Princeton, New Jersey, 1970.CrossRefGoogle Scholar
[13]Rockafellar, R. T., Conjugate duality and optimization, Soc. Ind. Appl. Math., Philadelphia, 1974. (Vol. 16 of Regional Conference Series in Applied Mathematics.)CrossRefGoogle Scholar