<rss version="2.0" xmlns:dc="http://purl.org/dc/elements/1.1/" xmlns:atom="http://www.w3.org/2005/Atom"><channel><title>Hacker News: klamike</title><link>https://news.ycombinator.com/user?id=klamike</link><description>Hacker News RSS</description><docs>https://hnrss.org/</docs><generator>hnrss v2.1.1</generator><lastBuildDate>Mon, 19 Oct 2026 05:22:12 +0000</lastBuildDate><atom:link href="https://hnrss.org/user?id=klamike" rel="self" type="application/rss+xml"></atom:link><item><title><![CDATA[New comment by klamike in "Interactive Linear Programming in the Browser"]]></title><description><![CDATA[
<p>Fair, good point :)</p>
]]></description><pubDate>Sun, 18 Oct 2026 17:51:45 +0000</pubDate><link>https://news.ycombinator.com/item?id=50143475</link><dc:creator>klamike</dc:creator><comments>https://news.ycombinator.com/item?id=50143475</comments><guid isPermaLink="false">https://news.ycombinator.com/item?id=50143475</guid></item><item><title><![CDATA[New comment by klamike in "Interactive Linear Programming in the Browser"]]></title><description><![CDATA[
<p>> A fun fact which is not so difficult to prove in 2 dimensions is that if a linear program has an optimal point (guaranteed when the constraints define a convex polytope), then the minimum objective value will be achieved at one of the vertices of the polytope.<p>That is, if you assume there is no dual degeneracy :) <a href="https://lpviz.net/?s=AsEABN_FCIDiCQC_ixGg4BQAAMCLEYCS9AEAZAA" rel="nofollow">https://lpviz.net/?s=AsEABN_FCIDiCQC_ixGg4BQAAMCLEYCS9AEAZAA</a></p>
]]></description><pubDate>Sun, 18 Oct 2026 17:48:42 +0000</pubDate><link>https://news.ycombinator.com/item?id=50143435</link><dc:creator>klamike</dc:creator><comments>https://news.ycombinator.com/item?id=50143435</comments><guid isPermaLink="false">https://news.ycombinator.com/item?id=50143435</guid></item><item><title><![CDATA[New comment by klamike in "Interactive Linear Programming in the Browser"]]></title><description><![CDATA[
<p>lpviz visualizes how different linear programming (LP) solver algorithms arrive at their solution, and how they react to adjustments in the problem definition. To start using lpviz you first draw a number of vertices to define the so-called feasible region. Then you point the objective arrow, defining the improvement direction. The answer/optimal point is the point furthest along the improvement direction, while still being inside the feasible region.<p>LP finds applications in tons of downstream fields, though the typical real-world problem has thousands to millions of variables (whereas lpviz is limited to 2) and constraints. Courses typically focus on how to model real-world problems as LP, instead of diving into how the solvers work. lpviz tries to fill that gap, so you can develop some intuition for how the different algorithms work.<p>There's tons of great videos/lectures introducing LP, this two-minute one is pretty good: <a href="https://www.youtube.com/watch?v=7ZjmPATPVzI" rel="nofollow">https://www.youtube.com/watch?v=7ZjmPATPVzI</a></p>
]]></description><pubDate>Sun, 18 Oct 2026 17:40:11 +0000</pubDate><link>https://news.ycombinator.com/item?id=50143354</link><dc:creator>klamike</dc:creator><comments>https://news.ycombinator.com/item?id=50143354</comments><guid isPermaLink="false">https://news.ycombinator.com/item?id=50143354</guid></item><item><title><![CDATA[New comment by klamike in "Interactive Linear Programming in the Browser"]]></title><description><![CDATA[
<p>Thanks! Yeah this is something I've been thinking about, agreed it could be really cool. Just not quite sure on the UX yet, perhaps a separate site (i.e. lpviz.net/step, like the in-progress 3-variable mode <a href="https://0b2df09c-lpviz.michael-4e4.workers.dev/3d" rel="nofollow">https://0b2df09c-lpviz.michael-4e4.workers.dev/3d</a>) that uses some LaTeX animations to show the actual calculations of each step..</p>
]]></description><pubDate>Sun, 18 Oct 2026 15:46:11 +0000</pubDate><link>https://news.ycombinator.com/item?id=50142089</link><dc:creator>klamike</dc:creator><comments>https://news.ycombinator.com/item?id=50142089</comments><guid isPermaLink="false">https://news.ycombinator.com/item?id=50142089</guid></item><item><title><![CDATA[New comment by klamike in "Interactive Linear Programming in the Browser"]]></title><description><![CDATA[
<p>Thanks for the suggestion, always looking to add more solvers. Here's a share link to a branch that adds criss-cross and a proximal primal-dual active set, animating criss-cross looks pretty cool on the Many Facets preset:<p><a href="https://9b7c882e-lpviz.michael-4e4.workers.dev/?s=AtUAHIDTDgCBL9jbAtWKAaDKAq_fAaKoAvGoArT3AcHjApS6AaWMA8hznaEDliedoQOVJ6WMA8dzweMCk7oB8agCs_cBr98BoagC1YoBn8oCgS_X2wKCL9fbAtaKAZ_KArDfAaGoAvKoArP3AcLjApO6AaaMA8dznqEDlSeeoQOWJ6aMA8hzwuMClLoB8qgCtPcBsN8BoqgC1ooBoMoC_su8BPGNywJkARIB" rel="nofollow">https://9b7c882e-lpviz.michael-4e4.workers.dev/?s=AtUAHIDTDg...</a></p>
]]></description><pubDate>Sun, 18 Oct 2026 15:40:08 +0000</pubDate><link>https://news.ycombinator.com/item?id=50142024</link><dc:creator>klamike</dc:creator><comments>https://news.ycombinator.com/item?id=50142024</comments><guid isPermaLink="false">https://news.ycombinator.com/item?id=50142024</guid></item><item><title><![CDATA[Interactive Linear Programming in the Browser]]></title><description><![CDATA[
<p>Article URL: <a href="https://lpviz.net/">https://lpviz.net/</a></p>
<p>Comments URL: <a href="https://news.ycombinator.com/item?id=50130379">https://news.ycombinator.com/item?id=50130379</a></p>
<p>Points: 73</p>
<p># Comments: 12</p>
]]></description><pubDate>Sat, 17 Oct 2026 12:06:44 +0000</pubDate><link>https://lpviz.net/</link><dc:creator>klamike</dc:creator><comments>https://news.ycombinator.com/item?id=50130379</comments><guid isPermaLink="false">https://news.ycombinator.com/item?id=50130379</guid></item><item><title><![CDATA[Show HN: lpviz – Interactive linear programming visualization in the browser]]></title><description><![CDATA[
<p><a href="https://github.com/lpviz/lpviz" rel="nofollow">https://github.com/lpviz/lpviz</a><p>Visualize linear programming solvers - Simplex, Interior Point, PDHG, and Central Path - in the browser. Drag the objective/vertices/constraints around and watch the solver trajectory respond in real time. Enter 3D mode to view solver metadata (like centrality for IPM or KKT residual for PDHG) on the z-axis. Always happy to get feedback and feature requests, one thing that is coming soon is support for importing problems from e.g. JuMP or cvxpy.</p>
<hr>
<p>Comments URL: <a href="https://news.ycombinator.com/item?id=48619139">https://news.ycombinator.com/item?id=48619139</a></p>
<p>Points: 9</p>
<p># Comments: 1</p>
]]></description><pubDate>Sun, 21 Jun 2026 14:08:56 +0000</pubDate><link>https://lpviz.net/</link><dc:creator>klamike</dc:creator><comments>https://news.ycombinator.com/item?id=48619139</comments><guid isPermaLink="false">https://news.ycombinator.com/item?id=48619139</guid></item><item><title><![CDATA[New comment by klamike in "Algorithms for Optimization [pdf]"]]></title><description><![CDATA[
<p>Thanks! I’m glad you enjoyed it. You may also get a kick out of the YouTube hyperlinks in the GitHub readme, especially the advanced methods for establishing convexity one :)</p>
]]></description><pubDate>Mon, 01 Dec 2025 17:53:26 +0000</pubDate><link>https://news.ycombinator.com/item?id=46110554</link><dc:creator>klamike</dc:creator><comments>https://news.ycombinator.com/item?id=46110554</comments><guid isPermaLink="false">https://news.ycombinator.com/item?id=46110554</guid></item><item><title><![CDATA[New comment by klamike in "Algorithms for Optimization [pdf]"]]></title><description><![CDATA[
<p>Great to see optimization on the front page of HN! One thing I love about the book is it's full of really nice figures. If like me you love visualizations, you may enjoy this website I've been working on to visualize linear programming (LP) solvers: <a href="https://lpviz.net" rel="nofollow">https://lpviz.net</a>.<p>It's by no means polished, but it can be pretty fun to play around with, visualizing how the iterates of different LP algorithms (described in sections 11, 12 of the book) react to changes in the feasible region/objective, by just dragging the vertices/constraints around.<p>If you go to <a href="https://lpviz.net/?demo" rel="nofollow">https://lpviz.net/?demo</a> it will draw a polytope for you, and click around the interface to show off some of the features. I'm constantly chipping away at it in my free time, I welcome any feedback and suggestions!</p>
]]></description><pubDate>Mon, 01 Dec 2025 01:57:41 +0000</pubDate><link>https://news.ycombinator.com/item?id=46102609</link><dc:creator>klamike</dc:creator><comments>https://news.ycombinator.com/item?id=46102609</comments><guid isPermaLink="false">https://news.ycombinator.com/item?id=46102609</guid></item><item><title><![CDATA[New comment by klamike in "Ask HN: What are you working on? (October 2025)"]]></title><description><![CDATA[
<p><a href="https://lpviz.net/" rel="nofollow">https://lpviz.net/</a><p>lpviz is like Desmos, but for linear programming - I've implemented a few LP solvers in Typescript and hooked them up to a canvas so you can draw a feasible region, set an objective direction, and see how the algorithms work. And it all runs locally, in the browser!<p>If you go to <a href="https://lpviz.net/?demo" rel="nofollow">https://lpviz.net/?demo</a> it should show you a short tour of the features/how to use it.<p>It's by no means complete but I figured there may be some fellow optimization enthusiasts here who might be interested to take a look :) Super open to feedback, feature requests, comments!<p>For a 2-min intro to LP, I recommend <a href="https://www.youtube.com/watch?v=7ZjmPATPVzI" rel="nofollow">https://www.youtube.com/watch?v=7ZjmPATPVzI</a></p>
]]></description><pubDate>Mon, 13 Oct 2025 04:45:40 +0000</pubDate><link>https://news.ycombinator.com/item?id=45564749</link><dc:creator>klamike</dc:creator><comments>https://news.ycombinator.com/item?id=45564749</comments><guid isPermaLink="false">https://news.ycombinator.com/item?id=45564749</guid></item></channel></rss>