scientific article; zbMATH DE number 6020688
zbMATH Open1263.90099MaRDI QIDQ3224801FDOQ3224801
Authors: Youssef EL Foutayeni, Mohamed Khaladi 
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 of this publication is not available (Why is that?)
Recommendations
- A new interior point method for nonlinear complementarity problem
- An interior point method for the nonlinear complementarity problem
- A new infeasible interior-point algorithm for linear complementarity problem
- scientific article; zbMATH DE number 1326028
- An interior point method for solving monotone linear complementarity problem
- A unified approach to interior point algorithms for linear complementary problems
- A combined homotopy interior point method for the linear complementarity problem
- An interior point potential reduction algorithm for the linear complementarity problem
- An interior point algorithm for mixed complementarity nonlinear problems
- New interior point algorithms in linear programming
linear complementarity problemconvex quadratic programming with equilibrium constraintsinterior point algorithm Ymatrix symmetric and positive definite
Interior-point methods (90C51) Complementarity and equilibrium problems and variational inequalities (finite dimensions) (aspects of mathematical programming) (90C33)
Cited In (12)
- Title not available (Why is that?)
- On the convergence of an iterative method for solving linear complementarity problem with WGPSBD matrix
- On hidden \(Z\)-matrix and interior point algorithm
- A unified approach to interior point algorithms for linear complementary problems
- Weighted LCPs and interior point systems for copositive linear transformations on Euclidean Jordan algebras
- Using vector divisions in solving the linear complementarity problem
- A new approach for solving an optimization problem
- 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
- An interior point approach for linear complementarity problem using new parametrized kernel function
- Polynomial interior point algorithms for general linear complementarity problems
- Comparative study between Lemke's method and the interior point method for the monotone linear complementarity problem
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3224801)
