A new subdivision for computing fixed points with a homotopy algorithm

DOI10.1007/BF01581629zbMath0438.90104OpenAlexW2085626176MaRDI QIDQ3880620

Gerard van der Laan, Adolphus J. J. Talman

Publication date: 1980

Published in: Mathematical Programming (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/bf01581629

zbMATH Keywords

triangulationsconvergence ratehomotopy algorithmcomplementary pivotingcomputation of fixed pointscontinuous grid size refinementpiecewise linear approximation of fixed pointrestart methodsupper-semi- continuous correspondence

Mathematics Subject Classification ID

Numerical mathematical programming methods (65K05) Fixed-point and coincidence theorems (topological aspects) (54H25) Mathematical programming (90C99)

Related Items (10)

A continuous deformation algorithm for variational inequality problems on polytopes ⋮ A simplicial homotopy algorithm for computing zero points on polytopes ⋮ Parametric fixed point algorithms with applications to economic policy analysis ⋮ A variable rate refining triangulation ⋮ Deforming subdivisions ⋮ The \(D_ 2\)-triangulation for simplicial homotopy algorithms for computing solutions of nonlinear equations ⋮ Computation of the Nash equilibrium selected by the tracing procedure in \(N\)-person games ⋮ An improvement of fixed point algorithms by using a good triangulation ⋮ A class of simplicial restart fixed point algorithms without an extra dimension ⋮ \(D_ 3\)-triangulation for simplicial deformation algorithms for computing solutions of nonlinear equations

Cites Work

• Unnamed Item
• Sandwich method for finding fixed points
• The computation of fixed points and applications
• A linear selection algorithm for sets of elements with weights
• Some Combinatorial Lemmas in Topology
• An improvement of fixed point algorithms by using a good triangulation
• A class of simplicial restart fixed point algorithms without an extra dimension
• On the Convergence Rate of Algorithms for Solving Equations that are Based on Methods of Complementary Pivoting
• Efficient Acceleration Techniques for Fixed Point Algorithms
• 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

This page was built for publication: A new subdivision for computing fixed points with a homotopy algorithm