A class of simplicial restart fixed point algorithms without an extra dimension
From MaRDI portal
Cites work
- A Constructive Proof of the Brouwer Fixed-Point Theorem and Computational Results
- A linear selection algorithm for sets of elements with weights
- A new subdivision for computing fixed points with a homotopy algorithm
- A restart algorithm for computing fixed points without an extra dimension
- A variable-dimension simplicial algorithm for antipodal fixed-point theorems
- An improvement of fixed point algorithms by using a good triangulation
- Homotopies for computation of fixed points
- Homotopies for computation of fixed points on unbounded regions
- scientific article; zbMATH DE number 3700117 (Why is no real title available?)
- scientific article; zbMATH DE number 3728015 (Why is no real title available?)
- scientific article; zbMATH DE number 3728016 (Why is no real title available?)
- scientific article; zbMATH DE number 3487169 (Why is no real title available?)
- scientific article; zbMATH DE number 3619646 (Why is no real title available?)
- Improving the convergence of fixed-point algorithms
- On the Convergence Rate of Algorithms for Solving Equations that are Based on Methods of Complementary Pivoting
- Sandwich method for finding fixed points
- The Approximation of Fixed Points of a Continuous Mapping
- The computation of fixed points and applications
Cited in
(29)- A discrete multivariate mean value theorem with applications
- A simplicial approach for discrete fixed point theorems
- Simplicial zero-point algorithms: A unifying description
- An algorithm for the linear complementarity problem with upper and lower bounds
- A lexicographic algebraic theorem and its applications
- A simplicial homotopy algorithm for computing zero points on polytopes
- A better triangulation for Wright's \(2^n\)-ray algorithm
- Computing integral solutions of complementarity problems
- Solving discrete zero point problems
- On the stability of finding approximate fixed points by simplicial methods
- On the existence and approximation of zeroes
- A unified approach to the implementation of several restart fixed point algorithms and a new variable dimension algorithm
- J': A New Triangulation of R^n
- A variable dimension fixed point algorithm and the orientation of simplices
- Simplicial approximation of solutions to the nonlinear complementarity problem with lower and upper bounds
- A new subdivision for computing fixed points with a homotopy algorithm
- The octahedral algorithm, a new simplicial fixed point algorithm
- An efficient simplicial algorithm for computing a zero of a convex union of smooth functions
- A new variable dimension algorithm for the fixed point problem
- A new simplicial variable dimension algorithm to find equilibria on the product space of unit simplices
- Variable dimension algorithms: Basic theory, interpretations and extensions of some existing methods
- On the computational complexity of piecewise-linear homotopy algorithms
- On finding large sets of rewards in two-player ETP-ESP games
- Efficiency and implementation of simplicial zero point algorithms
- Computing an integer point of a class of convex sets.
- Computing an integer point of a simplex with an arbitrary starting homotopy-like simplicial algorithm
- Solving discrete systems of nonlinear equations
- Extended antipodal theorems
- Combinatorial integer labeling theorems on finite sets with applications
This page was built for publication: A class of simplicial restart fixed point algorithms without an extra dimension
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3883945)
