scientific article
From MaRDI portal
Publication:3224801
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
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
linear complementarity problemconvex quadratic programming with equilibrium constraintsinterior point algorithm Ymatrix symmetric and positive definite
Complementarity and equilibrium problems and variational inequalities (finite dimensions) (aspects of mathematical programming) (90C33) Interior-point methods (90C51)
Related Items (3)
A fast algorithm for solving a class of the linear complementarity problem in a finite number of steps ⋮ 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
This page was built for publication:
