This is a preview of subscription content, log in via an institution to check access.
Preview
Unable to display preview. Download preview PDF.
References
L. Armijo, Pacific Journal of Mathematics 16 (1966) 1–16.
J. Chatelon, D. Hearn, T.J. Lowe, A subgradient algorithm for certain minimax and minisum problems, Mathematical Programming 15, 2 (1978) 130–145.
F.H. Clarke, Generalized gradients and applications, Transactions of the AMS 205 (1975) 247–262.
V.F. Demjanov, V.N. Malozemov, Introduction to minimax, Wiley, New York, 1974.
J.E. Dennis, J.J. Moré, A characterization of superlinear convergence and its application to quasi-Newton methods, Maths. Comp. 28 (1974) 549–560.
R. Fletcher, A new approach to variable metric algorithms, Comp. Journ. 13, 3 (1970) 317–322.
P.S. Gill, W. Murray, Safeguarded steplength algorithms for optimization using descent methods, NPL Report NAC 37 (1974).
A.A. Goldstein, Constructive real analysis, Harper, New York (1967).
A.A. Goldstein, Optimization of Lipschitz continuous functions, Math. Prog. 13. 1 (1977) 14–22.
S.P. Han, Variable metric methods for minimizing a class of nondifferentiable functions, Math. Prog. (to appear).
C. Lemaréchal, An extension of Davidon methods to nondifferentiable problems. Math. Prog. Study 3: Nondifferentiable Optimization, Balinski & Wofle Eds. North Holland (1975) 95–109.
K. Madsen, An algorithm for minimax solution of overdetermined systems of non-linear equations, J. Inst. Maths & Appl. 16 (1975) 321–328.
R. Mifflin, Semi-smooth and semi-convex functions in constrained optimization, SIAM Control & Opt. 15, 6 (1977) 959–972.
R. Mifflin, An algorithm for constrained optimization with semi-smooth functions, Math. Op. Res. 2, (1977) 191–207.
W. Murray, M.L. Overton, Steplength algorithms for a class of nondifferentiable functions, Report CS-78-679 (1978) Stanford Univ.
M.J.D. Powell, Some global convergence properties of a variable metric algorithm for minimization without exact line searches, in: Nonlinear Programming. SIAM-AMS Proc. 9 (1976) Providence, R.I.
D.F. Shanno, Conjugate gradient methods with inexact searches, Math. Op. Res. 3, 3 (1978) 244–256.
W. Warth, J. Werner. Effiziente Schrittweitenfunktionen bei unrestringierten Optimierungsaufgaben. Computing 19 (1977) 59–72.
J. Werner, Über die globale Konvergenz von Variable-Metrik-Verfahren mit nichtexakterSchrittweitenbestimmung. Numer. Math. 31 (1978) 321–334.
P. Wolfe, Convergence conditions for ascent methods, SIAM Review 11 (1969), 226–235.
P. Wolfe. A method of conjugate subgradients for minimizing nondifferentiable functions, Math. Prog. Study 3: Nondifferentiable Optimization, Balinski & Wolfe Eds. North Holland (1975) 145–173.
G. Zoutendijk. Some algorithms based on the principle of feasible directions. in: Integer and Nonlinear Programming, Abadie Ed. North Holland, (1970).
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1981 Springer-Verlag
About this paper
Cite this paper
Lemarechal, C. (1981). A view of line-searches. In: Auslender, A., Oettli, W., Stoer, J. (eds) Optimization and Optimal Control. Lecture Notes in Control and Information Sciences, vol 30. Springer, Berlin, Heidelberg. https://doi.org/10.1007/BFb0004506
Download citation
DOI: https://doi.org/10.1007/BFb0004506
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-10627-2
Online ISBN: 978-3-540-38591-2
eBook Packages: Springer Book Archive