A FAMILY OF SMOOTH NCP FUNCTIONS AND AN INEXACT LEVENBERG-MARQUARDT METHOD FOR NONLINEAR COMPLEMENTARITY PROBLEMS

Jingyong Tang*, Jinchuan Zhou, Jan Harold Alcantara, Jein Shan Chen

*Corresponding author for this work

Research output: Contribution to journalArticlepeer-review

Abstract

In this paper, we introduce a family of new NCP functions which is smooth, coercive and strongly semismooth. Based on new NCP functions, we propose an inexact Levenberg-Marquardt method for solving Nonlinear Complementarity Problem (NCP). Different from existing exact/inexact Levenberg-Marquardt methods, the proposed method adopts a derivative-free line search to ensure its globalization. Moreover, by using the strong semismoothness of new NCP functions, wc prove that the proposed method is locally superlinearly/quadratically convergent under a local error bound condition. Some numerical results are reported.

Original languageEnglish
Pages (from-to)2361-2385
Number of pages25
JournalJournal of Nonlinear and Convex Analysis
Volume24
Issue number11
Publication statusPublished - 2023

Keywords

  • Levenberg-Marquardt method
  • NCP function
  • Nonlinear complementarity problem
  • superlinear/quadratic convergence

ASJC Scopus subject areas

  • Analysis
  • Geometry and Topology
  • Control and Optimization
  • Applied Mathematics

Fingerprint

Dive into the research topics of 'A FAMILY OF SMOOTH NCP FUNCTIONS AND AN INEXACT LEVENBERG-MARQUARDT METHOD FOR NONLINEAR COMPLEMENTARITY PROBLEMS'. Together they form a unique fingerprint.

Cite this