Superlinearly convergent methods for solving a class of implicit complementarity problems based on sign analysis
DOI10.1007/S13160-020-00405-3zbMATH Open1437.65045OpenAlexW3004347486MaRDI QIDQ2174792FDOQ2174792
Publication date: 27 April 2020
Published in: Japan Journal of Industrial and Applied Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s13160-020-00405-3
sign patternhybrid methodimplicit complementarity problemmodulus-based matrix splitting iteration method
Iterative numerical methods for linear systems (65F10) Complementarity and equilibrium problems and variational inequalities (finite dimensions) (aspects of mathematical programming) (90C33) Global methods, including homotopy approaches to the numerical solution of nonlinear equations (65H20) Numerical solution of nonlinear eigenvalue and eigenvector problems (65H17)
Cites Work
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Modulus-based matrix splitting iteration methods for a class of nonlinear complementarity problem
- Modulus-based matrix splitting iteration methods for linear complementarity problems
- On the Convergence of the Multisplitting Methods for the Linear Complementarity Problem
- A nonsmooth version of Newton's method
- Leray--Schauder type alternatives, complementarity problems and variational inequalities
- On the convergence regions of generalized accelerated overrelaxation method for linear complementarity problems
- Fixed point approach for complementarity problems
- On the convergence of a basic iterative method for the implicit complementarity problem
- A relaxation modulus-based matrix splitting iteration method for solving linear complementarity problems
- Modified modulusโbased matrix splitting iteration methods for linear complementarity problems
- Modulus-based matrix splitting algorithms for the quasi-complementarity problems
- The modulus-based matrix splitting iteration methods for second-order cone linear complementarity problems
- On convergence of the modulus-based matrix splitting iteration method for horizontal linear complementarity problems of \(H_+\)-matrices
- Modulus-based matrix splitting iteration methods for a class of implicit complementarity problems
- Two-step modulus-based matrix splitting iteration methods for implicit complementarity problems
- Modulus-based matrix splitting methods for horizontal linear complementarity problems
- A modified modulus-based matrix splitting iteration method for solving implicit complementarity problems
- Modulus-based Synchronous Multisplitting Iteration Methods for an Implicit Complementarity Problem
- The relaxation convergence of multisplitting AOR method for linear complementarity problem
Cited In (4)
- The convergence of a modulus-based matrix splitting iteration method for solving the implicit complementarity problems
- Improved modulus-based matrix splitting iteration methods for a class of horizontal implicit complementarity problems
- A sign-based linear method for horizontal linear complementarity problems
- The convergence of modulus-based matrix splitting iteration methods for implicit complementarity problems
Recommendations
- The sign-based methods for solving a class of nonlinear complementarity problems ๐ ๐
- Superlinearly Convergent Algorithms for Solving Singular Equations and Smooth Reformulations of Complementarity Problems ๐ ๐
- A Superlinearly Convergent Method for a Class of Complementarity Problems with Non-Lipschitzian Functions ๐ ๐
- Superlinear convergence of an algorithm for monotone linear complementarity problems, when no strictly complementary solution exists ๐ ๐
- A superlinearly convergent SSLE algorithm for optimization problems with linear complementarity constraints ๐ ๐
- Title not available (Why is that?) ๐ ๐
- A superlinearly convergent method for the generalized complementarity problem over a polyhedral cone ๐ ๐
- A superlinearly convergent implicit smooth SQP algorithm for mathematical programs with nonlinear complementarity constraints ๐ ๐
- Superlinear Convergence of a Smooth Approximation Method for Mathematical Programs with Nonlinear Complementarity Constraints ๐ ๐
- A sign-based linear method for horizontal linear complementarity problems ๐ ๐
This page was built for publication: Superlinearly convergent methods for solving a class of implicit complementarity problems based on sign analysis
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2174792)