Academic Commons


Some Nonlinear Problems Are as Easy as the Approximation Problem

Wasilkowski, Grzegorz W.

In this paper we study the following problem. Given an operator S and a subset F0 of some linear space, approximate S (f) for any f ∈ F0 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(j)=f. i.e. S=I. This equivalence provides optimal (or nearly optimal) information and algorithms.



More About This Work

Academic Units
Computer Science
Department of Computer Science, Columbia University
Columbia University Computer Science Technical Reports, CUCS-148-84
Published Here
February 23, 2012
Academic Commons provides global access to research and scholarship produced at Columbia University, Barnard College, Teachers College, Union Theological Seminary and Jewish Theological Seminary. Academic Commons is managed by the Columbia University Libraries.