Saturday, November 21, 2026
Science
No Result
View All Result
  • Login
  • HOME
  • SCIENCE NEWS
  • CONTACT US
  • HOME
  • SCIENCE NEWS
  • CONTACT US
No Result
View All Result
Scienmag
No Result
View All Result
Home Science News

Hybrid Projection Algorithm Resolves Best Proximity Points in Real Hilbert Spaces

November 21, 2026
in Science News
Reid Dalton
By Reid Dalton Scienmag Editorial Profile - Applied Mathematics
Reading Time: 6 mins read
0
Hybrid Projection Algorithm Resolves Best Proximity Points in Real Hilbert Spaces

Hybrid Projection Algorithm Resolves Best Proximity Points in Real Hilbert Spaces

65
SHARES
587
VIEWS
Share on FacebookShare on Twitter
ADVERTISEMENT

Researchers Saima Kanwal, Naeem Saleem, Mi Zhou, and Asima Razzaque have introduced a novel hybrid algorithm designed to locate the global minimum of best proximity points for a newly formulated class of mappings known as proximal b-enriched nonexpansive mappings. Published in the Journal of Inequalities and Applications, the theoretical investigation demonstrates rigorous mathematical conditions under which the proposed iterative sequence achieves strong convergence in real Hilbert spaces. In nonlinear functional analysis, finding such points serves as an essential optimization framework when exact fixed-point solutions do not exist across disjoint sets. By wedding enrichment techniques to geometric projection methods, the study provides theoretical existence guarantees and mathematical verification for solving complex constrained optimization problems.

Fixed-point theory serves as a fundamental mathematical apparatus for resolving nonlinear problems across fields including engineering, economics, physics, and biology. Many such physical and analytical problems translate into equations of the form where an operator acts on an element of a metric space to yield the identical element. The classic Banach contraction principle ensures that under a strict contraction mapping on a complete metric space, an iteration converges uniquely to a fixed point. However, when an operator maps a nonempty subset into a completely disjoint target set within the same space, the exact fixed-point equation cannot possess any conventional solution because the distance between an element and its image remains strictly positive. Consequently, the focus shifts toward identifying an optimal approximate solution that minimizes the metric distance between points and their mapped targets.

To address situations where fixed points cannot exist, Ky Fan established foundational best approximation theorems for continuous mappings on nonempty, compact, and convex subsets within linear normed spaces. Although best approximant points minimize the distance between a single point and a target set, they do not inherently provide a global optimum for the separation distance between two distinct sets under non-self mappings. Best proximity point theory was formulated precisely to resolve this challenge by seeking a specific element in the domain subset that attains the absolute infimum distance separating the domain and the codomain. Whenever the two underlying subsets intersect or coincide, every best proximity point naturally reduces to a classical fixed point, establishing best proximity theory as a natural generalization of metric fixed-point theory.

The study specifically builds upon the notion of enriched nonexpansive mappings, an approach introduced in metric fixed-point analysis by Vasile Berinde. An enriched mapping generalizes ordinary nonexpansiveness by incorporating an averaged structure involving an identity operator and a non-negative scalar parameter. Ordinary nonexpansive mappings satisfy the condition with this parameter set to zero, but enriching the mapping enables mathematicians to analyze broader, more flexible classes of continuous operators using averaged mappings. While Krasnoselskij iteration schemes have traditionally established convergence for enriched mappings under self-mapping conditions, extending such techniques to non-self mappings spanning separated subsets requires overcoming substantial analytical hurdles regarding operator domains and geometric boundaries.

To formalize this generalized framework, the authors define a proximal b-enriched nonexpansive non-self mapping between two nonempty, closed, and convex subsets of a real Hilbert space. This mapping requires the distance between linear combinations of metric projections and mapping outputs across two arbitrary points to remain bounded by a scaled norm of the difference between those points. The authors establish an explicit corresponding averaged operator that scales the projection onto the target set alongside the non-self mapping via a parameter tied directly to the enrichment constant. Crucially, the authors prove that an element serves as an enriched best proximity point of the non-self mapping if and only if it constitutes a standard best proximity point of this newly formulated averaged operator.

