Publication:3224801
From MaRDI portal
zbMath1263.90099MaRDI QIDQ3224801
Mohamed Khaladi, Youssef EL Foutayeni
Publication date: 2 April 2012
Full work available at URL: http://www.m-hikari.com/ams/ams-2010/ams-65-68-2010/index.html
linear complementarity problem; convex quadratic programming with equilibrium constraints; interior point algorithm Y; matrix symmetric and positive definite
90C33: Complementarity and equilibrium problems and variational inequalities (finite dimensions) (aspects of mathematical programming)
90C51: Interior-point methods
Related Items
An \((m+1)\)-step iterative method of convergence order \((m+2)\) for linear complementarity problems. An \((m+1)\)-step iterative method for LCPs, Using vector divisions in solving the linear complementarity problem, A fast algorithm for solving a class of the linear complementarity problem in a finite number of steps