On convex feasibility problems

L Maruster*, S Maruster

*Corresponding author for this work

    Research output: Chapter in Book/Report/Conference proceedingConference contributionAcademicpeer-review

    Abstract

    In this paper we consider a projection method for convex feasibility problem that is known to converge only weakly. Exploiting a property concerning the intersection of a family of convex closed sets, we present a condition that makes them strongly convergent, without additional assumptions.

    AMS Subject Classification: Primary: (K5J15, 47N10, secondary 41a29, 47H05.

    Original languageEnglish
    Title of host publicationITI 2004: PROCEEDINGS OF THE 26TH INTERNATIONAL CONFERENCE ON INFORMATION TECHNOLOGY INTERFACES
    Place of PublicationZagreb
    PublisherUNIV ZAGREB, FACULTY MECHANICAL ENGINEERING & NAVAL ARCHITECTURE
    Pages669-672
    Number of pages4
    ISBN (Print)953-96769-9-1
    Publication statusPublished - 2004
    Event26th International Conference on Information Technology Interfaces - , Croatia
    Duration: 7-Jun-200410-Jun-2004

    Other

    Other26th International Conference on Information Technology Interfaces
    Country/TerritoryCroatia
    Period07/06/200410/06/2004

    Keywords

    • convex feasibility
    • projection methods
    • weak and strong convergence
    • SUCCESSIVE APPROXIMATIONS
    • HILBERT-SPACES
    • CONVERGENCE
    • POINTS

    Fingerprint

    Dive into the research topics of 'On convex feasibility problems'. Together they form a unique fingerprint.

    Cite this