|Title:||SESOP-TN: Combining Sequential Subspace Optimization with Truncated Newton method
|Abstract:||We present a method for very large scale unconstrained optimization of smooth functions. It combines ideas of Sequential Subspace Optimization (SESOP) with those of the Truncated Newton (TN) method. Replacing TN line search with subspace optimization, we allow Conjugate Gradient (CG) iterations to stay matched through consequent TN steps. This resolves the problem of TN sensitivity to an early break of the CG process. For example, when an objective function is quadratic, the SESOP-TN trajectory coincides with the trajectory of CG as applied directly to the objective. Standard TN lacks this property and converges more slowly. Numerical experiments illustrate the effectiveness of the method. Matlab code is available at http://ie.technion.ac.il/~mcib/sesoptn.html|
|Copyright||The above paper is copyright by the Technion, Author(s), or others. Please contact the author(s) for more information|
Remark: Any link to this technical report should be to this page (http://www.cs.technion.ac.il/users/wwwb/cgi-bin/tr-info.cgi/2008/CIS/CIS-2008-04), rather than to the URL of the PDF files directly. The latter URLs may change without notice.
To the list of the CIS technical reports of 2008
To the main CS technical reports page
Computer science department, Technion