logo
CanyamAI summaries for academic research
language
MobileMobile
  • Phone FeatureWeChat Mini Program
EnglishEnglish
noticeNotice
BlogBlog
delete
arrow
Return

Linear inverse problems with box constraints

delete2026-01-01
delete0
PRE
AI
H
Henryk Gzyl *
DOI：10.1515/jaa-2025-0097delete
deleteOriginal
deleteOriginal request for help
deleteShare
deleteSave
Abstract

Abstract

En 中文
We solve the problem AX = y, where A : K -> R-N IRN is a linear, continuous operator, and K is a class of functions with prescribed bounds defined on a compact domain in R-m. We restate the problem as consisting of minimizing an entropy of Fermi-Dirac type, subject to AX = y as a constraint. We prove that the solution is robust respect to small perturbations of the data and converges to a true solution as the number of data points increases.
Keywords:
Ill-posed linear problem with convex constraints
integral equations
integral transforms
entropy minimization

Journal

J
Journal of Applied Analysis
IF:
0.6
Papers:
13
Citations:
0

Organization

No organization information available