printable pdf
比利时vs摩洛哥足彩 ,
university of california san diego

****************************

math 278c - optimization seminar and data science

ruixue zhao

shanghai jiaotong university

on a global complexity bound of the levenberg-marquardt method

abstract:

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 $o(\epsilon^{-2})$, that is, it requires at most $o(\epsilon^{-2})$ iterations to derive the norm of the gradient of the merit function below the desired accuracy $\epsilon$.

host: jiawang nie

november 1, 2017

4:00 pm

ap&m 2402

****************************