论文信息 - Poblano v1.0: A Matlab Toolbox for Gradient-Based Optimization

Poblano v1.0: A Matlab Toolbox for Gradient-Based Optimization

We present Poblano v1.0, a Matlab toolbox for solving gradient-based unconstrained optimization problems. Poblano implements three optimization methods (nonlinear conjugate gradients, limited-memory BFGS, and truncated Newton) that require only first order derivative information. In this paper, we describe the Poblano methods, provide numerous examples on how to use Poblano, and present results of Poblano used in solving problems from a standard test collection of unconstrained optimization problems.

[1] C. M. Reeves,et al. Function minimization by conjugate gradients , 1964, Comput. J..

[2] David J. Thuente,et al. Line search algorithms with guaranteed sufficient decrease , 1994, TOMS.

[3] John E. Dennis,et al. Numerical methods for unconstrained optimization and nonlinear equations , 1983, Prentice Hall series in computational mathematics.

[4] Jorge J. Moré,et al. Testing Unconstrained Optimization Software , 1981, TOMS.

[5] Robert H. Halstead,et al. Matrix Computations , 2011, Encyclopedia of Parallel Computing.

[6] M. Hestenes,et al. Methods of conjugate gradients for solving linear systems , 1952 .

[7] Trond Steihaug,et al. Truncated-newtono algorithms for large-scale unconstrained optimization , 1983, Math. Program..

[8] Michael L. Overton,et al. Numerical Computing with IEEE Floating Point Arithmetic , 2001 .

[9] M. Saunders,et al. Solution of Sparse Indefinite Systems of Linear Equations , 1975 .

[10] Shirley Dex,et al. JR 旅客販売総合システム（マルス）における運用及び管理について , 1991 .

[11] D K Smith,et al. Numerical Optimization , 2001, J. Oper. Res. Soc..