A new filter-Levenberg-Marquardt method with disturbance for solving nonlinear complementarity problems

DOI10.1016/j.amc.2010.01.098zbMath1197.65065OpenAlexW2016782412MaRDI QIDQ963957

Jun Long, Sanyun Zeng

Publication date: 14 April 2010

Published in: Applied Mathematics and Computation (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.amc.2010.01.098

zbMATH Keywords

global convergencedisturbancenonlinear complementarity problemsmoothing Newton methodsfilter Levenberg-Marquardt method

Mathematics Subject Classification ID

Numerical mathematical programming methods (65K05) Complementarity and equilibrium problems and variational inequalities (finite dimensions) (aspects of mathematical programming) (90C33)

Related Items (5)

A modified Levenberg-Marquardt method with line search for nonlinear equations ⋮ Global convergence of a general filter algorithm based on an efficiency condition of the step ⋮ A smoothing Newton method for ncps with the \(P_{0}\)-property ⋮ A dwindling filter line search method for unconstrained optimization ⋮ Filter-based stochastic algorithm for global optimization

Uses Software

• filterSQP
• ipfilter

Cites Work

• Unnamed Item
• A new filter method for solving nonlinear complementarity problems
• A globally convergent Levenberg-Marquardt method for solving nonlinear complementarity problem
• Convergence theory for the structured BFGS secant method with an application to nonlinear least squares
• Factorized quasi-Newton methods for nonlinear least squares problems
• Nonmonotone Levenberg-Marquardt algorithms and their convergence analysis
• On the global convergence of an SLP-filter algorithm that takes EQP steps
• Smoothing trust region methods for nonlinear complementarity problems with \(P_0\)-functions
• On the superlinear local convergence of a filter-SQP method
• A new look at smoothing Newton methods for nonlinear complementarity problems and box constrained variational inequalities
• A nonsmooth version of Newton's method
• A filter method for solving nonlinear complementarity problems based on derivative-free line search
• A trust region filter method for general non-linear programming
• Global and superlinear convergence of the smoothing Newton method and its application to general box constrained variational inequalities
• Numerical Experience with Lower Bounds for MIQP Branch-And-Bound
• A Family of Scaled Factorized Broyden-Like Methods for Nonlinear Least Squares Problems
• A Pattern Search Filter Method for Nonlinear Programming without Derivatives
• Improving the convergence of non-interior point algorithms for nonlinear complementarity problems
• On the Global Convergence of a Filter--SQP Algorithm
• Global Convergence of a Trust-Region SQP-Filter Algorithm for General Nonlinear Programming
• Solving variational inequality problems via smoothing-nonsmooth reformulations
• Nonlinear programming without a penalty function.

This page was built for publication: A new filter-Levenberg-Marquardt method with disturbance for solving nonlinear complementarity problems