A critical foundational result proven by the researchers concerns the geometric topology of the resulting solution set. The authors demonstrate that whenever a proximal b-enriched nonexpansive mapping admits a nonempty collection of best proximity points, the corresponding solution set for its averaged operator is both closed and convex within the domain space. Establishing closedness and convexity is vital in Hilbert space theory, as it ensures the existence of a unique metric projection from any arbitrary point in the ambient space onto the solution set. The authors demonstrate this through step-by-step inequalities utilizing the nonexpansiveness of the averaged operator and properties of proximity projectors on convex domains.

Achieving strong convergence has historically presented an obstacle in iterative operator theory, as standard iterative methods for nonexpansive mappings typically guarantee only weak convergence in infinite-dimensional Hilbert spaces. To overcome this limitation, the authors constructed Algorithm F, a hybrid scheme inspired by mathematical programming techniques and the shrinking projection methodology originally proposed by Takahashi and colleagues. The algorithm begins from an arbitrary vector in the Hilbert space, projecting onto an initial subset defined by points attaining the global inter-set distance. In each successive iteration, the algorithm calculates an intermediate vector using a convex combination of metric projections and averaged mapping evaluations, constructs a half-space constraint ensuring proximity to previous iterates, and determines the subsequent iterate via a metric projection onto this shrinking convex set.

Under explicitly stated structural conditions, the authors formally prove Theorem 3.5, establishing the strong convergence of Algorithm F. Specifically, when the domain and codomain subsets satisfy the classical P-property and the UC property, and assuming an appropriate demiclosedness condition at zero for the projected operator, the generated sequence of iterates converges strongly to an enriched best proximity point. Moreover, the limit point is shown to be the exact metric projection of the initial point onto the set of best proximity points. The authors substantiate their theoretical proof across two comprehensive cases, demonstrating that the analytical machinery remains equally robust whether the enrichment parameter is strictly positive or degenerates to zero.

To validate the operational performance of Algorithm F, the researchers executed numerical experiments across two distinct two-dimensional Euclidean examples. In the first numerical test, subsets were defined on opposing sides of the plane separated by an exact distance of four units, and an enriched mapping with an enrichment constant of one was subjected to iteration using an initial starting point outside the domain. The iterative sequence produced strong convergence toward the unique proximity vector (-2, 0.618), achieving an accuracy of four significant digits within twenty-four iterations. A second numerical experiment evaluated a trigonometric mapping involving a cosine formulation, again verifying strong convergence to the coordinate vector (-2, 1) and affirming that the shrinking projection set successfully narrows down the optimal proximity coordinates.

Beyond abstract best proximity theorems, the authors demonstrate the practical utility of their formulation by applying the algorithm to the split feasibility problem in Hilbert spaces. Originally introduced by Censor and Elfving to model inverse problems arising in medical image reconstruction, split feasibility tasks require finding a point within a closed convex set such that its linear transformation resides within another convex set. By expressing the split feasibility constraint as a fixed-point problem of an averaged operator derived from gradient-projection steps, the authors show that their hybrid scheme successfully solves the split feasibility problem with guaranteed strong convergence. This rigorous synthesis provides functional analysis and applied mathematics with a unified iterative tool for resolving constrained optimization, inverse imaging models, and nonlinear operator equations.

When the domain and target sets coincide across the entire Hilbert space, the proximal framework directly specializes into classical fixed-point theory. In this setting, the proximal condition simplifies to the standard enriched nonexpansive formulation, where the operator acts as a self-mapping on a closed and convex subset. By configuring the iteration parameters with an averaged operator whose fixed-point collection remains nonempty, the authors formulate Theorem 5.1. Under the requirement that the difference between the identity mapping and the averaged operator is demiclosed at zero, the iterative sequences converge strongly to the metric projection of the initial point onto the set of fixed points. The proof establishes that each generated subset remains closed and convex through inductive arguments, guaranteeing that iterates are well-defined and uniformly bounded.

