Search

This paper proposes an algorithm for computing the maximum (or minimum) complementarity eigenvalues of tensors. We formulate this as proper polynomial optimization problems that can be efficiently solved by Lasserre type semidefinite relaxations. The algorithm is proved to have finite convergence for generic tensors. [ABSTRACT FROM AUTHOR]

In this paper, we propose a new updating rule of the Levenberg–Marquardt (LM) parameter for the LM method for nonlinear equations. We show that the global complexity bound of the new LM algorithm is, that is, it requires at mostiterations to derive the norm of the gradient of the merit function below the desired accuracy. [ABSTRACT FROM PUBLISHER]