Some nonlinear problems are as easy as the approximation problem (Q2266192)

In this paper we study the following problem. Given an operator S and a subset \(F_ 0\) of some linear space, approximate S(f) for any \(f\in F_ 0\) possessing only partial information on f. Although all operators S considered here are nonlinear (e.g. min f(x), min\(| f(x)|\), 1/f or \(\| f\|)\), we prove that these problems are ''equivalent'' to the problem of approximating \(S(f)=f\), i.e. \(S=I\). This equivalence provides optimal (or nearly optimal) information and algorithms.