Abstract: The tensor method for unconstrained optimization was first introduced by Schnable and Chow [SIAM Journal on Optimization, 1 (1991): 293–315], where each iteration bases upon a fourth order model for the objec- tive function. In this paper, we propose a tensor method with a non-monotone line search scheme for solving the unconstrained optimization problem, and show the convergence of the method. We evaluate the proposed method by several numerical examples, and compare the obtained numerical results with those by the modified Newton method, the tensor method, and the monotone tensor method. Through the numerical results, we can see that the new method is more effective than others for the problems we tested.
DOI: *As the DOI is a unique identifier, it is already available in the pdf version. **The DOI link will be activated in the first midst of January 2026.
Xianjun Shi, Lei Yang, Ying Zhang, "A Non-Monotone Tensor Method for Unconstrained Optimization Problems," WSEAS Transactions on Mathematics, vol. 11, pp. -, 2012, DOI:
Xianjun Shi, Lei Yang, Ying Zhang. A Non-Monotone Tensor Method for Unconstrained Optimization Problems.
WSEAS Transactions on Mathematics. 2012;11:-.