A quadratically convergent algorithm for the generalized linear complementarity problem
From MaRDI portal
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
Cited in
(7)- A Newton-type algorithm for generalized linear complementarity problem over a polyhedral cone
- A global \(\mathbb{R}\)-linear convergence algorithm for the generalized linear complementarity problem over a closed convex cone
- A quadratically nonsmooth convergent algorithm for the horizontal linear complementarity problem
- A sequential linear programming method for generalized linear complementarity problem
- scientific article; zbMATH DE number 2013209 (Why is no real title available?)
- scientific article; zbMATH DE number 2141105 (Why is no real title available?)
- Algorithms for the generalized quadratic assignment problem combining Lagrangean decomposition and the reformulation-linearization technique
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)