https://hackerpaper.kaipfister.de/p/2011.04866/Collected HN comments and submissions linking this paper.enMon, 02 Nov 2026 11:16:22 GMThttps://news.ycombinator.com/item?id=45629571urn:hackerpapers:mention:2011.04866:45629571Sat, 18 Oct 2025 18:53:06 GMT<p>The general technique is not recent I was taught it in school in global optimisation class more than 15 years ago. Here there is a small number of local minimum, the idea is to iterate over them in increasing order. Can&#x27;t remember the exact name but here is a more recent paper proposing &quot;Sequential Gradient Descent&quot; https://arxiv.org/abs/2011.04866 which features a similar idea. Sequential convex programming : http://web.stanford.edu/class/ee364b/lectures/seq_notes.pdf There is not really something special to it, it just standard local non linear minimization techniques with constraints…</p><p><a href="https://hackerpaper.kaipfister.de/p/2011.04866/">Paper and discussion history</a>. A mention is not an endorsement.</p>math.OC