A Modified Integer Labeling for Complementarity Algorithms
From MaRDI portal
Publication:3960486
DOI10.1287/moor.6.1.129zbMath0496.90077OpenAlexW2039270674MaRDI QIDQ3960486
Publication date: 1981
Published in: Mathematics of Operations Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1287/moor.6.1.129
Numerical mathematical programming methods (65K05) Numerical computation of solutions to systems of equations (65H10) Complementarity and equilibrium problems and variational inequalities (finite dimensions) (aspects of mathematical programming) (90C33)
Related Items
Parametric fixed point algorithms with applications to economic policy analysis, An algorithm for the linear complementarity problem with upper and lower bounds, Solving discrete systems of nonlinear equations, On the existence and approximation of zeroes, A unified approach to the implementation of several restart fixed point algorithms and a new variable dimension algorithm, Combinatorial integer labeling theorems on finite sets with applications, $J'$: A New Triangulation of $R^n $, Solving discrete zero point problems, Efficiency and implementation of simplicial zero point algorithms, A discrete multivariate mean value theorem with applications, Variable dimension algorithms: Basic theory, interpretations and extensions of some existing methods, Simplicial zero-point algorithms: A unifying description, A new variable dimension algorithm for the fixed point problem
