<?xml version="1.0" encoding="utf-8" standalone="yes"?><rss version="2.0" xmlns:atom="http://www.w3.org/2005/Atom"><channel><title>Optimization on ArisNotes</title><link>/tags/optimization/</link><description>Recent content in Optimization on ArisNotes</description><generator>Hugo</generator><language>en-us</language><lastBuildDate>Sun, 17 May 2026 00:00:00 +0000</lastBuildDate><atom:link href="/tags/optimization/index.xml" rel="self" type="application/rss+xml"/><item><title>ArisRTO</title><link>/projects/arisrto/</link><pubDate>Sun, 17 May 2026 00:00:00 +0000</pubDate><guid>/projects/arisrto/</guid><description>This is the main note for my ArisRTO project</description></item><item><title>Optimization Guide</title><link>/guides/optimization-guide/</link><pubDate>Sun, 17 May 2026 00:00:00 +0000</pubDate><guid>/guides/optimization-guide/</guid><description>This is the main note for my Optimizations Guide.</description></item><item><title>The Lagrangian</title><link>/notes/optimization/lagrangian/</link><pubDate>Sun, 17 May 2026 00:00:00 +0000</pubDate><guid>/notes/optimization/lagrangian/</guid><description>This note gives a geometric, engineer-friendly view of nonlinear optimization and shows how the Lagrangian turns “constraints plus objective” into a single analytical object. Along the way, it builds up the ideas of Lagrange multipliers and KKT conditions step by step, so you can see them as sensitivity measures and practical optimality checks rather than abstract math.</description></item></channel></rss>