A nonmonotone Levenberg-Marquardt method for nonlinear complementarity problems under local error bound
DOI10.1007/S40314-015-0222-7zbMATH Open1359.65093OpenAlexW2073342071MaRDI QIDQ520265FDOQ520265
Publication date: 3 April 2017
Published in: Computational and Applied Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s40314-015-0222-7
Recommendations
- A Levenberg-Marquardt method for nonlinear complementarity problems based on nonmonotone trust region and line search techniques
- Smoothing Levenberg-Marquardt method for general nonlinear complementarity problems under local error bound
- A globally convergent Levenberg-Marquardt method for solving nonlinear complementarity problem
- Global complexity bound analysis of the Levenberg-Marquardt method for nonsmooth equations and its application to the nonlinear complementarity problem
- A smoothing Levenberg-Marquardt method for nonlinear complementarity problems
- Convergence analysis of nonmonotone Levenberg-Marquardt algorithms for complementarity problem
- An active-set Levenberg-Marquardt method for degenerate nonlinear complementarity problem under local error bound conditions
- A nonsmooth Levenberg-Marquardt method for vertical complementarity problems
- Quadratic convergence analysis of a nonmonotone Levenberg-Marquardt type method for the weighted nonlinear complementarity problem
global convergencenonlinear complementarity problemsnonsmooth equationssuperlinear/quadratic convergencenonmonotone Levenberg-Marquardt algorithm
Numerical mathematical programming methods (65K05) Complementarity and equilibrium problems and variational inequalities (finite dimensions) (aspects of mathematical programming) (90C33)
Cites Work
- Testing Unconstrained Optimization Software
- A Nonmonotone Line Search Technique and Its Application to Unconstrained Optimization
- An Algorithm for Least-Squares Estimation of Nonlinear Parameters
- A method for the solution of certain non-linear problems in least squares
- A nonsmooth version of Newton's method
- Optimization and nonsmooth analysis
- Semismooth and Semiconvex Functions in Constrained Optimization
- A semismooth equation approach to the solution of nonlinear complementarity problems
- Error bounds in mathematical programming
- Title not available (Why is that?)
- Engineering and Economic Applications of Complementarity Problems
- Finite-dimensional variational inequality and nonlinear complementarity problems: A survey of theory, algorithms and applications
- Convergence analysis of nonmonotone Levenberg-Marquardt algorithms for complementarity problem
- A nonsmooth inexact Newton method for the solution of large-scale nonlinear complementarity problems
- Global Convergence Properties of Some Iterative Methods for Linear Complementarity Problems
- Incorporating nonmonotone strategies into the trust region method for unconstrained optimization
- A smoothing Levenberg-Marquardt method for NCP
- Convergence Properties of the Inexact Levenberg-Marquardt Method under Local Error Bound Conditions
- Nonsmooth Equations: Motivation and Algorithms
- The quadratic convergence of a smoothing Levenberg-Marquardt method for nonlinear complementarity problem
- Inexact trust region method for large sparse systems of nonlinear equations
- New error bounds and their applications to convergence analysis of iterative algorithms
Cited In (3)
- A globally convergent Levenberg-Marquardt method for solving nonlinear complementarity problem
- A smoothing Levenberg-Marquardt method for nonlinear complementarity problems
- Global complexity bound analysis of the Levenberg-Marquardt method for nonsmooth equations and its application to the nonlinear complementarity problem
Uses Software
This page was built for publication: A nonmonotone Levenberg-Marquardt method for nonlinear complementarity problems under local error bound
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q520265)
