Mathematical Research Data Initiative
Main page
Recent changes
Random page
SPARQL
MaRDI@GitHub
Special pages
In other projects
MaRDI portal item
Discussion
View source
View history
Purge
English
Log in

IMPROVING THE COMPUTATIONAL EFFICIENCY OF FIXED POINT ALGORITHMS

From MaRDI portal
Publication:3313639
Jump to:navigation, search

DOI10.15807/JORSJ.27.59zbMath0531.90084OpenAlexW2730709756MaRDI QIDQ3313639

Kojima, Masakazu, 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

fixed point algorithmsapproximating solutionscomplementarity 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)








This page was built for publication: IMPROVING THE COMPUTATIONAL EFFICIENCY OF FIXED POINT ALGORITHMS

Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Publication:3313639&oldid=16545083"
Tools
What links here
Related changes
Printable version
Permanent link
Page information
This page was last edited on 4 February 2024, at 13:44.
Privacy policy
About MaRDI portal
Disclaimers
Imprint
Powered by MediaWiki