Pages that link to "Item:Q3883945"

The following pages link to A class of simplicial restart fixed point algorithms without an extra dimension (Q3883945):

Displaying 29 items.

• On the stability of finding approximate fixed points by simplicial methods (Q314957) (← links)
• Solving discrete systems of nonlinear equations (Q635151) (← links)
• Extended antipodal theorems (Q725874) (← links)
• Combinatorial integer labeling theorems on finite sets with applications (Q963665) (← links)
• A discrete multivariate mean value theorem with applications (Q1011164) (← links)
• A simplicial approach for discrete fixed point theorems (Q1014795) (← links)
• Simplicial zero-point algorithms: A unifying description (Q1061618) (← links)
• An algorithm for the linear complementarity problem with upper and lower bounds (Q1106738) (← 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 integral solutions of complementarity problems (Q2427691) (← links)
• Solving discrete zero point problems (Q2494512) (← links)
• On the existence and approximation of zeroes (Q3319694) (← 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)
• Simplicial approximation of solutions to the nonlinear complementarity problem with lower and upper bounds (Q3771993) (← links)
• A new subdivision for computing fixed points with a homotopy algorithm (Q3880620) (← links)
• The octahedral algorithm, a new simplicial fixed point algorithm (Q3930548) (← links)
• An efficient simplicial algorithm for computing a zero of a convex union of smooth functions (Q3956756) (← 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)
• On Finding Large Sets of Rewards in Two-Player ETP–ESP Games (Q5149575) (← 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)