
doi: 10.1007/bf02878714
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
polynomial-time complexity, uniform \(P\)-function, infeasible-interior-point algorithm, complementarity problem, Interior-point methods, Abstract computational complexity for mathematical programming problems, Complementarity and equilibrium problems and variational inequalities (finite dimensions) (aspects of mathematical programming)
polynomial-time complexity, uniform \(P\)-function, infeasible-interior-point algorithm, complementarity problem, Interior-point methods, Abstract computational complexity for mathematical programming problems, Complementarity and equilibrium problems and variational inequalities (finite dimensions) (aspects of mathematical programming)
| selected citations These citations are derived from selected sources. This is an alternative to the "Influence" indicator, which also reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically). | 2 | |
| popularity This indicator reflects the "current" impact/attention (the "hype") of an article in the research community at large, based on the underlying citation network. | Average | |
| influence This indicator reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically). | Average | |
| impulse This indicator reflects the initial momentum of an article directly after its publication, based on the underlying citation network. | Average |
