Access the full text.
Sign up today, get DeepDyve free for 14 days.
J. Barzilai, J. Borwein (1988)
Two-Point Step Size Gradient MethodsIma Journal of Numerical Analysis, 8
W. Glunt, T. Hayden, M. Raydan (1994)
Preconditioners for distance matrix algorithmsJournal of Computational Chemistry, 15
NONMONOTONE GLOBALIZATION TECHNIQUES
R. Leone, M. Gaudioso, L. Grippo (1984)
Stopping criteria for linesearch methods without derivativesMathematical Programming, 30
L. Grippo, F. Lampariello, S. Lucidi (1991)
A class of nonmonotone stabilization methods in unconstrained optimizationNumerische Mathematik, 59
J. Moré, D. Sorensen (1979)
On the use of directions of negative curvature in a modified newton methodMathematical Programming, 16
D. Shanno, K. Phua (1978)
Matrix conditioning and nonlinear optimizationMathematical Programming, 14
(1990)
“Lowstoragemethodsforunconstrainedoptimization,”LecturesinAppliedMathematics
M. Raydan (1993)
On the Barzilai and Borwein choice of steplength for the gradient methodIma Journal of Numerical Analysis, 13
P. Gill, W. Murray, M. Wright (2019)
Practical optimization
F. Ana, Mario José, Raydon Marcos (1995)
A new method for large-scale box constrained convex quadratic minimization problemsOptimization Methods & Software, 5
J. Ortega, W. Rheinboldt (2014)
Iterative solution of nonlinear equations in several variables
A. Friedlander, J. Martínez, B. Molina, M. Raydan (1998)
Gradient Method with Retards and GeneralizationsSIAM Journal on Numerical Analysis, 36
B. Molina, M. Raydan (1996)
Preconditioned Barzilai-Borwein method for the numerical solution of partial differential equationsNumerical Algorithms, 13
Dong Liu, J. Nocedal (1989)
On the limited memory BFGS method for large scale optimizationMathematical Programming, 45
Yuhong Dai, Hongchao Zhang (2001)
Adaptive Two-Point Stepsize Gradient AlgorithmNumerical Algorithms, 27
R. Chamberlain, M. Powell, C. Lemaréchal, H. Pedersen (1982)
The watchdog technique for forcing convergence in algorithms for constrained optimization
(1999)
Nonlinear Programming, 2nd edn
Wenbin Liu, Yuhong Dai (2001)
Minimization Algorithms Based on Supervisor and Searcher CooperationJournal of Optimization Theory and Applications, 111
L. Grippo, F. Lampariello, S. Lucidi (1986)
A nonmonotone line search technique for Newton's methodSIAM Journal on Numerical Analysis, 23
From (39) and (40), recalling the definition of k given in (18), it follows that for k ∈ K 1 and k sufficiently large condition (22) does not hold, and hence at least one of the conditions
Yuhong Dai, L. Liao (2002)
R-linear convergence of the Barzilai and Borwein gradient methodIma Journal of Numerical Analysis, 22
M. Raydan (1997)
The Barzilai and Borwein Gradient Method for the Large Scale Unconstrained Minimization ProblemSIAM J. Optim., 7
Ingrid Bongartz, A. Conn, N. Gould, P. Toint (1995)
CUTE: constrained and unconstrained testing environmentACM Trans. Math. Softw., 21
R. Murphy (1994)
Iterative solution of nonlinear equationsJournal of Computers in Mathematics and Science Teaching archive, 13
(2000)
and H
M. Raydan, B. Svaiter (2002)
Relaxed Steepest Descent and Cauchy-Barzilai-Borwein MethodComputational Optimization and Applications, 21
Jean Gilbert, C. Lemaréchal (1989)
Some numerical experiments with variable-storage quasi-Newton algorithmsMathematical Programming, 45
R. Fletcher (1990)
Low storage methods for unconstrained optimizationLectures in Applied Mathematics (AMS), 26
W. Glunt, T. Hayden, M. Raydan (1993)
Molecular conformations from distance matricesJournal of Computational Chemistry, 14
In this paper we propose new globalization strategies for the Barzilai and Borwein gradient method, based on suitable relaxations of the monotonicity requirements. In particular, we define a class of algorithms that combine nonmonotone watchdog techniques with nonmonotone linesearch rules and we prove the global convergence of these schemes. Then we perform an extensive computational study, which shows the effectiveness of the proposed approach in the solution of large dimensional unconstrained optimization problems.
Computational Optimization and Applications – Springer Journals
Published: Oct 10, 2004
Read and print from thousands of top scholarly journals.
Already have an account? Log in
Bookmark this article. You can see your Bookmarks on your DeepDyve Library.
To save an article, log in first, or sign up for a DeepDyve account if you don’t already have one.
Copy and paste the desired citation format or use the link below to download a file formatted for EndNote
Access the full text.
Sign up today, get DeepDyve free for 14 days.
All DeepDyve websites use cookies to improve your online experience. They were placed on your computer when you launched this website. You can change your cookie settings through your browser.