Quadratic convergence analysis of a nonmonotone Levenberg-Marquardt type method for the weighted nonlinear complementarity problem
From MaRDI portal
Publication:2044578
DOI10.1007/s10589-021-00300-8zbMath1473.90171OpenAlexW3180979688MaRDI QIDQ2044578
Publication date: 9 August 2021
Published in: Computational Optimization and Applications (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10589-021-00300-8
quadratic convergenceLevenberg-Marquardt methodcomplementarity functionlocal error boundweighted nonlinear complementarity problem
Related Items
A derivative-free line search technique for Broyden-like method with applications to NCP, wLCP and SI, A dynamic model to solve weighted linear complementarity problems, An accelerated smoothing Newton method with cubic convergence for weighted complementarity problems
Cites Work
- Unnamed Item
- A smoothing Newton algorithm for weighted linear complementarity problem
- Sufficient weighted complementarity problems
- A new smoothing and regularization Newton method for \(P_{0}\)-NCP
- A regularization semismooth Newton method based on the generalized Fischer-Burmeister function for \(P_0\)-NCPs
- A one-step smoothing Newton method for second-order cone programming
- A class of large-update and small-update primal-dual interior-point algorithms for linear optimization
- Error bounds for analytic systems and their applications
- Error bounds in mathematical programming
- Predictor-corrector smoothing Newton method, based on a new smoothing function, for solving the nonlinear complementarity problem with a \(P_0\) function
- On the quadratic convergence of the Levenberg-Marquardt method without nonsingularity assumption
- A regularization Newton method for solving nonlinear complementarity problems
- Complexity analysis and numerical implementation of primal-dual interior-point methods for convex quadratic optimization based on a finite barrier
- A new look at smoothing Newton methods for nonlinear complementarity problems and box constrained variational inequalities
- A variant nonmonotone smoothing algorithm with improved numerical results for large-scale LWCPS
- A nonmonotone smoothing Newton algorithm for weighted complementarity problem
- A full-Newton step interior-point method for monotone weighted linear complementarity problems
- A smoothing Levenberg-Marquardt algorithm for semi-infinite programming
- A nonsmooth version of Newton's method
- A smoothing Levenberg-Marquardt method for generalized semi-infinite programming
- A smoothing Newton-type method for generalized nonlinear complementarity problem
- The convergence of a one-step smoothing Newton method for \(P_0\)-NCP based on a new smoothing NCP-function
- Equivalence of the generalized complementarity problem to differentiable unconstrained minimization
- On the Resolution of the Generalized Nonlinear Complementarity Problem
- A one-parametric class of smoothing functions and an improved regularization Newton method for the NCP
- Unconstrained optimization reformulation of the generalized nonlinear complementarity problem and related method
- A non-interior continuation method for second-order cone programming
- A Trust Region Method for Solving Generalized Complementarity Problems
- A Nonmonotone Line Search Technique and Its Application to Unconstrained Optimization
- A Comparative Study of Kernel Functions for Primal-Dual Interior-Point Algorithms in Linear Optimization
- Weighted Complementarity Problems---A New Paradigm for Computing Equilibria
- Interior-point algorithms for a generalization of linear programming and weighted centring
- A Fully Polynomial-Time Approximation Algorithm for Computing a Stationary Point of the General Linear Complementarity Problem
- Accelerating the modified Levenberg-Marquardt method for nonlinear equations
- Solution of a general linear complementarity problem using smooth optimization and its application to bilinear programming and LCP
