An improvement of fixed point algorithms by using a good triangulation

DOI10.1007/BF01588323zbMath0433.90089OpenAlexW1971176965MaRDI QIDQ3872238

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/bf01588323

zbMATH Keywords

triangulationcomputational experiencesimplicial subdivisionoptimal triangulationequilateral trianglesaverage directional densitycomputation of fixed pointsmeasures for triangulations

Mathematics Subject Classification ID

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

Related Items

Note on the path following approach of equilibrium programming, ‘Fat’ triangulations, or solving certain nonconvex matrix optimization problems, The (2 n+1−2)-ray algorithm: A new simplicial algorithm to compute economic equilibria, Simplicial pivoting for mesh generation of implicitly defined surfaces, $J'$: A New Triangulation of $R^n $, Efficiency and implementation of simplicial zero point algorithms, A quadratically-convergent fixed-point algorithm for economic equilibria and linearly constrained optimization, A new subdivision for computing fixed points with a homotopy algorithm, A class of simplicial restart fixed point algorithms without an extra dimension, A new simplicial variable dimension algorithm to find equilibria on the product space of unit simplices, Simplicial zero-point algorithms: A unifying description, Permutation congruent transformations of the freudenthal triangulation with minimum surface density

Cites Work

• Unnamed Item
• Sandwich method for finding fixed points
• Some Combinatorial Lemmas in Topology
• A new subdivision for computing fixed points with a homotopy algorithm
• A Constructive Proof of the Brouwer Fixed-Point Theorem and Computational Results
• On triangulations for computing fixed points
• Improving the convergence of fixed-point algorithms
• A restart algorithm for computing fixed points without an extra dimension
• Homotopies for computation of fixed points
• The Approximation of Fixed Points of a Continuous Mapping
• Homotopies for computation of fixed points on unbounded regions