A regularization Newton method for solving nonlinear complementarity problems
From MaRDI portal
Publication:1808698
DOI10.1007/s002459900128zbMath0937.90110OpenAlexW2038505155WikidataQ127883954 ScholiaQ127883954MaRDI QIDQ1808698
Publication date: 14 June 2000
Published in: Applied Mathematics and Optimization (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s002459900128
convergenceregularizationnonsmooth equationsnonlinear complementarity problemgeneralized Newton method
Nonlinear programming (90C30) Numerical computation of solutions to systems of equations (65H10) Complementarity and equilibrium problems and variational inequalities (finite dimensions) (aspects of mathematical programming) (90C33)
Related Items
An application of anisotropic regularization to the existence of weak Pareto minimal points ⋮ A non-monotone inexact regularized smoothing Newton method for solving nonlinear complementarity problems ⋮ Global linear and quadratic one-step smoothing Newton method for vertical linear complementarity problems ⋮ A predictor-corrector smoothing method for second-order cone programming ⋮ A smoothing Newton-type algorithm of stronger convergence for the quadratically constrained convex quadratic programming ⋮ Smoothing nonmonotone Barzilai-Borwein gradient method and its application to stochastic linear complementarity problems ⋮ Globally and quadratically convergent algorithm for minimizing the sum of Euclidean norms ⋮ A regularization smoothing method for second-order cone complementarity problem ⋮ A note on quadratic convergence of a smoothing Newton algorithm for the LCP ⋮ A non-interior continuation algorithm for the CP based on a generalized smoothing function ⋮ Solvability of monotone tensor complementarity problems ⋮ Quadratic one-step smoothing Newton method for \(P_{0}\)-LCP without strict complementarity. ⋮ Predictor-corrector smoothing Newton method, based on a new smoothing function, for solving the nonlinear complementarity problem with a \(P_0\) function ⋮ Smoothing Newton algorithm for the second-order cone programming with a nonmonotone line search ⋮ A robust semi-local convergence analysis of Newton's method for cone inclusion problems in Banach spaces under affine invariant majorant condition ⋮ A non-monotone regularization Newton method for the second-order cone complementarity problem ⋮ A regularization semismooth Newton method based on the generalized Fischer-Burmeister function for \(P_0\)-NCPs ⋮ On the finite convergence of Newton-type methods for \(P_{0}\) affine variational inequalities ⋮ Smoothing Newton method for minimizing the sum of \(p\) -norms ⋮ Superlinear noninterior one-step continuation method for monotone LCP in the absence of strict complementarity. ⋮ Properties and construction of NCP functions ⋮ Feasible smooth method based on Barzilai-Borwein method for stochastic linear complementarity problem ⋮ Solving equations via the trust region and its application to a class of stochastic linear complementarity problems ⋮ New reformulation and feasible semismooth Newton method for a class of stochastic linear complementarity problems ⋮ A regularized Newton method for monotone nonlinear equations and its application ⋮ Smooth convex approximation to the maximum eigenvalue function ⋮ A predictor-corrector smoothing Newton method for solving the mixed complementarity problem with aP0-function ⋮ Smoothing Newton method for NCP with the identification of degenerate indices ⋮ A primal-dual algorithm for minimizing a sum of Euclidean norms ⋮ A regularization method for the second-order cone complementarity problem with the Cartesian \(P_0\)-property ⋮ Quadratic convergence analysis of a nonmonotone Levenberg-Marquardt type method for the weighted nonlinear complementarity problem ⋮ A smoothing-type algorithm for the second-order cone complementarity problem with a new nonmonotone line search ⋮ A one-parametric class of smoothing functions and an improved regularization Newton method for the NCP ⋮ Convergence analysis of a projection algorithm for variational inequality problems ⋮ A regularization smoothing Newton method for solving nonlinear complementarity problem ⋮ Two nonmonotone trust region algorithms based on an improved Newton method ⋮ A regularization Newton method based on the generalized Fischer-Burmeister smoothing function for the NCP ⋮ A new class of neural networks for NCPs using smooth perturbations of the natural residual function ⋮ Efficient regularized Newton-type algorithm for solving convex optimization problem ⋮ A smoothing Newton method preserving nonnegativity for solving tensor complementarity problems with \(P_0\) mappings ⋮ Superlinear/quadratic one-step smoothing Newton method for \(P_0\)-NCP ⋮ The non-interior continuation methods for solving the \(P_0\) function nonlinear complementarity problem ⋮ Correction of trust region method with a new modified Newton method
