A new subdivision for computing fixed points with a homotopy algorithm

DOI10.1007/BF01581629MaRDI QIDQ3880620zbMATH OpenOpenAlexFDO

Authors Gerard van der Laan, Dolf 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

complementary pivotingcomputation of fixed pointscontinuous grid size refinementconvergence ratehomotopy algorithmpiecewise linear approximation of fixed pointrestart methodstriangulationsupper-semi- continuous correspondence

Mathematics Subject Classification ID

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

Cites work

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

Cited in

(10)

• Parametric fixed point algorithms with applications to economic policy analysis
• \(D_ 3\)-triangulation for simplicial deformation algorithms for computing solutions of nonlinear equations
• A continuous deformation algorithm for variational inequality problems on polytopes
• A simplicial homotopy algorithm for computing zero points on polytopes
• A variable rate refining triangulation
• An improvement of fixed point algorithms by using a good triangulation
• A class of simplicial restart fixed point algorithms without an extra dimension
• 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
• Deforming subdivisions

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3880620)