A regularization Newton method for solving nonlinear complementarity problems
DOI10.1007/S002459900128zbMATH Open0937.90110OpenAlexW2038505155WikidataQ127883954 ScholiaQ127883954MaRDI QIDQ1808698FDOQ1808698
Authors: Defeng Sun
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
Recommendations
- A regularization smoothing Newton method for solving nonlinear complementarity problem
- A non-monotone inexact regularized smoothing Newton method for solving nonlinear complementarity problems
- A new smoothing and regularization Newton method for \(P_{0}\)-NCP
- A regularization Newton method for mixed complementarity problems
- A regularization semismooth Newton method based on the generalized Fischer-Burmeister function for \(P_0\)-NCPs
regularizationconvergencenonlinear complementarity problemnonsmooth equationsgeneralized 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)
Cited In (55)
- A smoothing Newton method preserving nonnegativity for solving tensor complementarity problems with \(P_0\) mappings
- Title not available (Why is that?)
- Quadratic one-step smoothing Newton method for \(P_{0}\)-LCP without strict complementarity.
- A regularization Newton method based on the generalized Fischer-Burmeister smoothing function for the NCP
- An application of anisotropic regularization to the existence of weak Pareto minimal points
- A regularization smoothing method for second-order cone complementarity problem
- A regularization Newton method for mixed complementarity problems
- Superlinear noninterior one-step continuation method for monotone LCP in the absence of strict complementarity.
- Superlinear/quadratic one-step smoothing Newton method for \(P_0\)-NCP
- A smoothing Newton-type algorithm of stronger convergence for the quadratically constrained convex quadratic programming
- Generalized Newton and NCP-methods: Convergence, regularity, actions
- A primal-dual algorithm for minimizing a sum of Euclidean norms
- A Regularized Newton Method for \({\boldsymbol{\ell}}_{q}\) -Norm Composite Optimization Problems
- Global linear and quadratic one-step smoothing Newton method for vertical linear complementarity problems
- Quadratic convergence analysis of a nonmonotone Levenberg-Marquardt type method for the weighted nonlinear complementarity problem
- An accelerated Newton method for equations with semismooth jacobians and nonlinear complementarity problems
- A regularization method for the second-order cone complementarity problem with the Cartesian \(P_0\)-property
- Smoothing Newton method for NCP with the identification of degenerate indices
- Title not available (Why is that?)
- A regularized Newton method for solving equilibrium programming problems with an inexactly specified set
- A regularization of the Frank-Wolfe method and unification of certain nonlinear programming methods
- Smoothing Newton algorithm for the second-order cone programming with a nonmonotone line search
- 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 predictor-corrector smoothing Newton method for solving the mixed complementarity problem with a \(P_{0}\)-function
- Extensions of Kantorovich theorem to complementarity problem
- The non-interior continuation methods for solving the \(P_0\) function nonlinear complementarity problem
- A regularization smoothing Newton method for solving nonlinear complementarity problem
- A method for solving nonlinear complementarity problems and its convergence properties
- Predictor-corrector smoothing Newton method, based on a new smoothing function, for solving the nonlinear complementarity problem with a \(P_0\) function
- A regularization semismooth Newton method based on the generalized Fischer-Burmeister function for \(P_0\)-NCPs
- A non-monotone regularization Newton method for the second-order cone complementarity problem
- A non-interior continuation algorithm for the CP based on a generalized smoothing function
- A regularized Newton method for monotone nonlinear equations and its application
- Correction of trust region method with a new modified Newton method
- A robust semi-local convergence analysis of Newton's method for cone inclusion problems in Banach spaces under affine invariant majorant condition
- On a nonsmooth Newton method for nonlinear complementarity problems in function space with applications to optimal control
- 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
- A generalized modulus-based Newton method for solving a class of non-linear complementarity problems with \(P\)-matrices
- Two nonmonotone trust region algorithms based on an improved Newton method
- A note on quadratic convergence of a smoothing Newton algorithm for the LCP
- A one-parametric class of smoothing functions and an improved regularization Newton method for the NCP
- A new class of neural networks for NCPs using smooth perturbations of the natural residual function
- Convergence analysis of a projection algorithm for variational inequality problems
- New reformulation and feasible semismooth Newton method for a class of stochastic linear complementarity problems
- A smoothing-type algorithm for the second-order cone complementarity problem with a new nonmonotone line search
- A non-monotone inexact regularized smoothing Newton method for solving nonlinear complementarity problems
- Properties and construction of NCP functions
- Efficient regularized Newton-type algorithm for solving convex optimization problem
- Solvability of monotone tensor complementarity problems
- A predictor-corrector smoothing method for second-order cone programming
- On the finite convergence of Newton-type methods for \(P_{0}\) affine variational inequalities
- Smoothing Newton method for minimizing the sum of \(p\) -norms
- Smooth convex approximation to the maximum eigenvalue function
This page was built for publication: A regularization Newton method for solving nonlinear complementarity problems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1808698)