Some nonlinear problems are as easy as the approximation problem (Q2266192): Difference between revisions
From MaRDI portal
Changed an Item |
Created claim: Wikidata QID (P12): Q126550503, #quickstatements; #temporary_batch_1729946815562 |
||
Property / Wikidata QID | |||
Property / Wikidata QID: Q126550503 / rank | |||
Normal rank |
Latest revision as of 13:56, 26 October 2024
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | Some nonlinear problems are as easy as the approximation problem |
scientific article |
Statements
Some nonlinear problems are as easy as the approximation problem (English)
0 references
1984
0 references
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.
0 references
optimal information
0 references
nearly optimal information
0 references
nearly optimal algorithms
0 references
optimal algorithms
0 references