IMPROVING THE COMPUTATIONAL EFFICIENCY OF FIXED POINT ALGORITHMS
From MaRDI portal
Publication:3313639
Recommendations
- scientific article; zbMATH DE number 4205881
- Improvement of fixed point algorithms from a triangulation
- The optimization of fixed point methods
- scientific article; zbMATH DE number 1785940
- An improvement to the fixed point iterative method
- Improving the complexities of approximation algorithms for optimization problems
- Fast Algorithms for Compact Fixed Point Problems with Inexact Function Evaluations
- On iterative computation of fixed points and optimization
- Abstract fixpoint computations with numerical acceleration methods
- Iterative methods for fixed point problems on high performance computing environment
Cited in
(7)- An improved algorithm for the evaluation of fixpoint expressions
- A unifying model based on retraction for fixed point algorithms
- scientific article; zbMATH DE number 4013879 (Why is no real title available?)
- A unified approach to the implementation of several restart fixed point algorithms and a new variable dimension algorithm
- A tighter bound for FFd algorithm
- Improving the efficiency of non-deterministic computations
- A general method to speed up fixed-parameter-tractable algorithms
This page was built for publication: IMPROVING THE COMPUTATIONAL EFFICIENCY OF FIXED POINT ALGORITHMS
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3313639)