<?xml version="1.0" encoding="utf-8" standalone="yes"?><rss version="2.0" xmlns:atom="http://www.w3.org/2005/Atom"><channel><title>Mathematics on Slow Data</title><link>https://shika-b.github.io/tags/mathematics/</link><description>Recent content in Mathematics on Slow Data</description><generator>Hugo</generator><language>en-us</language><lastBuildDate>Sun, 09 Nov 2025 13:44:57 +0100</lastBuildDate><atom:link href="https://shika-b.github.io/tags/mathematics/index.xml" rel="self" type="application/rss+xml"/><item><title>Lagrangian Duality, KKT conditions and LP duality</title><link>https://shika-b.github.io/blog/lagrangian_duality/</link><pubDate>Sun, 09 Nov 2025 13:44:57 +0100</pubDate><guid>https://shika-b.github.io/blog/lagrangian_duality/</guid><description>&lt;h2 id="optimization-context">Optimization context&lt;/h2>
&lt;p>Let&amp;rsquo;s imagine for a moment we are trying to solve a class of &lt;em>constrained&lt;/em> optimization problems of the form
&lt;/p>
$$\begin{align*}
 &amp;\inf_x f(x) \\
 &amp;\text{subject to } &amp;g_i(x) \leq 0 \text{ for } 1 \leq i \leq m \\
 &amp;&amp;h_j(x) = 0, \text{ for } 1 \leq j \leq n
\end{align*} 
$$&lt;p>
where $f, g_1, \ldots, g_m, h_1, \ldots, h_n \in \mathcal{C}$ for $\mathcal{C}$ a fixed class of smooth functions. We fix such a problem $(P)$. What is a reasonable strategy to solve this?&lt;/p></description></item></channel></rss>