Pages that link to "Item:Q3959753"
From MaRDI portal
The following pages link to A new variable dimension algorithm for the fixed point problem (Q3959753):
Displaying 13 items.
- Simplicial zero-point algorithms: A unifying description (Q1061618) (← links)
- A variable-dimension homotopy on networks for computing linear spatial equilibria (Q1077331) (← 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)
- Solving discrete zero point problems (Q2494512) (← links)
- A unifying model based on retraction for fixed point algorithms (Q3316473) (← links)
- Computational complexity of a piecewise linear homotopy algorithm (Q3321342) (← links)
- A unified approach to the implementation of several restart fixed point algorithms and a new variable dimension algorithm (Q3326743) (← links)
- A variable dimension fixed point algorithm and the orientation of simplices (Q3694554) (← links)
- Simplicial approximation of solutions to the nonlinear complementarity problem with lower and upper bounds (Q3771993) (← links)
- Efficiency and implementation of simplicial zero point algorithms (Q5186644) (← links)
- Computing an integer point of a class of convex sets. (Q5929418) (← links)
- Computing an integer point of a simplex with an arbitrary starting homotopy-like simplicial algorithm (Q5936075) (← links)
