Improving the convergence of fixed-point algorithms
From MaRDI portal
Publication:4184197
DOI10.1007/BFb0120788zbMath0399.65034MaRDI QIDQ4184197
Publication date: 1978
Published in: Mathematical Programming Studies (Search for Journal in Brave)
EfficiencyFixed-Point AlgorithmsMeasures for TriangulationsThree Test ProblemsTriangulations Of the N-Simplex
Numerical computation of solutions to systems of equations (65H10) Fixed-point theorems (47H10) Algorithms for approximation of functions (65D15)
Related Items (25)
A simplicial homotopy algorithm for computing zero points on polytopes ⋮ ‘Fat’ triangulations, or solving certain nonconvex matrix optimization problems ⋮ A better triangulation for Wright's \(2^n\)-ray algorithm ⋮ Simplicial approximation of solutions to the nonlinear complementarity problem with lower and upper bounds ⋮ A variable rate refining triangulation ⋮ Computing integral solutions of complementarity problems ⋮ Deforming subdivisions ⋮ Solutions to the Minimum Variance Problem Using Delaunay Triangulation ⋮ Solving discrete zero point problems ⋮ Efficiency and implementation of simplicial zero point algorithms ⋮ A quadratically-convergent fixed-point algorithm for economic equilibria and linearly constrained optimization ⋮ Exploiting structure in piecewise-linear homotopy algorithms for solving equations ⋮ An improvement of fixed point algorithms by using a good triangulation ⋮ Extended antipodal theorems ⋮ A class of simplicial restart fixed point algorithms without an extra dimension ⋮ Generalizations of fixed point theorems and computation ⋮ A variable-dimension simplicial algorithm for antipodal fixed-point theorems ⋮ Piecewise linear paths to minimize convex functions may not be monotonic ⋮ Some inequality techniques in handling fixed point problems on unbounded sets via homotopy methods ⋮ A new simplicial variable dimension algorithm to find equilibria on the product space of unit simplices ⋮ The octahedral algorithm, a new simplicial fixed point algorithm ⋮ On the computational complexity of piecewise-linear homotopy algorithms ⋮ The \((n+1)2^ m\)-ray algorithm: A new simplicial algorithm for the variational inequality problem on \(\mathbb{R}^ m_ +\times S^ n\) ⋮ An efficient simplicial algorithm for computing a zero of a convex union of smooth functions ⋮ Permutation congruent transformations of the freudenthal triangulation with minimum surface density
This page was built for publication: Improving the convergence of fixed-point algorithms
