The \((n+1)2^ m\)-ray algorithm: A new simplicial algorithm for the variational inequality problem on \(\mathbb{R}^ m_ +\times S^ n\)
The authors propose a variable dimension simplicial algorithm for solving a variational inequality problem. The algorithm is based on linear programming pivot operations. A condition of finite termination is given.
scientific article; zbMATH DE number 464839