Skip to main content
Log in

A unified local convergence analysis of inexact constrained Levenberg–Marquardt methods

  • Original Paper
  • Published:
Optimization Letters Aims and scope Submit manuscript

Abstract

The Levenberg–Marquardt method is a regularized Gauss–Newton method for solving systems of nonlinear equations. If an error bound condition holds it is known that local quadratic convergence to a non-isolated solution can be achieved. This result was extended to constrained Levenberg–Marquardt methods for solving systems of equations subject to convex constraints. This paper presents a local convergence analysis for an inexact version of a constrained Levenberg–Marquardt method. It is shown that the best results known for the unconstrained case also hold for the constrained Levenberg–Marquardt method. Moreover, the influence of the regularization parameter on the level of inexactness and the convergence rate is described. The paper improves and unifies several existing results on the local convergence of Levenberg–Marquardt methods.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Similar content being viewed by others

References

  1. Bellavia S., Morini B.: Subspace trust-region methods for large bound-constrained nonlinear equations. SIAM J. Numer. Anal. 44, 1535–1555 (2006)

    Article  MathSciNet  MATH  Google Scholar 

  2. Dan H., Yamashita N., Fukushima M.: Convergence properties of the inexact Levenberg–Marquardt method under local error bound conditions. Optim. Methods Softw. 17, 605–626 (2002)

    Article  MathSciNet  MATH  Google Scholar 

  3. Dembo R.S., Eisenstat S.C., Steihaug T.: Inexact Newton methods. SIAM J. Numer. Anal. 19, 400–408 (1982)

    Article  MathSciNet  MATH  Google Scholar 

  4. Facchinei F., Fischer A., Piccialli V.: Generalized Nash equilibrium problems and Newton methods. Math. Progr. 117, 163–194 (2009)

    Article  MathSciNet  MATH  Google Scholar 

  5. Facchinei F., Kanzow C.: A nonsmooth inexact Newton method for the solution of large-scale nonlinear complementarity problems. Math. Progr. 76, 493–512 (1997)

    MathSciNet  MATH  Google Scholar 

  6. Fan J., Pan J.: Inexact Levenberg–Marquardt method for nonlinear equations. Discret. Contin. Dyn. System.—Ser. B 4, 1223–1232 (2004)

    Article  MathSciNet  MATH  Google Scholar 

  7. Fan J., Yuan Y.: On the quadratic convergence of the Levenberg–Marquardt method without nonsingularity assumption. Computing. 74, 23–39 (2005)

    Article  MathSciNet  MATH  Google Scholar 

  8. Fischer A.: Local behavior of an iterative framework for generalized equations with nonisolated solutions. Math. Progr. 94, 91–124 (2002)

    Article  MATH  Google Scholar 

  9. Fischer A., Shukla P.K.: A Levenberg–Marquardt algorithm for unconstrained multicriteria optimization. Oper. Res. Lett. 36, 643–646 (2008)

    Article  MathSciNet  MATH  Google Scholar 

  10. Fischer A., Shukla P.K., Wang M.: On the inexactness level of robust Levenberg–Marquardt methods. Optimization. 59, 273–287 (2010)

    Article  MathSciNet  MATH  Google Scholar 

  11. Floudas, C.A., Pardalos, P.M. (eds): Encyclopedia of Optimization. 2nd edn. Springer, Berlin (2008)

    Google Scholar 

  12. Kanzow C., Petra S.: On a semismooth least squares formulation of complementarity problems with gap reduction. Optim. Methods Softw. 19, 507–525 (2004)

    Article  MathSciNet  MATH  Google Scholar 

  13. Kanzow C., Petra S.: Projected filter trust region methods for a semismooth least squares formulation of mixed complementarity problems. Optim. Methods Softw. 22, 713–735 (2007)

    Article  MathSciNet  MATH  Google Scholar 

  14. Kanzow C., Yamashita N., Fukushima M.: Levenberg–Marquardt methods with strong local convergence properties for solving nonlinear equations with convex constraints. J. Comput. Appl. Math. 172, 375–397 (2004)

    Article  MathSciNet  MATH  Google Scholar 

  15. Levenberg K.: A method for the solution of certain non-linear problems in least squares. Q. Appl. Math. 2, 164–168 (1944)

    MathSciNet  MATH  Google Scholar 

  16. Macconi M., Morini B., Porcelli M.: Trust-region quadratic methods for nonlinear systems of mixed equalities and inequalities. Appl. Numer. Math. 59, 859–876 (2009)

    Article  MathSciNet  MATH  Google Scholar 

  17. Marquardt D.W.: An algorithm for least-squares estimation of nonlinear parameters. J. Soc. Ind. Appl. Math. 11, 431–441 (1963)

    Article  MathSciNet  MATH  Google Scholar 

  18. Yamashita N., Fukushima M.: On the rate of convergence of the Levenberg–Marquardt method. Computing. 15(Suppl), 239–249 (2001)

    MathSciNet  Google Scholar 

  19. Zhang J.-L.: On the convergence properties of the Levenberg–Marquardt method. Optimization. 52, 739–756 (2003)

    Article  MathSciNet  MATH  Google Scholar 

  20. Zhu D.: Affine scaling interior Levenberg–Marquardt method for bound-constrained semismooth equations under local error bound conditions. J. Comput. Appl. Math. 219, 198–215 (2008)

    Article  MathSciNet  MATH  Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to Andreas Fischer.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Behling, R., Fischer, A. A unified local convergence analysis of inexact constrained Levenberg–Marquardt methods. Optim Lett 6, 927–940 (2012). https://doi.org/10.1007/s11590-011-0321-3

Download citation

  • Received:

  • Accepted:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s11590-011-0321-3

Keywords

Navigation