Some nonlinear problems are as easy as the approximation problem (Q2266192): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Created a new Item
 
Created claim: Wikidata QID (P12): Q126550503, #quickstatements; #temporary_batch_1729946815562
 
(8 intermediate revisions by 6 users not shown)
Property / DOI
 
Property / DOI: 10.1016/0898-1221(84)90063-4; 10.7916/D8765PGQ / rank
Normal rank
 
Property / author
 
Property / author: Grzegorz W. Wasilkowski / rank
Normal rank
 
Property / author
 
Property / author: Grzegorz W. Wasilkowski / rank
 
Normal rank
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1016/0898-1221(84)90063-4 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W1980738079 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4168841 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The optimal recovery of smooth functions / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3673103 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3883494 / rank
 
Normal rank
Property / DOI
 
Property / DOI: 10.1016/0898-1221(84)90063-4 / rank
 
Normal rank
Property / DOI
 
Property / DOI: 10.7916/D8765PGQ / rank
 
Normal rank
Property / Wikidata QID
 
Property / Wikidata QID: Q126550503 / rank
 
Normal rank
links / mardi / namelinks / mardi / name
 

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
    0 references
    0 references
    0 references

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references
    0 references