Abstract
We consider the problem of minimizing a function which is a smooth composition of max-type functions. We treat this function as quasidifferentiable. A very important property of the algorithm suggested is that at each step it is necessary to consider more than one descent direction (this is due to the quasidifferentiability of the function).
This is a preview of subscription content, log in via an institution to check access.
Preview
Unable to display preview. Download preview PDF.
References
A. Ben-Tal and J. Zowe, “Necessary and sufficient optimality conditions for a class of nonsmooth minimization problems,” Mathematical Programming 24 (1982) 70–91.
V. F. Demyanov, “Quasidifferentiable functions: Necessary conditions and descent directions,” Working Paper WP-83-64, International Institute for Applied Systems Analysis (Laxenburg, Austria, 1983).
V.F. Demyanov and L.N. Polyakova, “Minimization of a quasidifferentiable function on a quasidifferentiable set,” SUSR Computational Mathematics and Mathematical Physics 20 (4) (1980) 34–43.
V.F. Demyanov and A.M. Rubinov, “On quasidifferentiable functionals,” Soviet Mathematics Doklady 21 (1) (1980) 14–17.
R. Fletcher and G.A. Watson, “First and second order conditions for a class of nondifferentiable optimization problems,” Mathematical Programming 18 (1980) 291–307.
D. Pallaschke, “On numerical experiments with a quasidifferentiable optimization algorithm”, in Abstracts of the IIASA workshop on nondifferentiable optimization: Motivations and application (heldin Sopron, Hungary, 17–22 September 1984), International Institute for Applied System Analysis (Laxenburg, Austria, 1984) pp. 138–140.
G. Papavassilopoulos, “Algorithms for a class of nondifferentiable problems,” Journal of Optimization Theory and Applications, 34 (1) (1981) 41–82.
A. Shapiro, “On optimality conditions in quasidifferentiable optimization,” SIAM Journal on Control and Optimization 22 (4) (1984) 610–617.
T. I. Sivelina, “Minimizing a certain class of quasidifferentiable functions,” Vestnik of Leningrad University 7 (1983) 103–105.
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1986 The Mathematical Programming Society, Inc.
About this chapter
Cite this chapter
Demyanov, V.F., Gamidov, S., Sivelina, T.I. (1986). An algorithm for minimizing a certain class of quasidifferentiable functions. In: Demyanov, V.F., Dixon, L.C.W. (eds) Quasidifferential Calculus. Mathematical Programming Studies, vol 29. Springer, Berlin, Heidelberg. https://doi.org/10.1007/BFb0121138
Download citation
DOI: https://doi.org/10.1007/BFb0121138
Received:
Revised:
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-00928-0
Online ISBN: 978-3-642-00929-7
eBook Packages: Springer Book Archive