An iterative method for solving split minimization problem in Banach space with applications
Închide
Conţinutul numărului revistei
Articolul precedent
Articolul urmator
515 15
Ultima descărcare din IBN:
2023-01-28 01:14
Căutarea după subiecte
similare conform CZU
517.5+517.9 (7)
Analiză (301)
Ecuații diferențiale. Ecuații integrale. Alte ecuații funcționale. Diferențe finite. Calculul variațional. Analiză funcțională (243)
SM ISO690:2012
JOLAOSO, Lateef Olakunle, OGBUISI, Ferdinard Udochukwu, MEWOMO, Oluwatosin Temitope. An iterative method for solving split minimization problem in Banach space with applications. In: Buletinul Academiei de Ştiinţe a Republicii Moldova. Matematica, 2021, nr. 1-2(95-96), pp. 3-30. ISSN 1024-7696.
EXPORT metadate:
Google Scholar
Crossref
CERIF

DataCite
Dublin Core
Buletinul Academiei de Ştiinţe a Republicii Moldova. Matematica
Numărul 1-2(95-96) / 2021 / ISSN 1024-7696 /ISSNe 2587-4322

An iterative method for solving split minimization problem in Banach space with applications

CZU: 517.5+517.9
MSC 2010: 47H06, 47H09, 49J53, 65K10.

Pag. 3-30

Jolaoso Lateef Olakunle1, Ogbuisi Ferdinard Udochukwu12, Mewomo Oluwatosin Temitope1
 
1 University of KwaZulu-Natal,
2 DSI-NRF Centre of Excellence in Mathematical and Statistical Sciences (CoE-MaSS)
 
 
Disponibil în IBN: 3 decembrie 2021


Rezumat

The purpose of this paper is to study an approximation method for finding a solution of the split minimization problem which is also a fixed point of a right Bregman strongly nonexpansive mapping in p-uniformly convex real Banach spaces which are also uniformly smooth. We introduce a new iterative algorithm with a new choice of stepsize such that its implementation does not require a prior knowledge of the operator norm. Using the Bregman distance technique, we prove a strong convergence theorem for the sequence generated by our algorithm. Further, we applied our result to the approximation of solution of inverse problem arising in signal processing and give a numerical example to show how the sequence values are affected by the number of iterations. Our result in this paper extends and complements many recent results in literature.

Cuvinte-cheie
split feasibility problems, split minimization problems, proximal operators, fixed point problems, inverse problems, Bregman distance, soft thresholding, Banach spaces

DataCite XML Export

<?xml version='1.0' encoding='utf-8'?>
<resource xmlns:xsi='http://www.w3.org/2001/XMLSchema-instance' xmlns='http://datacite.org/schema/kernel-3' xsi:schemaLocation='http://datacite.org/schema/kernel-3 http://schema.datacite.org/meta/kernel-3/metadata.xsd'>
<creators>
<creator>
<creatorName>Jolaoso, L.</creatorName>
<affiliation>University of KwaZulu-Natal, Africa de Sud</affiliation>
</creator>
<creator>
<creatorName>Ogbuisi, F.</creatorName>
<affiliation>University of KwaZulu-Natal, Africa de Sud</affiliation>
</creator>
<creator>
<creatorName>Mewomo, O.</creatorName>
<affiliation>University of KwaZulu-Natal, Africa de Sud</affiliation>
</creator>
</creators>
<titles>
<title xml:lang='en'>An iterative method for solving split minimization problem in Banach space with applications</title>
</titles>
<publisher>Instrumentul Bibliometric National</publisher>
<publicationYear>2021</publicationYear>
<relatedIdentifier relatedIdentifierType='ISSN' relationType='IsPartOf'>1024-7696</relatedIdentifier>
<subjects>
<subject>split feasibility problems</subject>
<subject>split minimization problems</subject>
<subject>proximal operators</subject>
<subject>fixed point problems</subject>
<subject>inverse problems</subject>
<subject>Bregman distance</subject>
<subject>soft
thresholding</subject>
<subject>Banach spaces</subject>
<subject schemeURI='http://udcdata.info/' subjectScheme='UDC'>517.5+517.9</subject>
</subjects>
<dates>
<date dateType='Issued'>2021-12-03</date>
</dates>
<resourceType resourceTypeGeneral='Text'>Journal article</resourceType>
<descriptions>
<description xml:lang='en' descriptionType='Abstract'><p>The purpose of this paper is to study an approximation method for finding a solution of the split minimization problem which is also a fixed point of a right Bregman strongly nonexpansive mapping in p-uniformly convex real Banach spaces which are also uniformly smooth. We introduce a new iterative algorithm with a new choice of stepsize such that its implementation does not require a prior knowledge of the operator norm. Using the Bregman distance technique, we prove a strong convergence theorem for the sequence generated by our algorithm. Further, we applied our result to the approximation of solution of inverse problem arising in signal processing and give a numerical example to show how the sequence values are affected by the number of iterations. Our result in this paper extends and complements many recent results in literature.</p></description>
</descriptions>
<formats>
<format>application/pdf</format>
</formats>
</resource>