A Modified Integer Labeling for Complementarity Algorithms
DOI10.1287/MOOR.6.1.129zbMATH Open0496.90077OpenAlexW2039270674MaRDI QIDQ3960486FDOQ3960486
Authors: Peter M. Reiser 
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)
Cited In (13)
- Combinatorial integer labeling theorems on finite sets with applications
- Solving discrete zero point problems
- An algorithm for the linear complementarity problem with upper and lower bounds
- A new variable dimension algorithm for the fixed point problem
- $J'$: A New Triangulation of $R^n $
- Efficiency and implementation of simplicial zero point algorithms
- On the existence and approximation of zeroes
- Solving discrete systems of nonlinear equations
- A discrete multivariate mean value theorem with applications
- Simplicial zero-point algorithms: A unifying description
- Variable dimension algorithms: Basic theory, interpretations and extensions of some existing methods
- A unified approach to the implementation of several restart fixed point algorithms and a new variable dimension algorithm
- Parametric fixed point algorithms with applications to economic policy analysis
This page was built for publication: A Modified Integer Labeling for Complementarity Algorithms
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3960486)
