An improvement of fixed point algorithms by using a good triangulation
From MaRDI portal
Cites work
- A Constructive Proof of the Brouwer Fixed-Point Theorem and Computational Results
- A new subdivision for computing fixed points with a homotopy algorithm
- A restart algorithm for computing fixed points without an extra dimension
- 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?)
- Improving the convergence of fixed-point algorithms
- On triangulations for computing fixed points
- Sandwich method for finding fixed points
- Some Combinatorial Lemmas in Topology
- The Approximation of Fixed Points of a Continuous Mapping
Cited in
(12)- Simplicial zero-point algorithms: A unifying description
- Simplicial pivoting for mesh generation of implicitly defined surfaces
- J': A New Triangulation of R^n
- Permutation congruent transformations of the freudenthal triangulation with minimum surface density
- ‘Fat’ triangulations, or solving certain nonconvex matrix optimization problems
- The (2 n+1−2)-ray algorithm: A new simplicial algorithm to compute economic equilibria
- A quadratically-convergent fixed-point algorithm for economic equilibria and linearly constrained optimization
- A new subdivision for computing fixed points with a homotopy algorithm
- A class of simplicial restart fixed point algorithms without an extra dimension
- Note on the path following approach of equilibrium programming
- A new simplicial variable dimension algorithm to find equilibria on the product space of unit simplices
- Efficiency and implementation of simplicial zero point algorithms
This page was built for publication: An improvement of fixed point algorithms by using a good triangulation
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3872238)
