A least-change secant algorithm for solving generalized complementarity problem
From MaRDI portal
Cites work
- A Class of Methods for Solving Nonlinear Simultaneous Equations
- A new class of semismooth Newton-type methods for nonlinear complementarity problems
- A new smoothing quasi-Newton method for nonlinear complementarity problems
- A New Sparsity Preserving Quasi-Newton Update for Solving Nonlinear Equations
- A Newton method for a class of quasi-variational inequalities
- A nonsmooth global quasi-Newton method for nonlinear complementarity problems
- A nonsmooth Newton method for solving the generalized complementarity problem
- A semismooth equation approach to the solution of nonlinear complementarity problems
- A Trust Region Method for Solving Generalized Complementarity Problems
- Convergence Analysis of Some Algorithms for Solving Nonsmooth Equations
- Convergence Theory of Nonlinear Newton–Krylov Algorithms
- Generalized Newton method for a kind of complementarity problem
- scientific article; zbMATH DE number 852532 (Why is no real title available?)
- Local Convergence Theory of Inexact Newton Methods Based on Structured Least Change Updates
- Modification of a Quasi-Newton Method for Nonlinear Equations with a Sparse Jacobian
- On the local convergence of quasi-Newton methods for nonlinear complementarity problems
- On the Relation between Two Local Convergence Theories of Least-Change Secant Update Methods
This page was built for publication: A least-change secant algorithm for solving generalized complementarity problem
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6992070)