Set-valued robust mappings and approximable mappings (Q1329307): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Created a new Item
 
Set OpenAlex properties.
 
(4 intermediate revisions by 3 users not shown)
Property / author
 
Property / author: Shuzhong Shi / rank
Normal rank
 
Property / reviewed by
 
Property / reviewed by: Lai-Jiu Lin / rank
Normal rank
 
Property / author
 
Property / author: Shuzhong Shi / rank
 
Normal rank
Property / reviewed by
 
Property / reviewed by: Lai-Jiu Lin / 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.1006/jmaa.1994.1176 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2031589929 / rank
 
Normal rank
links / mardi / namelinks / mardi / name
 

Latest revision as of 00:35, 20 March 2024

scientific article
Language Label Description Also known as
English
Set-valued robust mappings and approximable mappings
scientific article

    Statements

    Set-valued robust mappings and approximable mappings (English)
    0 references
    0 references
    0 references
    0 references
    23 November 1995
    0 references
    The second author recently proposed the concept of robustness of sets and functions for weakening the requirement of continuity of the objective functions and constraints in global optimization problems. In this paper the authors propose the concept of lower robustness and of lower approximation for a set-valued mapping and show that any lower approximating set-valued mapping is lower robust. This result extends a result of the same authors for robust mappings and approximating mappings. The authors also introduce the concept of in-lower approximable and bi-lower approximable for set-valued functions and establish their relationship. They demonstrate an interesting property of bi-robust single-valued mappings. They also present some in-lower-robust mapping theorems which are the counterparts of open or inverse (set-valued) mapping theorems. For the upper robustness and upper approximability of set-valued mapping they obtain similar results as in the lower robust and lower approximate cases.
    0 references
    fixed point theory
    0 references
    robustness of sets and functions
    0 references
    global optimization
    0 references
    lower robustness
    0 references
    0 references

    Identifiers