On triangulations for computing fixed points
From MaRDI portal
Publication:4132260
DOI10.1007/BF01580679zbMATH Open0358.90047OpenAlexW2012044034MaRDI QIDQ4132260FDOQ4132260
Authors: Michael J. Todd
Publication date: 1976
Published in: Mathematical Programming (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/bf01580679
Numerical mathematical programming methods (65K05) Integer programming (90C10) Polytopes and polyhedra (52Bxx) Fixed-point theorems (47H10)
Cites Work
- The Approximation of Fixed Points of a Continuous Mapping
- Some Combinatorial Lemmas in Topology
- Title not available (Why is that?)
- Sandwich method for finding fixed points
- Homotopies for computation of fixed points
- Title not available (Why is that?)
- Homotopies for computation of fixed points on unbounded regions
Cited In (23)
- Triangulations for the cube
- ‘Fat’ triangulations, or solving certain nonconvex matrix optimization problems
- The \(D_ 2\)-triangulation for simplicial homotopy algorithms for computing solutions of nonlinear equations
- \(D_ 3\)-triangulation for simplicial deformation algorithms for computing solutions of nonlinear equations
- On the connectedness of the set of almost complementary paths of a linear complementarity problem
- Rudiments of an average case complexity theory for piecewise-linear path following algorithms
- Another note on bimatrix games
- Bimatrix games—an addendum
- A PL homotopy for finding all the roots of a polynomial
- On parametric nonlinear programming
- A modification of todd's triangulationJ 3
- An improvement of fixed point algorithms by using a good triangulation
- Permutation congruent transformations of the freudenthal triangulation with minimum surface density
- $J'$: A New Triangulation of $R^n $
- Homeomorphisms of triangulations with applications to computing fixed points
- \(\tilde K'_ 3\)- A new triangulation of \(R^ n\)
- A variable rate refining triangulation
- A quadratically-convergent fixed-point algorithm for economic equilibria and linearly constrained optimization
- Decomposability in fixed point computation with applications and acceleration techniques
- Computation of the Nash equilibrium selected by the tracing procedure in \(N\)-person games
- A better triangulation for Wright's \(2^n\)-ray algorithm
- Exploiting structure in piecewise-linear homotopy algorithms for solving equations
- Parametric fixed point algorithms with applications to economic policy analysis
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)