The practical implementation for split feasibility problems relies on precise structural operators linking two distinct Hilbert spaces through a bounded linear operator and its adjoint. To locate a vector in a closed convex set whose linear image falls within a target set while simultaneously satisfying an enriched fixed-point constraint, the researchers incorporate a convex, differentiable function whose gradient satisfies a Lipschitz condition determined by the operator norm. By choosing a relaxation parameter bounded by two divided by the squared norm of the linear operator, the resulting transformation functions as an essentially nonexpansive averaged operator. Algorithm G evaluates this gradient-projection step in each cycle to define intermediate points, construct updated half-space constraints, and project toward a unique solution point.

Underpinning both algorithms are foundational geometric properties of real Hilbert spaces, including inner product characterizations of metric projections and demiclosedness principles. These analytical tools guarantee that the weak limit set of the generated sequence is contained within the set of solutions, enabling the transition from weak convergence to strong convergence without requiring compactness assumptions. The authors also confirm that proximal enriched nonexpansive mappings retain the property of continuity, mirroring classical nonexpansive operators. Finally, the authors note that no external datasets were generated or analyzed during the study, as the findings represent pure theoretical analysis and mathematical proofs.

Subject of Research: Enriched best proximity point theorems and hybrid projection algorithms in Hilbert spaces

Article Title: Enriched best proximity point theorems for enriched non-self nonexpansive mappings with an application in Hilbert spaces

Article References: Kanwal, S., Saleem, N., Zhou, M., & Razzaque, A. (2026). Enriched best proximity point theorems for enriched non-self nonexpansive mappings with an application in Hilbert spaces. Journal of Inequalities and Applications, 2026(1), Article 99. https://doi.org/10.1186/s13660-026-03507-7

Image Credits: AI Generated

DOI: 10.1186/s13660-026-03507-7

Keywords: best proximity point, Hilbert spaces, nonexpansive mappings, proximal enriched mappings, hybrid algorithm, shrinking projection, strong convergence, split feasibility problem, fixed point theory, Banach contraction principle, averaged operator, metric spaces, non-self mappings, optimization problems, variational inequalities, mathematical programming

Cite Scienmag News

Reid Dalton. (November 21, 2026). Hybrid Projection Algorithm Resolves Best Proximity Points in Real Hilbert Spaces. Scienmag. https://scienmag.com/hybrid-projection-algorithm-resolves-best-proximity-points-in-real-hilbert-spaces/

Reid Dalton. "Hybrid Projection Algorithm Resolves Best Proximity Points in Real Hilbert Spaces." Scienmag, 21 November 2026, https://scienmag.com/hybrid-projection-algorithm-resolves-best-proximity-points-in-real-hilbert-spaces/. Accessed 21 November 2026.

Reid Dalton. "Hybrid Projection Algorithm Resolves Best Proximity Points in Real Hilbert Spaces." Scienmag. November 21, 2026. https://scienmag.com/hybrid-projection-algorithm-resolves-best-proximity-points-in-real-hilbert-spaces/

Tags: averaged operatorBanach contraction principlebest proximity pointfixed point theoryHilbert spaceshybrid algorithmmathematical programmingmetric spacesnon-self mappingsnonexpansive mappingsoptimization problemsproximal enriched mappingsshrinking projectionsplit feasibility problemstrong convergencevariational inequalities
Share26Tweet16
Previous Post

Black Mulberry Dye Leads Performance in Green-Synthesized Titanium Dioxide Solar Cells

Next Post

Extended Pre-Intubation High-Flow Nasal Cannula Links to Higher Mortality in Severe ARDS

Related Posts

Neural Network Autonomously Restores Solid-State Laser Oscillation Using Spatial Emission Images
Science News

