A note on the complexity of fixed-point computation for noncontractive maps

MaRDI QIDQ2743979zbMATH OpenFDO

Authors C. W. Tsay, K. Sikorski

Publication date 18 September 2001

Mathematics Subject Classification ID

Abstract computational complexity for mathematical programming problems (90C60)

This page was built for publication: A note on the complexity of fixed-point computation for noncontractive maps

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2743979)