On a Global Complexity Bound of the Levenberg-Marquardt Method
نویسندگان
چکیده
In this paper, we propose a new updating rule of the LevenbergMarquardt (LM) parameter for the LM method for nonlinear equations. We show that the global complexity bound of the new LM algorithm is O( −2), that is, it requires at most O( −2) iterations to derive the norm of the gradient of the merit function below the desired accuracy . Host: Jiawang Nie Wednesday, November 1, 2017 4:00 PM AP&M 2402 * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * *
منابع مشابه
Global Complexity Bound Analysis of the Levenberg-Marquardt Method for Nonsmooth Equations and Its Application to the Nonlinear Complementarity Problem
We investigate a global complexity bound of the Levenberg-Marquardt Method (LMM) for nonsmooth equations F (x) = 0. The global complexity bound is an upper bound to the number of iterations required to get an approximate solution such that ∥∇f(x)∥ ≤ ε, where f is a least square merit function and ε is a given positive constant. We show that the bound of the LMM is O(ε−2). We also show that it i...
متن کاملA new Levenberg-Marquardt approach based on Conjugate gradient structure for solving absolute value equations
In this paper, we present a new approach for solving absolute value equation (AVE) whichuse Levenberg-Marquardt method with conjugate subgradient structure. In conjugate subgradientmethods the new direction obtain by combining steepest descent direction and the previous di-rection which may not lead to good numerical results. Therefore, we replace the steepest descentdir...
متن کاملOn the convergence of the modified Levenberg-Marquardt method with a nonmonotone second order Armijo type line search
Recently, Fan [4, Math. Comput., 81 (2012), pp. 447-466] proposed a modified Levenberg-Marquardt (MLM) method for nonlinear equations. Using a trust region technique, global and cubic convergence of the MLM method is proved [4] under the local error bound condition, which is weaker than nonsingularity. The purpose of the paper is to investigate the convergence properties of the MLM method with ...
متن کاملTrust-region Quadratic Methods for Nonlinear Systems of Mixed Equalities and Inequalities
Two trust-region methods for systems of mixed nonlinear equalities, general inequalities and simple bounds are proposed. The first method is based on a Gauss-Newton model, the second one is based on a regularized Gauss-Newton model and results to be a Levenberg-Marquardt method. The globalization strategy uses affine scaling matrices arising in bound-constrained optimization. Global convergence...
متن کاملConvergence Properties of a Self-adaptive Levenberg-Marquardt Algorithm Under Local Error Bound Condition
We propose a new self-adaptive Levenberg-Marquardt algorithm for the system of nonlinear equations F(x) = 0. The Levenberg-Marquardt parameter is chosen as the product of ‖Fk‖ with δ being a positive constant, and some function of the ratio between the actual reduction and predicted reduction of the merit function. Under the local error bound condition which is weaker than the nonsingularity, w...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- Optimization Methods and Software
دوره 31 شماره
صفحات -
تاریخ انتشار 2010