On triangulations for computing fixed points

DOI10.1007/BF01580679zbMath0358.90047OpenAlexW2012044034MaRDI QIDQ4132260

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

Mathematics Subject Classification ID

Numerical mathematical programming methods (65K05) Integer programming (90C10) Fixed-point theorems (47H10) Polytopes and polyhedra (52Bxx)

Related Items (23)

Parametric fixed point algorithms with applications to economic policy analysis ⋮ ‘Fat’ triangulations, or solving certain nonconvex matrix optimization problems ⋮ A better triangulation for Wright's \(2^n\)-ray algorithm ⋮ Rudiments of an average case complexity theory for piecewise-linear path following algorithms ⋮ Decomposability in fixed point computation with applications and acceleration techniques ⋮ A variable rate refining triangulation ⋮ \(\tilde K'_ 3\)- A new triangulation of \(R^ n\) ⋮ The \(D_ 2\)-triangulation for simplicial homotopy algorithms for computing solutions of nonlinear equations ⋮ Another note on bimatrix games ⋮ $J'$: A New Triangulation of $R^n $ ⋮ Computation of the Nash equilibrium selected by the tracing procedure in \(N\)-person games ⋮ On the connectedness of the set of almost complementary paths of a linear complementarity problem ⋮ Triangulations for the cube ⋮ On parametric nonlinear programming ⋮ A quadratically-convergent fixed-point algorithm for economic equilibria and linearly constrained optimization ⋮ Bimatrix games—an addendum ⋮ Exploiting structure in piecewise-linear homotopy algorithms for solving equations ⋮ An improvement of fixed point algorithms by using a good triangulation ⋮ A modification of todd's triangulationJ 3 ⋮ A PL homotopy for finding all the roots of a polynomial ⋮ Homeomorphisms of triangulations with applications to computing fixed points ⋮ \(D_ 3\)-triangulation for simplicial deformation algorithms for computing solutions of nonlinear equations ⋮ Permutation congruent transformations of the freudenthal triangulation with minimum surface density

Cites Work

• Sandwich method for finding fixed points
• Some Combinatorial Lemmas in Topology
• Homotopies for computation of fixed points
• The Approximation of Fixed Points of a Continuous Mapping
• Homotopies for computation of fixed points on unbounded regions
• Unnamed Item
• Unnamed Item

This page was built for publication: On triangulations for computing fixed points