Pages that link to "Item:Q3930548"
From MaRDI portal
The following pages link to The octahedral algorithm, a new simplicial fixed point algorithm (Q3930548):
Displaying 22 items.
- Computation of the Nash equilibrium selected by the tracing procedure in \(N\)-person games (Q700098) (← links)
- The computation of quantity-constrained equilibria by virtual taxes (Q899859) (← links)
- A constructive proof of Ky Fan's coincidence theorem (Q1016124) (← links)
- Simplicial zero-point algorithms: A unifying description (Q1061618) (← links)
- An algorithm for the linear complementarity problem with upper and lower bounds (Q1106738) (← links)
- Some computational methods for systems of nonlinear equations and systems of polynomial equations (Q1201902) (← links)
- A lexicographic algebraic theorem and its applications (Q1307556) (← links)
- A simplicial homotopy algorithm for computing zero points on polytopes (Q1335391) (← links)
- A better triangulation for Wright's \(2^n\)-ray algorithm (Q1365094) (← links)
- Computing economic equilibria using benefit and surplus functions (Q1891391) (← links)
- A unified approach to the implementation of several restart fixed point algorithms and a new variable dimension algorithm (Q3326743) (← links)
- $J'$: A New Triangulation of $R^n $ (Q3330396) (← links)
- A variable dimension fixed point algorithm and the orientation of simplices (Q3694554) (← links)
- Permutation congruent transformations of the freudenthal triangulation with minimum surface density (Q3694571) (← links)
- ‘Fat’ triangulations, or solving certain nonconvex matrix optimization problems (Q3716828) (← links)
- Simplicial approximation of solutions to the nonlinear complementarity problem with lower and upper bounds (Q3771993) (← links)
- A variable rate refining triangulation (Q3773705) (← links)
- A new variable dimension algorithm for the fixed point problem (Q3959753) (← links)
- A new simplicial variable dimension algorithm to find equilibria on the product space of unit simplices (Q4726068) (← links)
- Variable dimension algorithms: Basic theory, interpretations and extensions of some existing methods (Q4749611) (← links)
- On the computational complexity of piecewise-linear homotopy algorithms (Q4749612) (← links)
- Efficiency and implementation of simplicial zero point algorithms (Q5186644) (← links)