<?xml version="1.0" encoding="utf-8" standalone="yes"?><rss version="2.0" xmlns:atom="http://www.w3.org/2005/Atom"><channel><title>Convexity on Aayush Bajaj's Augmenting Infrastructure</title><link>https://abaj.ai/tags/convexity/</link><description>Recent content in Convexity on Aayush Bajaj's Augmenting Infrastructure</description><generator>Hugo</generator><language>en</language><copyright>© 2026 Aayush Bajaj</copyright><lastBuildDate>Fri, 10 Jul 2026 08:15:43 +1000</lastBuildDate><atom:link href="https://abaj.ai/tags/convexity/index.xml" rel="self" type="application/rss+xml"/><item><title>Quadratic Programming</title><link>https://abaj.ai/wiki/ccs/programming/paradigms/quadratic/</link><pubDate>Fri, 10 Jul 2026 01:43:39 +1000</pubDate><guid>https://abaj.ai/wiki/ccs/programming/paradigms/quadratic/</guid><description>&lt;p>promote the objective of a &lt;a
 href="https://abaj.ai/wiki/ccs/programming/paradigms/linear/"
 
 
>linear program&lt;/a> from a plane to a bowl and you get quadratic programming: minimise a quadratic function over a polyhedron. it is the smallest step beyond LP, yet it captures a startling share of applied mathematics — support vector machines, portfolio selection, ridge regression, model-predictive control — because &amp;ldquo;squared penalty subject to linear rules&amp;rdquo; is how half the world states its preferences.&lt;span class="margin-note" data-note="the other half states them as expected log-wealth and gets convex programming anyway">
 &lt;span class="margin-note-indicator">𐃏&lt;/span>
&lt;/span>
&lt;/p></description></item></channel></rss>