Abstract
In the last decades the efforts of an increasing number of researchers have led to the development of a wide range of numerical methods for finding the minima of nonsmooth functions of several variables. Even though the proposed methods share convex analysis as their common theoretical background, they stem from diverse approaches, frequently grounded on heuristic intuitions.
This is a preview of subscription content, log in via an institution.
Buying options
Tax calculation will be finalised at checkout
Purchases are for personal use only
Learn about institutional subscriptionsPreview
Unable to display preview. Download preview PDF.
References
W.C. Davidon. “Conic approximations and collinear scaling for optimizers”. SIAM J. Num. Anal., 17 (1980), pp. 268–281.
R. Fletcher. “Practical methods of optimization”. J. Wiley, 1 (1980).
M. Gaudioso, M.F. Monaco. “A bundle type approach to the unconstrained minimization of convex nonsmooth functions”. Math. Progr.,23 (1982), pp.216226.
M. Gaudioso. “An algorithm for convex NDO based on properties of the contour lines of convex quadratic functions”. In V.F. Demyanov, D. Pallaschke (eds.), Lecture Notes in Econ. and Math., 255, Springer-Verlag (1985).
M. Gaudioso, M.F. Monaco. “Quadratic approximations in convex nondifferentiable optimization”. Dip. Sist. Univ. Calabria, Rep. 71 (1988).
T. Ibaraki. “Parametric approaches to fractional programming”. Math. Progr., 26 (1983), pp. 345–362.
K.C. Kiwiel. “Methods of descent for nondifferentiable optimization”. Lecture Notes in Math., No. 1133, Springer-Verlag (1985).
K.C. Kiwiel. “A method for solving certain quadratic programming problems arising in nonsmooth optimization”. /MA J. of Nurn. Anal., 6 (1986), pp. 137–152.
C. Lemaréchal. “Bundle methods in nonsmooth optimization”. In C. Lemaréchal, R. Mifflin (eds.), “Nonsmooth Optimization”, Pergamon Press, Oxford (1978).
C. Lemaréchal, J. Zowe. “Some remarks on the construction of higher order algorithms in convex aoptimization”. J. of Applied Math. and Opt., 10 (1983), pp. 51–61.
R. Mifflin. “A feasible descent algorithm for linearly constrained least squares problem”. In C. Lemarechal, R. Mifflin (eds.), “Nonsmooth Optimization”, Pergamon Press, Oxford (1978).
M.F. Monaco. “An algorithm for the minimization of a convex quadratic function over a simplex”. Res. Report No. 56 of Dipartimento di Sistemi, Univ. of Calabria (1987).
R.T. Rockafellar. “Convex analysis”. Princeton University Press, Princeton, N.J. (1970).
H. Schramm, J. Zowe. “A combination of the bundle approach and the trust region concept”. Rep. 20, SPP der DFG-Anwendungsbezogene Optimierung and Steuerung (1987).
P. Wolfe. “Finding the nearest point in a polytope”. Math. Progr., 11 (1976), pp. 128–149.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 1989 Springer Science+Business Media New York
About this chapter
Cite this chapter
Gaudioso, M., Monaco, M.F. (1989). Some Techniques for Finding the Search Direction in Nonsmooth Minimization Problems. In: Clarke, F.H., Dem’yanov, V.F., Giannessi, F. (eds) Nonsmooth Optimization and Related Topics. Ettore Majorana International Science Series, vol 43. Springer, Boston, MA. https://doi.org/10.1007/978-1-4757-6019-4_10
Download citation
DOI: https://doi.org/10.1007/978-1-4757-6019-4_10
Publisher Name: Springer, Boston, MA
Print ISBN: 978-1-4757-6021-7
Online ISBN: 978-1-4757-6019-4
eBook Packages: Springer Book Archive