<?xml version="1.0" encoding="UTF-8"?><rss version="2.0"
	xmlns:content="http://purl.org/rss/1.0/modules/content/"
	xmlns:wfw="http://wellformedweb.org/CommentAPI/"
	xmlns:dc="http://purl.org/dc/elements/1.1/"
	xmlns:atom="http://www.w3.org/2005/Atom"
	xmlns:sy="http://purl.org/rss/1.0/modules/syndication/"
	xmlns:slash="http://purl.org/rss/1.0/modules/slash/"
	>

<channel>
	<title>Math Kanokwan Kratuloek &#8211; FAU DCN-AvH</title>
	<atom:link href="https://dcn.nat.fau.eu/category/math/math-kanokwan-kratuloek/feed/" rel="self" type="application/rss+xml" />
	<link>https://dcn.nat.fau.eu</link>
	<description>Chair for Dynamics, Control, Machine Learning and Numerics -Alexander von Humboldt Professorship</description>
	<lastBuildDate>Mon, 20 Jul 2026 14:16:09 +0000</lastBuildDate>
	<language>en-US</language>
	<sy:updatePeriod>
	hourly	</sy:updatePeriod>
	<sy:updateFrequency>
	1	</sy:updateFrequency>
	<generator>https://wordpress.org/?v=7.1.3</generator>

<image>
	<url>https://dcn.nat.fau.eu/wp-content/uploads/cropped-FAUDCNAvHlogo_square_silhouette_512x512-32x32.png</url>
	<title>Math Kanokwan Kratuloek &#8211; FAU DCN-AvH</title>
	<link>https://dcn.nat.fau.eu</link>
	<width>32</width>
	<height>32</height>
</image> 
	<item>
		<title>A relaxed splitting method for solving variational inclusion and fixed point problems</title>
		<link>https://dcn.nat.fau.eu/a-relaxed-splitting-method-for-solving-variational-inclusion-and-fixed-point-problems/</link>
		
		<dc:creator><![CDATA[darlis.dcn]]></dc:creator>
		<pubDate>Sat, 26 Jul 2025 15:50:55 +0000</pubDate>
				<category><![CDATA[Math]]></category>
		<category><![CDATA[Math Kanokwan Kratuloek]]></category>
		<guid isPermaLink="false">https://dcn.nat.fau.eu/?p=31519</guid>

					<description><![CDATA[A relaxed splitting method for solving variational inclusion and fixed point problems &#160; 1 Introduction Variational inclusion and fixed point problems are fundamental in many areas of applied mathematics, including optimization, inverse problems, equilibrium theory, image processing, and machine learning. These problems can be formulated as finding a common solution in a real Hilbert space [&#8230;]]]></description>
		
		
		
			</item>
	</channel>
</rss>
