A quadratically convergent algorithm for the generalized linear complementarity problem
DOI10.12988/IMF.2007.07271zbMATH Open1141.65046OpenAlexW141192506MaRDI QIDQ5453883FDOQ5453883
Authors: Qingjun Ren, Hongchun Sun 
Publication date: 3 April 2008
Published in: International Mathematical Forum (Search for Journal in Brave)
Full work available at URL: https://semanticscholar.org/paper/ec8048a3139b550d9aa2ede5ba8188cdecb141da
Recommendations
- scientific article; zbMATH DE number 2141105
- A smoothing quasi-Newton method for generalized nonlinear complementarity problems
- A New Nonsmooth Equations Approach to Nonlinear Complementarity Problems
- Generalized Newton method for a kind of complementarity problem
- A Newton-type algorithm for generalized linear complementarity problem over a polyhedral cone
convergencealgorithmLevenberg-Marquardt methodstationary pointquadratic convergencegeneralized linear complementarity problem
Numerical mathematical programming methods (65K05) Complementarity and equilibrium problems and variational inequalities (finite dimensions) (aspects of mathematical programming) (90C33)
Cited In (7)
- A quadratically nonsmooth convergent algorithm for the horizontal linear complementarity problem
- Title not available (Why is that?)
- Title not available (Why is that?)
- A Newton-type algorithm for generalized linear complementarity problem over a polyhedral cone
- Algorithms for the generalized quadratic assignment problem combining Lagrangean decomposition and the reformulation-linearization technique
- A sequential linear programming method for generalized linear complementarity problem
- A global \(\mathbb{R}\)-linear convergence algorithm for the generalized linear complementarity problem over a closed convex cone
This page was built for publication: A quadratically convergent algorithm for the generalized linear complementarity problem
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5453883)
