On triangulations for computing fixed points
From MaRDI portal
Publication:4132260
Cites work
- scientific article; zbMATH DE number 3661134 (Why is no real title available?)
- scientific article; zbMATH DE number 3356498 (Why is no real title available?)
- Homotopies for computation of fixed points
- Homotopies for computation of fixed points on unbounded regions
- Sandwich method for finding fixed points
- Some Combinatorial Lemmas in Topology
- The Approximation of Fixed Points of a Continuous Mapping
Cited in
(23)- Parametric fixed point algorithms with applications to economic policy analysis
- On the connectedness of the set of almost complementary paths of a linear complementarity problem
- \(\tilde K'_ 3\)- A new triangulation of \(R^ n\)
- Bimatrix games—an addendum
- An improvement of fixed point algorithms by using a good triangulation
- A better triangulation for Wright's \(2^n\)-ray algorithm
- A quadratically-convergent fixed-point algorithm for economic equilibria and linearly constrained optimization
- Triangulations for the cube
- Homeomorphisms of triangulations with applications to computing fixed points
- Permutation congruent transformations of the freudenthal triangulation with minimum surface density
- A modification of todd's triangulationJ 3
- ‘Fat’ triangulations, or solving certain nonconvex matrix optimization problems
- The \(D_ 2\)-triangulation for simplicial homotopy algorithms for computing solutions of nonlinear equations
- A variable rate refining triangulation
- Exploiting structure in piecewise-linear homotopy algorithms for solving equations
- $J'$: A New Triangulation of $R^n $
- Decomposability in fixed point computation with applications and acceleration techniques
- Rudiments of an average case complexity theory for piecewise-linear path following algorithms
- A PL homotopy for finding all the roots of a polynomial
- On parametric nonlinear programming
- \(D_ 3\)-triangulation for simplicial deformation algorithms for computing solutions of nonlinear equations
- Computation of the Nash equilibrium selected by the tracing procedure in \(N\)-person games
- Another note on bimatrix games
This page was built for publication: On triangulations for computing fixed points
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4132260)