A path-following algorithm for solving linear complementarity problems based on algebraically equivalent transformations
From MaRDI portal
Publication:5486903
zbMATH Open1115.90380MaRDI QIDQ5486903FDOQ5486903
Authors: Suyan He, Shaohua Pan, Xingsi Li, Hong-Wu Zhang 
Publication date: 15 September 2006
Recommendations
- New algorithm for \(P_*(k)\)-matrix linear complementarity problem based on algebraic transformation
- An infeasible interior point algorithm for \(P_0\)-LCP based on algebraic transformation
- An infeasible primal-dual interior point algorithm for linear programs based on logarithmic equivalent transformation
- Interior-point algorithm for sufficient LCPs based on the technique of algebraically equivalent transformation
- Interior-point algorithms for uniform \(P\)-function nonlinear complementary problem based on algebraically equivalent path
Interior-point methods (90C51) Complementarity and equilibrium problems and variational inequalities (finite dimensions) (aspects of mathematical programming) (90C33)
Cited In (4)
- A new primal-dual path-following interior-point algorithm for semidefinite optimization
- Interior-point algorithm for sufficient LCPs based on the technique of algebraically equivalent transformation
- An infeasible interior point algorithm for \(P_0\)-LCP based on algebraic transformation
- An \(O(n^ 3L)\) adaptive path following algorithm for a linear complementarity problem
This page was built for publication: A path-following algorithm for solving linear complementarity problems based on algebraically equivalent transformations
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5486903)
