Abstract
In this paper acceptability criteria for the linesearch stepsize are introduced which require only function values. Simple algorithm models based on these criteria are presented. Some modifications of criteria based on the knowledge of the directional derivative are also illustrated.
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
References
L. Armijo, “Minimization of functions having Lipschitz-continuous first partial derivatives”,Pacific Journal on Mathematics 16 (1966) 1–3.
D.P. Bertsekas, “Variable metric methods for constrained optimization using differentiable exact penalty functions”, in:Proceeding eighteenth annual Allerton conference on communication, control and computing (Allerton Park, Illinois, 1980) pp. 584–593.
M.C. Biggs, “Some improvements to the ‘OPTIMA’ subroutines”, Technical Report 69, Numerical Optimization Centre, The Hatfield Polytechnic (Hatfield, England, 1975).
G. Di Pillo, L. Grippo and F. Lampariello, “A method for solving equality constrained optimization problems by unconstrained minimization”, in: K. Iraki, K. Malanowski and S. Walukiewicz, eds.,9th IFIP conference on optimization techniques (Springer, Berlin, 1980) pp. 96–105.
G. Di Pillo, L. Grippo and F. Lampariello, “A class of algorithms for the solution of optimization problems with inequalities”, in: R.F. Drenick and F. Kozin, eds.,System modelling and optimization (Springer, Berlin, 1982) pp. 508–519.
L.C.W. Dixon, “Nonlinear optimization: A survey of the state of the art”, in: D.J. Evans, ed.,Software for numerical mathematics (Academic Press, New York, 1973) pp. 193–216.
L.C.W. Dixon, “On the convergence of the variable metric method with numerical derivatives and the effect of noise in the function evaluation”, in: W. Oettli and K. Ritter, eds.,Numerical methods of optimization and operational research (Springer, New York, Heidelberg, Berlin, 1976) pp. 35–54.
P.E. Gill, W. Murray, M.A. Saunders and M.H. Wright, “A note on a sufficient-decrease criterion for a nonderivative step-length procedure”,Mathematical Programming 23 (1982) 349–352.
A. Goldstein and J. Price, “An effective algorithm for minimization”,Numerische Mathematik 10 (1967) 184–189.
R. Mifflin, “A superlinear convergent algorithm for minimization without evaluating derivatives”,Mathematical Programming 9 (1975) 100–117.
J.M. Ortega and W.C. Rheinboldt,Iterative solution of nonlinear equations in several variables (Academic Press, New York, 1970).
E. Polak,Computational methods in optimization (Academic Press, New York, 1971).
M.J.D. Powell, “Some global convergence properties of variable metric algorithm for minimization without exact line search”, in: R.W. Cottle and C.E. Lemke, eds.,Nonlinear programming (American Mathematical Society, Providence, RI, 1976) pp. 53–72.
R.A. Tapia, “Diagonalized multiplier methods and quasi-Newton methods for constrained optimization”,Journal of Optimization Theory and Applications 22 (1977) 135–194.
P. Wolfe, “Convergence conditions for ascent methods”,SIAM Review 11 (1969) 226–235.
Author information
Authors and Affiliations
Additional information
This paper was written while this author was visiting CRAI.
Rights and permissions
About this article
Cite this article
De Leone, R., Gaudioso, M. & Grippo, L. Stop** criteria for linesearch methods without derivatives. Mathematical Programming 30, 285–300 (1984). https://doi.org/10.1007/BF02591934
Received:
Revised:
Issue Date:
DOI: https://doi.org/10.1007/BF02591934