IMPROVING THE COMPUTATIONAL EFFICIENCY OF FIXED POINT ALGORITHMS
DOI10.15807/JORSJ.27.59zbMATH Open0531.90084OpenAlexW2730709756MaRDI QIDQ3313639FDOQ3313639
Publication date: 1984
Published in: Journal of the Operations Research Society of Japan (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.15807/jorsj.27.59
Recommendations
- scientific article
- 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
approximating solutionsfixed point algorithmscomplementarity theoryimprovement of computational efficiency
Numerical mathematical programming methods (65K05) Nonlinear programming (90C30) Numerical computation of solutions to systems of equations (65H10) Fixed-point and coincidence theorems (topological aspects) (54H25)
Cited In (7)
- Improving the efficiency of non-deterministic computations
- A tighter bound for FFd algorithm
- A general method to speed up fixed-parameter-tractable algorithms
- Title not available (Why is that?)
- A unifying model based on retraction for fixed point algorithms
- A unified approach to the implementation of several restart fixed point algorithms and a new variable dimension algorithm
- An improved algorithm for the evaluation of fixpoint expressions
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)
