The \((n+1)2^ m\)-ray algorithm: A new simplicial algorithm for the variational inequality problem on \(\mathbb{R}^ m_ +\times S^ n\)
DOI10.1007/BF02073592zbMath0804.90119OpenAlexW2056863167MaRDI QIDQ1308654
Zaifu Yang, Yoshitsugu Yamamoto
Publication date: 10 December 1993
Published in: Annals of Operations Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/bf02073592
Variational inequalities (49J40) Complementarity and equilibrium problems and variational inequalities (finite dimensions) (aspects of mathematical programming) (90C33) Computational methods for problems pertaining to operations research and mathematical programming (90-08)
Related Items (2)
Cites Work
- Unnamed Item
- Simplicial algorithm to solve the nonlinear complementarity problem on \(S^ n\times R^ m_ +\)
- General economic equilibrium and variational inequalities
- The (2 n+1−2)-ray algorithm: A new simplicial algorithm to compute economic equilibria
- A Simplicial Algorithm for Stationary Point Problems on Polytopes
- A Simplicial Algorithm for the Nonlinear Stationary Point Problem on an Unbounded Polyhedron
- Improving the convergence of fixed-point algorithms
- A restart algorithm for computing fixed points without an extra dimension
- An algorithm based on a sequence of linear complementarity problems applied to a walrasian equilibrium model: An example
- Variable dimension algorithms: Basic theory, interpretations and extensions of some existing methods
This page was built for publication: The \((n+1)2^ m\)-ray algorithm: A new simplicial algorithm for the variational inequality problem on \(\mathbb{R}^ m_ +\times S^ n\)