IDEAS home Printed from https://ideas.repec.org/a/eee/matcom/v245y2026icp325-336.html

Multivalued extension of the Caristi-type theorem in semi-metric spaces and its numerical simulation

Author

Listed:
  • Debnath, Pradip

Abstract

We present a novel extension of the Caristi-type fixed point theorem recently established by Zubelevich (2025) for single-valued mappings on complete semi-metric spaces to the multivalued setting. Specifically, we prove that, in a complete semi-metric space R, if a set-valued mapping F:R→2R satisfies a generalized Caristi-type inequality involving a family of lower semi-continuous, bounded-from-below functions and a semi-metric structure, then F admits a fixed point. Our approach constructs a suitable selection from the multivalued map and applies Zubelevich’s partial order method in conjunction with Zorn’s lemma to ensure the existence of a fixed point. Furthermore, we establish a multivalued counterpart to Zubelevich’s noncompactness theorem: if one of the associated potential functions fails to attain its minimum, then the fixed point set of F is necessarily noncompact. These results provide the first known multivalued Caristi-type fixed point framework for semi-metric spaces, unifying and generalizing prior work in both metric and topological vector space settings. The results are further validated by a numerical simulation showing convergence of iterates under deterministic selections.

Suggested Citation

  • Debnath, Pradip, 2026. "Multivalued extension of the Caristi-type theorem in semi-metric spaces and its numerical simulation," Mathematics and Computers in Simulation (MATCOM), Elsevier, vol. 245(C), pages 325-336.
  • Handle: RePEc:eee:matcom:v:245:y:2026:i:c:p:325-336
    DOI: 10.1016/j.matcom.2026.01.026
    as

    Download full text from publisher

    File URL: http://www.sciencedirect.com/science/article/pii/S0378475426000261
    Download Restriction: Full text for ScienceDirect subscribers only

    File URL: https://libkey.io/10.1016/j.matcom.2026.01.026?utm_source=ideas
    LibKey link: if access is restricted and if your library uses this service, LibKey will redirect you to where you can use your library subscription to access this item
    ---><---

    As the access to this document is restricted, you may want to

    for a different version of it.

    More about this item

    Keywords

    ;
    ;
    ;
    ;
    ;

    Statistics

    Access and download statistics

    Corrections

    All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:eee:matcom:v:245:y:2026:i:c:p:325-336. See general information about how to correct material in RePEc.

    If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.

    We have no bibliographic references for this item. You can help adding them by using this form .

    If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your RePEc Author Service profile, as there may be some citations waiting for confirmation.

    For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: Catherine Liu (email available below). General contact details of provider: http://www.journals.elsevier.com/mathematics-and-computers-in-simulation/ .

    Please note that corrections may take a couple of weeks to filter through the various RePEc services.

    IDEAS is a RePEc service. RePEc uses bibliographic data supplied by the respective publishers.