×

Differentiable stability in non convex and non differentiable programming. (English) Zbl 0403.90068


MSC:

90C30 Nonlinear programming
90C31 Sensitivity, stability, parametric optimization
90C52 Methods of reduced gradient type
PDFBibTeX XMLCite
Full Text: DOI

References:

[1] C. Berge, Espaces topologiques–fonctions multivoques (Dunod Paris, 1966).
[2] F. Clarke, ”Generalized gradients and applications”, Transactions of the American Mathematical Society 205 (1975) 247–262.
[3] F. Clarke, ”A new approach to Lagrange multipliers”, Mathematics of Operations Research 1 (1976) 165–174.
[4] F. Clarke, ”Generalized gradients of Lipschitz functionals”, M.R.C. Tech. Summary Rept.
[5] F. Clarke, ”On the inverse function theorem”, Pacific Journal of Mathematics 69(1) (1976).
[6] G. Dantzig, Folkman and J.F. Shapiro, ”On the continuity of the minimum set of a continuous function”, Journal of Mathematical Analysis and Applications 17 (1967) 519–548.
[7] J. Gauvin and J.W. Tolle, ”Differentiable stability”, Siam Journal of Control and Optimization 15 (1977) 294–311.
[8] M.R. Hestenes, Optimization theory–The finite dimensional case (Wiley, New York, 1975).
[9] J.B. Hiriart-Urruty, ”On optimality conditions in nondifferentiable programming”, Mathematical Programming 14 (1978) 73–86.
[10] W.W. Hogan, ”Point-to-set maps in mathematical programming”, Siam Review 15 (1973) 591–603.
[11] O.L. Mangasarian and Fromovitz, ”The Fritz-John necessary optimality conditions in the presence of equality and inequality constraints”, Journal of Mathematical Analysis and Applications 17 (1967) 37–47.
[12] R.T. Rockafellar, Convex analysis (Princeton University Press, Princeton, NJ, 1970).
This reference list is based on information provided by the publisher or from digital mathematics libraries. Its items are heuristically matched to zbMATH identifiers and may contain data conversion errors. In some cases that data have been complemented/enhanced by data from zbMATH Open. This attempts to reflect the references listed in the original paper as accurately as possible without claiming completeness or a perfect matching.