A modified feasible semi-smooth asymptotically Newton method for nonlinear complementarity problems
From MaRDI portal
Publication:311331
DOI10.1186/s13660-016-1174-1zbMath1346.90781OpenAlexW2522282592WikidataQ59466318 ScholiaQ59466318MaRDI QIDQ311331
Baoguo Chen, Shaojun Pan, Chang-Feng Ma
Publication date: 29 September 2016
Published in: Journal of Inequalities and Applications (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1186/s13660-016-1174-1
Cites Work
- 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 feasible semismooth asymptotically Newton method for mixed complementarity problems
- The global linear convergence of an infeasible non-interior path-following algorithm for complementarity problems with uniform \(P\)-functions
- Feasible descent algorithms for mixed complementarity problems
- A nonsmooth version of Newton's method
- A New Nonsmooth Equations Approach to Nonlinear Complementarity Problems
- Optimization and nonsmooth analysis
- Computational complexity of LCPs associated with positive definite symmetric matrices
- Semismooth and Semiconvex Functions in Constrained Optimization
- Finite-Dimensional Variational Inequalities and Complementarity Problems
- Global Convergence Properties of Some Iterative Methods for Linear Complementarity Problems
- Strictly feasible equation-based methods for mixed complementarity problems
This page was built for publication: A modified feasible semi-smooth asymptotically Newton method for nonlinear complementarity problems