An (m+1)-step iterative method of convergence order (m+2) for linear complementarity problems. An (m+1)-step iterative method for LCPs

DOI10.1007/S12190-016-1006-YMaRDI QIDQ1676985zbMATH OpenOpenAlexFDO

Authors Youssef EL Foutayeni, Hicham EL Bouanani, Mohamed Khaladi

Publication date 10 November 2017

Published in Journal of Applied Mathematics and Computing (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/s12190-016-1006-y

zbMATH Keywords

linear complementarity problemsystem of non-linear equationssequence of smooth functions\((m+1)\)-step iterative method\((m+2)\) order method

Mathematics Subject Classification ID

Linear programming (90C05) Nonlinear programming (90C30) Interior-point methods (90C51) Complementarity and equilibrium problems and variational inequalities (finite dimensions) (aspects of mathematical programming) (90C33)

Recommendations

• An iterative two-step algorithm for linear complementarity problems
• scientific article; zbMATH DE number 30397
• scientific article; zbMATH DE number 2013209
• On the convergence of iterative methods for symmetric linear complementarity problems
• On the convergence analysis of two-step modulus-based matrix splitting iteration method for linear complementarity problems
• More results on the convergence of iterative methods for the symmetric linear complementarity problem
• Convergence of modulus-based multisplitting iteration methods for linear complementarity problems with \(M\)-matrices
• Improved convergence theorems of the two-step modulus-based matrix splitting and synchronous multisplitting iteration methods for solving linear complementarity problems
• An iterative scheme for generalized mildly nonlinear complementarity problems
• Iterative methods of solutions for linear and quasi-linear complementarity problems

Cites work

• scientific article; zbMATH DE number 6020688 (Why is no real title available?)
• scientific article; zbMATH DE number 4088853 (Why is no real title available?)
• scientific article; zbMATH DE number 53115 (Why is no real title available?)
• scientific article; zbMATH DE number 1821102 (Why is no real title available?)
• scientific article; zbMATH DE number 3312380 (Why is no real title available?)
• scientific article; zbMATH DE number 3195683 (Why is no real title available?)
• A Non-Interior-Point Continuation Method for Linear Complementarity Problems
• A Partition Theorem for Euclidean n-Space
• A cosh-based smoothing Newton method for \(P_{0}\) nonlinear complementarity problem
• An algorithm based on a sequence of linear complementarity problems applied to a walrasian equilibrium model: An example
• Bimatrix Equilibrium Points and Mathematical Programming
• Equivalence of LCP and PLS
• George B. Dantzig: a legendary life in mathematical programming
• NE/SQP: A robust algorithm for the nonlinear complementarity problem
• NP-completeness of the linear complementarity problem
• On the resolution of monotone complementarity problems
• Some Noninterior Continuation Methods for Linear Complementarity Problems
• The Approximation of Fixed Points of a Continuous Mapping
• The Solution of Systems of Piecewise Linear Equations
• Using vector divisions in solving the linear complementarity problem

Cited in

(4)

• A fixed point iterative method for third-order tensor linear complementarity problems
• Bioeconomic-epidemiological model of scomber colias population in the Moroccan coasts
• A dynamic model to solve weighted linear complementarity problems
• A fast algorithm for solving a class of the linear complementarity problem in a finite number of steps

This page was built for publication: An \((m+1)\)-step iterative method of convergence order \((m+2)\) for linear complementarity problems. An \((m+1)\)-step iterative method for LCPs

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1676985)