Abstract
This note demonstrates a new result on superlinear convergence in nonsmooth univariate minimization. It also gives other concepts of rapid convergence for minimization of functions that may have discontinuous derivatives.
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
References
C. Lemaréchal and R. Mifflin, “A globally and superlinearly convergent algorithm for one-dimensional minimization of convex functions,”Mathematical Programming 24 (1982) 241–256.
R. Mifflin, “Stationarity and superlinear convergence of an algorithm for univariate locally Lipschitz constrained minimization,”Mathematical Programming 28 (1984) 50–71.
R. Mifflin, “Better than linear convergence and safeguarding in nonsmooth minimization,” in: P. Thoft-Christensen, ed.,System Modelling and Optimization (Springer, New York, 1984) pp. 321–330.
R. Mifflin, “An implementation of an algorithm for univariate minimization and an application to nested optimization,”Mathematical Programming Study 31 (1987) 155–166.
R. Mifflin, “The solution of a nested nonsmooth optimization problem,” in: V.F. Demyanov and D. Pallasche, eds.,Nondifferentiable Optimization: Motivation and Applications (Springer-Verlag, Berlin, 1985) pp. 36–40.
R. Mifflin and J.-J. Strodiot, “A rapidly convergent five point algorithm for univariate minimization,” Report of the Department of Mathematics, Facultés Universitaires de Namur (Namur, 1985).
R. Mifflin and J.-J. Strodiot, “A bracketing technique to ensure desirable convergence in univariate minimization,”Mathematical Programming 43 (1989) 117–130.
W. Murray and M.L. Overton, “Steplength algorithms for minimizing a class of nondifferentiable functions,”Computing 23 (1979) 309–331.
J.L. Nazareth, “An efficient algorithm for minimizing a multivariate polyhedral function along a line,”Mathematical Programming Study 24 (1985) 116–125.
P. Wolfe, “Sufficient minimization of piecewise-linear univariate functions,” in: C. Lemaréchal and R. Mifflin, eds.,Nonsmooth Optimization (Pergamon Press, Oxford, 1978) pp. 127–130.
Author information
Authors and Affiliations
Additional information
Research sponsored by the Air Force Office of Scientific Research, Air Force Systems Command, USAF, under Grant Numbers AFOSR-83-0210 and AFOSR-88-0180.
Rights and permissions
About this article
Cite this article
Mifflin, R. On superlinear convergence in univariate nonsmooth minimization. Mathematical Programming 49, 273–279 (1990). https://doi.org/10.1007/BF01588792
Received:
Revised:
Issue Date:
DOI: https://doi.org/10.1007/BF01588792