Neural Network Autonomously Restores Solid-State Laser Oscillation Using Spatial Emission Images

November 21, 2026
Heisenberg Operator Networks Reveal Universal Boundaries of Classical Quantum Circuit Simulation
Science News

Heisenberg Operator Networks Reveal Universal Boundaries of Classical Quantum Circuit Simulation

November 21, 2026
Simulations Reveal Physical Dislocation Flow Rule in Face-Centered Cubic Metals
Technology and Engineering

Simulations Reveal Physical Dislocation Flow Rule in Face-Centered Cubic Metals

November 21, 2026
Synthetic Agonist LXR623 Reprograms Microglia and Reduces Encephalitis Mortality in Mice
Medicine

Synthetic Agonist LXR623 Reprograms Microglia and Reduces Encephalitis Mortality in Mice

November 21, 2026
Portable Low-Field Intraoperative MRI Shows Feasibility in Screened Brain Surgeries
Medicine

Portable Low-Field Intraoperative MRI Shows Feasibility in Screened Brain Surgeries

November 21, 2026
Survey Finds Nigerian Clinicians Value Breast Cancer Genetics Despite Severe Resource Deficits
Cancer

Survey Finds Nigerian Clinicians Value Breast Cancer Genetics Despite Severe Resource Deficits

November 21, 2026
Next Post
Extended Pre-Intubation High-Flow Nasal Cannula Links to Higher Mortality in Severe ARDS

Extended Pre-Intubation High-Flow Nasal Cannula Links to Higher Mortality in Severe ARDS

  • Mothers who receive childcare support from maternal grandparents show more optimized

    Mothers who receive childcare support from maternal grandparents show more parental warmth, finds NTU Singapore study

    27656 shares
    Share 11059 Tweet 6912
  • University of Seville Breaks 120-Year-Old Mystery, Revises a Key Einstein Concept

    1061 shares
    Share 424 Tweet 265
  • Bee body mass, pathogens and local climate influence heat tolerance

    682 shares
    Share 273 Tweet 171
  • Researchers record first-ever images and data of a shark experiencing a boat strike

    546 shares
    Share 218 Tweet 137
  • Groundbreaking Clinical Trial Reveals Lubiprostone Enhances Kidney Function

    531 shares
    Share 212 Tweet 133
Science

Embark on a thrilling journey of discovery with Scienmag.com—your ultimate source for cutting-edge breakthroughs. Immerse yourself in a world where curiosity knows no limits and tomorrow’s possibilities become today’s reality!

RECENT NEWS

  • Neural Network Autonomously Restores Solid-State Laser Oscillation Using Spatial Emission Images
  • Heisenberg Operator Networks Reveal Universal Boundaries of Classical Quantum Circuit Simulation
  • Simulations Reveal Physical Dislocation Flow Rule in Face-Centered Cubic Metals
  • Synthetic Agonist LXR623 Reprograms Microglia and Reduces Encephalitis Mortality in Mice

Categories

  • Agriculture
  • Anthropology
  • Archaeology
  • Athmospheric
  • Biology
  • Biotechnology
  • Blog
  • Bussines
  • Cancer
  • Chemistry
  • Climate
  • Earth Science
  • Editorial Policy
  • Marine
  • Mathematics
  • Medicine
  • Pediatry
  • Policy
  • Psychology & Psychiatry
  • Science Education
  • Science News
  • Social Science
  • Space
  • Technology and Engineering

Subscribe to Blog via Email

Enter your email address to subscribe to this blog and receive notifications of new posts by email.

Join 5,151 other subscribers

© 2026 Scienmag - Science Magazine

Welcome Back!

Login to your account below

Forgotten Password?

Retrieve your password

Please enter your username or email address to reset your password.

Log In
No Result
View All Result
  • HOME
  • SCIENCE NEWS
  • CONTACT US

© 2026 Scienmag - Science Magazine

Discover more from Science

Subscribe now to keep reading and get access to the full archive.

Continue reading