摘要
We consider an Iterated-Subspace Minimization(ISM) method for solving large-scale unconstrained minimization problems. At each major iteration of the method,a two-dimensional manifold, the iterated subspace, is constructed and an approximate minimizer of the objective function in this manifold then determined, and a symmetric rank-one updating is used to solve the inner minimization problem.
We consider an Iterated-Sub space Minimization(ISM) method for solving large-scale unconstrained minimization problems. At each major iteration of the method, a two-dimensional manifold, the iterated subspace, is constructed and an approximate mmimizer of the objective function in this manifold then determined, and a symmetric rank-one updating is used to solve the inner minimization problem.
