Abstract
Several necessary minimum conditions for quasidifferentiable programming problems are discussed. Some statements of Shapiro (1986) are shown to be incorrect.
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
References
V.F. Dem'yanov, “Quasidifferentiable functions: Necessary conditions and descent directions,”Mathematical Programming Study 29 (1986) 20–43.
V.F. Dem'yanov and L.V. Vasil'ev,Nondifferentiable Optimization (Optimization Software, Publications Division, New York, 1986). [Translated from the Russian.]
K. Eppler and B. Luderer, “The Lagrange principle and quasidifferential calculus,”Wissenschaftliche Zeitschrift der Technischen Universität Karl-Marx-Stadt 29 (1987) 187–192.
B. Luderer, “Primale Dekomposition quasidifferenzierbarer Optimierungsaufgaben,” Dissertation B, Technische Universität Karl-Marx-Stadt, (Karl-Marx-Stadt, 1987).
A. Shapiro, “Quasidifferential calculus and first-order optimality conditions in nonsmooth optimization,”Mathematical Programming Study 29 (1986) 56–68.
Author information
Authors and Affiliations
Rights and permissions
About this article
Cite this article
Luderer, B., Rösiger, R. On Shapiro's results in quasidifferential calculus. Mathematical Programming 46, 403–407 (1990). https://doi.org/10.1007/BF01585754
Received:
Revised:
Issue Date:
DOI: https://doi.org/10.1007/BF01585754