IMPROVING THE COMPUTATIONAL EFFICIENCY OF FIXED POINT ALGORITHMS

DOI10.15807/JORSJ.27.59zbMATH Open0531.90084OpenAlexW2730709756MaRDI QIDQ3313639FDOQ3313639

Masakazu Kojima, Bing Yang

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

zbMATH Keywords

approximating solutionsfixed point algorithmscomplementarity theoryimprovement of computational efficiency

Mathematics Subject Classification ID

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 (4)

• Improving the efficiency of non-deterministic computations
• A tighter bound for FFd algorithm
• A general method to speed up fixed-parameter-tractable algorithms
• An improved algorithm for the evaluation of fixpoint expressions

Recommendations

• On iterative computation of fixed points and optimization 👍 👎
• Improving the complexities of approximation algorithms for optimization problems 👍 👎
• Abstract fixpoint computations with numerical acceleration methods 👍 👎
• An improvement to the fixed point iterative method 👍 👎
• Fast Algorithms for Compact Fixed Point Problems with Inexact Function Evaluations 👍 👎
• Iterative methods for fixed point problems on high performance computing environment 👍 👎
• Title not available (Why is that?) 👍 👎
• Title not available (Why is that?) 👍 👎
• Title not available (Why is that?) 👍 👎
• Title not available (Why is that?) 👍 👎

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)