On Extending Some Wide-neighborhood Interior Point Algorithms From Linear Programming To Linear Complementarity Problems
DOI10.20454/JMMNM.2012.67zbMath1401.90123OpenAlexW2265062051MaRDI QIDQ5744959
Publication date: 10 February 2016
Published in: Journal of Modern Methods in Numerical Mathematics (Search for Journal in Brave)
Full work available at URL: https://semanticscholar.org/paper/7683482df5e77ad6b74b568f5abfadaad9ecb06f
Abstract computational complexity for mathematical programming problems (90C60) Special problems of linear programming (transportation, multi-index, data envelopment analysis, etc.) (90C08) Complementarity and equilibrium problems and variational inequalities (finite dimensions) (aspects of mathematical programming) (90C33) Interior-point methods (90C51)
This page was built for publication: On Extending Some Wide-neighborhood Interior Point Algorithms From Linear Programming To Linear Complementarity Problems
