Best proximity point theorems for probabilistic proximal cyclic contraction with applications in nonlinear programming (Q285874): Difference between revisions

From MaRDI portal
Created claim: Wikidata QID (P12): Q59431248, #quickstatements; #temporary_batch_1707216511891
ReferenceBot (talk | contribs)
Changed an Item
(2 intermediate revisions by 2 users not shown)
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.1186/s13663-015-0330-5 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W1608683381 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3336431 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Application of fixed point theorems to best simultaneous approximation in ordered semi-convex structure / rank
 
Normal rank
Property / cites work
 
Property / cites work: Fixed point theorems for compatible and subsequentially continuous mappings in Menger spaces / rank
 
Normal rank
Property / cites work
 
Property / cites work: Common coupled fixed point theorems for contractive mappings in fuzzy metric spaces / rank
 
Normal rank
Property / cites work
 
Property / cites work: Best proximity point theorems generalizing the contraction principle / rank
 
Normal rank

Revision as of 00:12, 12 July 2024

scientific article
Language Label Description Also known as
English
Best proximity point theorems for probabilistic proximal cyclic contraction with applications in nonlinear programming
scientific article

    Statements

    Best proximity point theorems for probabilistic proximal cyclic contraction with applications in nonlinear programming (English)
    0 references
    0 references
    19 May 2016
    0 references
    optimal approximate solution
    0 references
    fixed point
    0 references
    best proximity point
    0 references
    proximal contraction
    0 references
    proximal cyclic contraction
    0 references

    Identifiers

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