journal article Oct 01, 1983

QN-like variable storage conjugate gradients

View at Publisher Save 10.1007/bf02591943
Topics

No keywords indexed for this article. Browse by subject →

References
15
[1]
A combined conjugate-gradient quasi-Newton minimization algorithm

A. G. Buckley

Mathematical Programming 1978 10.1007/bf01609018
[2]
A. Buckley, “Extending the relationship between the conjugate gradient and BFGS algorithms”,Mathematical Programming 15 (1978) 343–348. 10.1007/bf01609038
[3]
A. Buckley, “Conjugate gradient methods”, in: M.J.D. Powell, ed.,Nonlinear Optimization 1981, Proceedings of the NATO Advanced Research Institute on Nonlinear Optimization (Academic Press, London, 1982) pp. 17–22.
[4]
A. Buckley, “A portable package for testing minimization algorithms”, in: John M. Mulvey, ed.,Proceedings of the COAL Conference on Mathematical Programming Software, Boulder, Colorado (Springer, New York, 1982) 226–235.
[5]
R. Fletcher and C.M. Reeves, “Function minimization by conjugate gradients”,Computer Journal 7 (1963) 163–168. 10.1093/comjnl/6.2.163
[6]
R. Fletcher, “AFortran subroutine for minimization by the method of conjugate gradients”, Report R7073, U.K. A.E.R.E., Harwell, England (1972).
[7]
L. Nazareth, “A relationship between the BFGS and conjugate gradient algorithms and its implications for new algorithms”,SIAM Journal on Numerical Analysis 16 (1979) 794–800. 10.1137/0716059
[8]
J. Nocedal, “Updating quasi-Newton matrices with limited storage”,Mathematics of Computation 35 (1980) 773–782. 10.1090/s0025-5718-1980-0572855-7
[9]
S.S. Oren and E. Spedicato, “Optimal conditioning of self-scaling variable metric algorithms”,Mathematical Programming 10 (1976) 70–90. 10.1007/bf01580654
[10]
A. Perry, “A modified conjugate gradient algorithm”, Discussion paper 229, Center for Mathematical Studies in Economics and Management Science, Northwestern University (1976).
[11]
M.J.D. Powell, “Restart procedures for the conjugate gradient method”,Mathematical Programming 12 (1977) 241–254. 10.1007/bf01593790
[12]
D.F. Shanno, “Conjugate gradient methods with inexact searches”,Mathematics of Operations Research 3 (1978) 244–256. 10.1287/moor.3.3.244
[13]
D.F. Shanno and K.-H. Phua, “Numerical comparison of several variable metric algorithms”,Journal of Optimization Theory and Applications 25 (1978) 507–518. 10.1007/bf00933517
[14]
D.F. Shanno, “Remark on Algorithm 500”,ACM Transactions on Mathematical Sofware 6 (1980) 618–622. 10.1145/355921.355933
[15]
Ph. Toint, “Some numerical results using a sparse matrix updating formula in unconstrained optimization”,Mathematics of Computation 32 (1978) 839–851. 10.1090/s0025-5718-1978-0483452-7
Cited By
85
SIAM Journal on Optimization
SIAM Journal on Optimization
Algorithm 630

A. Buckley, A. Lenir · 1985

ACM Transactions on Mathematical So...
Metrics
85
Citations
15
References
Details
Published
Oct 01, 1983
Vol/Issue
27(2)
Pages
155-175
License
View
Cite This Article
A. Buckley, A. Lenir (1983). QN-like variable storage conjugate gradients. Mathematical Programming, 27(2), 155-175. https://doi.org/10.1007/bf02591943
Related

You May Also Like

On the limited memory BFGS method for large scale optimization

Dong C. Liu, Jorge Nocedal · 1989

6,311 citations

Benchmarking optimization software with performance profiles

Elizabeth D. Dolan, Jorge J. Moré · 2002

3,487 citations

An analysis of approximations for maximizing submodular set functions—I

G. L. Nemhauser, L. A. Wolsey · 1978

2,881 citations

Smooth minimization of non-smooth functions

Yu. Nesterov · 2004

1,544 citations