Improving the convergence of fixed-point algorithms
From MaRDI portal
Cited in
(25)- Generalizations of fixed point theorems and computation
- The \((n+1)2^ m\)-ray algorithm: A new simplicial algorithm for the variational inequality problem on \(\mathbb{R}^ m_ +\times S^ n\)
- A simplicial homotopy algorithm for computing zero points on polytopes
- A better triangulation for Wright's \(2^n\)-ray algorithm
- Some inequality techniques in handling fixed point problems on unbounded sets via homotopy methods
- Computing integral solutions of complementarity problems
- Solving discrete zero point problems
- Permutation congruent transformations of the freudenthal triangulation with minimum surface density
- ‘Fat’ triangulations, or solving certain nonconvex matrix optimization problems
- Simplicial approximation of solutions to the nonlinear complementarity problem with lower and upper bounds
- A variable rate refining triangulation
- 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
- A class of simplicial restart fixed point algorithms without an extra dimension
- A variable-dimension simplicial algorithm for antipodal fixed-point theorems
- The octahedral algorithm, a new simplicial fixed point algorithm
- An efficient simplicial algorithm for computing a zero of a convex union of smooth functions
- Piecewise linear paths to minimize convex functions may not be monotonic
- A new simplicial variable dimension algorithm to find equilibria on the product space of unit simplices
- On the computational complexity of piecewise-linear homotopy algorithms
- Solutions to the Minimum Variance Problem Using Delaunay Triangulation
- Efficiency and implementation of simplicial zero point algorithms
- Extended antipodal theorems
- Deforming subdivisions
This page was built for publication: Improving the convergence of fixed-point algorithms
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4184197)
