Abstract
In this paper, a new set of necessary conditions for optimality is introduced with reference to the differentiable nonlinear programming problem. It is shown that these necessary conditions are sharper than the usual Fritz John ones. A constraint qualification relevant to the new necessary conditions is defined and extensions to the locally Lipschitz case are presented.
Similar content being viewed by others
References
Bazaraa, M. S., andShetty, C. M.,Foundations of Optimization, Lecture Notes in Economics and Mathematical Systems, Springer-Verlag, Berlin, Germany, 1976.
Mangasarian, O. L.,Nonlinear Programming, McGraw-Hill, New York, New York, 1969.
Hiriart-Urruty, J. B.,Refinements of Necessary Optimality Conditions in Non-differentiable Programming, I, Applied Mathematics and Optimization, Vol. 5, pp. 63–82, 1979.
Clarke, F. H.,Optimization and Nonsmooth Analysis, Wiley-Interscience, New York, New York, 1983.
Hiriart-Urruty, J. B.,Refinements of Necessary Optimality Conditions in Non-differentiable Programming, II, Mathematical Programming Study, Vol. 19, pp. 120–139, 1982.
Di Pillo, G., andFacchinei, F.,Exact Penalty Functions for Nondifferentiable Programming Problems, Nonsmooth Optimization and Related Topics, Edited by F. H. Clarke, V. F. Demyanov, and F. Giannessi, Plenum Press, New York, New York, pp. 89–107, 1989.
Ekeland, I.,On the Variational Principle, Journal of Mathematical Analysis and Applications, Vol. 47, pp. 324–353, 1974.
Rockafellar, R. T.,Convex Analysis, Princeton University Press, Princeton, New Jersey, 1970.
Di Pillo, G., andFacchinei, F.,Regularity Conditions and Exact Penalty Functions in Lipschitz Programming Problems, Proceedings of the International Conference on Nonsmooth Optimization: Methods and Applications, Erice, Italy, 1991 (to appear).
Author information
Authors and Affiliations
Additional information
Communicated by G. Di Pillo
Rights and permissions
About this article
Cite this article
Facchinei, F. Refinements of necessary conditions for optimality in nonlinear programming. J Optim Theory Appl 73, 65–74 (1992). https://doi.org/10.1007/BF00940078
Issue Date:
DOI: https://doi.org/10.1007/BF00940078