Projection-constrained solvability for multivalued operator inclusions

In this paper, we introduce the notion of finite-approximate solvability for multivalued operator inclusions in Hilbert spaces. We study projection-constrained inclusions of the form h∈Au+F(u), where A is a bounded linear operator and F is a compact convex-valued multivalued perturbation, and develop a nonlinear resolvent framework based on the regularized operators Tα=α(I−π)+AA∗. Using multivalued fixed-point techniques, we establish existence of nonlinear resolvent selections and derive sufficient and necessary residual conditions for finite-approximate solvability. We also show that finite-rank projection geometry, compactness, convexity, and orthogonality assumptions are essential for the solvability mechanism, and develop Galerkin-type approximation schemes for recovering solvability asymptotically. The obtained results extend finite-approximate solvability theory from single-valued operator equations to nonlinear multivalued inclusions.

Authors

Institutions

Publication Details

Journal
Applicable Analysis
Published
2026-09-24
DOI
https://doi.org/10.1080/00036811.2026.2737981
Primary Topic
Optimization and Variational Analysis
Type
article
Field-Weighted Citation Impact
0.00
Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
article

Projection-constrained solvability for multivalued operator inclusions

Müberra Selah
Applicable Analysis
Optimization and Variational Analysis
article

Projection-constrained solvability for multivalued operator inclusions

Müberra Selah
article en

Abstract

In this paper, we introduce the notion of finite-approximate solvability for multivalued operator inclusions in Hilbert spaces. We study projection-constrained inclusions of the form h∈Au+F(u), where A is a bounded linear operator and F is a compact convex-valued multivalued perturbation, and develop a nonlinear resolvent framework based on the regularized operators Tα=α(I−π)+AA∗. Using multivalued fixed-point techniques, we establish existence of nonlinear resolvent selections and derive sufficient and necessary residual conditions for finite-approximate solvability. We also show that finite-rank projection geometry, compactness, convexity, and orthogonality assumptions are essential for the solvability mechanism, and develop Galerkin-type approximation schemes for recovering solvability asymptotically. The obtained results extend finite-approximate solvability theory from single-valued operator equations to nonlinear multivalued inclusions.

Applicable Analysis
İstanbul Gelişim Üniversitesi (TR)
Reduced inequalities
Openalex Percentile: Top 9%
Optimization and Variational Analysis
AI Navigator

Ask Laika to Summarize, Analyze, and Connect papers live on the map.

Summarize Papers & Methodologies

Extract key findings, datasets, and comparative methods across publications.

Benchmark Rankings & Visual Analytics

Rank top research institutions, authors, funders, topics, and journals by Field-Weighted Citation Impact (FWCI) and paper volume with instant charts.

Connect Distant Disciplines

Bridge topological clusters on the map to find hidden collaborative intersections.

Projection-constrained solvability for multivalued operator inclusions — Müberra Selah · Applicable Analysis (2026) | TGRS Research Map | TGRS