Pages that link to "Item:Q4184197"

The following pages link to Improving the convergence of fixed-point algorithms (Q4184197):

Displaying 25 items.

• Extended antipodal theorems (Q725874) (← links)
• Deforming subdivisions (Q919319) (← links)
• Generalizations of fixed point theorems and computation (Q1018311) (← links)
• The \((n+1)2^ m\)-ray algorithm: A new simplicial algorithm for the variational inequality problem on \(\mathbb{R}^ m_ +\times S^ n\) (Q1308654) (← links)
• A simplicial homotopy algorithm for computing zero points on polytopes (Q1335391) (← links)
• A better triangulation for Wright's \(2^n\)-ray algorithm (Q1365094) (← links)
• Some inequality techniques in handling fixed point problems on unbounded sets via homotopy methods (Q2067918) (← links)
• Computing integral solutions of complementarity problems (Q2427691) (← links)
• Solving discrete zero point problems (Q2494512) (← links)
• Permutation congruent transformations of the freudenthal triangulation with minimum surface density (Q3694571) (← links)
• ‘Fat’ triangulations, or solving certain nonconvex matrix optimization problems (Q3716828) (← links)
• Simplicial approximation of solutions to the nonlinear complementarity problem with lower and upper bounds (Q3771993) (← links)
• A variable rate refining triangulation (Q3773705) (← links)
• A quadratically-convergent fixed-point algorithm for economic equilibria and linearly constrained optimization (Q3867585) (← links)
• Exploiting structure in piecewise-linear homotopy algorithms for solving equations (Q3872237) (← links)
• An improvement of fixed point algorithms by using a good triangulation (Q3872238) (← links)
• A class of simplicial restart fixed point algorithms without an extra dimension (Q3883945) (← links)
• A variable-dimension simplicial algorithm for antipodal fixed-point theorems (Q3906317) (← links)
• The octahedral algorithm, a new simplicial fixed point algorithm (Q3930548) (← links)
• An efficient simplicial algorithm for computing a zero of a convex union of smooth functions (Q3956756) (← links)
• Piecewise linear paths to minimize convex functions may not be monotonic (Q4196252) (← links)
• A new simplicial variable dimension algorithm to find equilibria on the product space of unit simplices (Q4726068) (← links)
• On the computational complexity of piecewise-linear homotopy algorithms (Q4749612) (← links)
• Solutions to the Minimum Variance Problem Using Delaunay Triangulation (Q5139666) (← links)
• Efficiency and implementation of simplicial zero point algorithms (Q5186644) (← links)