This is a preview of subscription content, log in via an institution to check access.
Preview
Unable to display preview. Download preview PDF.
6. References
F. H. Clarke, Generalized gradients and applications, Transactions of the American Mathematical Society 205 (1975) 247–262.
C. Lemarechal and R. Mifflin, Global and superlinear convergence of an algorithm for one-dimensional minimization of convex functions, Mathematical Programming 24 (1982) 241–256.
I. Mifflin and R. Mifflin, A BASIC program for solving univariate constrained minimization problems, Dept. of Pure and Applied Mathematics, Washington State University (Pullman, WA 1983).
R. Mifflin, A modification and extension of Lemarechal's algorithm for nonsmooth minimization, in Nondifferential and Variational Techniques in Optimization, R. Wets and D. Sorensen, eds. Mathematical Programming Study 16 (1982) 77–90.
R. Mifflin, A superlinearly convergent algorithm for one-dimensional constrained minimization problems with convex functions, Mathematics of Operations Research 8 (1983) 185–195.
R. Mifflin, Stationarity and superlinear convergence of an algorithm for univariate locally Lipschitz constrained minimization, Department of Pure and Applied Mathematics, Washington State University (Pullman, 1982), to appear in Mathematical Programming.
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1984 Springer-Verlag
About this paper
Cite this paper
Mifflin, R. (1984). Better than linear convergence and safeguarding in nonsmooth minimization. In: Thoft-Christensen, P. (eds) System Modelling and Optimization. Lecture Notes in Control and Information Sciences, vol 59. Springer, Berlin, Heidelberg. https://doi.org/10.1007/BFb0008905
Download citation
DOI: https://doi.org/10.1007/BFb0008905
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-13185-4
Online ISBN: 978-3-540-38828-9
eBook Packages: Springer Book Archive