A Feasible Semismooth Gauss-Newton Method for Solving a Class of SLCPs
From MaRDI portal
Publication:4900532
DOI10.4208/JCM.1107-M3559zbMATH Open1265.90309OpenAlexW3141010354MaRDI QIDQ4900532FDOQ4900532
Authors: Changfeng Ma 
Publication date: 24 January 2013
Published in: Journal of Computational Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.4208/jcm.1107-m3559
Recommendations
- Feasible semismooth Newton method for a class of stochastic linear complementarity problems
- Semismooth Newton methods for solving semi-infinite programming problems
- A semismooth Newton method for nonlinear symmetric cone programming
- A smoothing Gauss-Newton method for the generalized HLCP
- A feasible semismooth asymptotically Newton method for mixed complementarity problems
- An Asymptotically Superlinearly Convergent Semismooth Newton Augmented Lagrangian Method for Linear Programming
- scientific article; zbMATH DE number 5583532
- Semismooth Newton method for quadratic programs with bound constraints
- A smoothing Newton method for semi-infinite programming
- Semismooth Newton Schwarz iterative methods for the linear complementarity problem
Numerical mathematical programming methods (65K05) Complementarity and equilibrium problems and variational inequalities (finite dimensions) (aspects of mathematical programming) (90C33)
Cited In (4)
- A smoothing Gauss-Newton method for the generalized HLCP
- A smoothing Newton method for solving a class of stochastic linear complementarity problems
- Feasible semismooth Newton method for a class of stochastic linear complementarity problems
- Nonsmooth Levenberg-Marquardt type method for solving a class of stochastic linear complementarity problems with finitely many elements
This page was built for publication: A Feasible Semismooth Gauss-Newton Method for Solving a Class of SLCPs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4900532)
