This paper studies the three-term conjugate gradient method for unconstrained optimization. The method includes the classical (two-term) conjugate gradient method and the famous Beale-Powell restart algorithm as its special forms. Some mild conditions are given in this paper, which ensure the global convergence of general three-term conjugate gradient methods.
SLMQN is a subspace limited memory quasi-Newton algorithm for solving largescale bound constrained nonlinear programming problems. The algorithm is suitable to these large problems in which the Hessian matrix is difficult to compute or is dense,or the number of variables is too large to store and compute an n x n matris. Due to less storage requirement, this algorithm can be used in PCs for solving medium-sized and large problems. The algorithm is implemented in Fortran 77.
