Sitemap
A list of all the posts and pages found on the site. For you robots out there, there is an XML version available for digesting as well.
Pages
Posts
Future Blog Post
Published:
This post will show up by default. To disable scheduling of future posts, edit config.yml and set future: false.
Blog Post number 4
Published:
This is a sample blog post. Lorem ipsum I can’t remember the rest of lorem ipsum and don’t have an internet connection right now. Testing testing testing this blog post. Blog posts are cool.
Blog Post number 3
Published:
This is a sample blog post. Lorem ipsum I can’t remember the rest of lorem ipsum and don’t have an internet connection right now. Testing testing testing this blog post. Blog posts are cool.
Blog Post number 2
Published:
This is a sample blog post. Lorem ipsum I can’t remember the rest of lorem ipsum and don’t have an internet connection right now. Testing testing testing this blog post. Blog posts are cool.
Blog Post number 1
Published:
This is a sample blog post. Lorem ipsum I can’t remember the rest of lorem ipsum and don’t have an internet connection right now. Testing testing testing this blog post. Blog posts are cool.
portfolio
Portfolio item number 1
Short description of portfolio item number 1
Portfolio item number 2
Short description of portfolio item number 2
publications
Fast-Forwarding Stalling in Dykstra’s Algorithm
Published in arXiv preprint arXiv:2511.18132, 2025
Constrained quadratic programs and Euclidean projections are ubiquitous in engineering, arising in machine learning, estimation, control, and signal processing. Dykstra’s algorithm is an iterative scheme for computing the Euclidean projection of an initial point onto the intersection of convex sets by successively projecting onto each set. Its low per-iteration computational cost makes it well-suited for solving large-scale or real-time problems where traditional optimisation routines become computationally burdensome. Despite its strong convergence guarantees, Dykstra’s algorithm is known to suffer from stalling – arbitrarily long intervals during which the primal iterates remain constant – rendering its runtime unpredictable and severely limiting its applicability in time-critical settings. Focusing on polyhedral constraint sets, we derive a closed-form solution for the length of the stalling period once stalling is detected. This result enables a modified, stall-averse version of Dykstra’s algorithm that fast-forwards the stalling period via a single, inexpensive update while preserving convergence guarantees. Numerical experiments demonstrate substantial improvements in convergence behaviour, establishing the proposed method as a practical enhancement for a broad class of projection-based algorithms.
Recommended citation: Claudio Vestini, Idris Kempf. (2025). "Fast-Forwarding Stalling in Dykstra's Algorithm." arXiv preprint arXiv:2511.18132.
Download Paper
talks
Talk 1 on Relevant Topic in Your Field
Published:
This is a description of your talk, which is a markdown file that can be all markdown-ified like any other post. Yay markdown!
Conference Proceeding talk 3 on Relevant Topic in Your Field
Published:
This is a description of your conference proceedings talk, note the different field in type. You can put anything in this field.
teaching
Teaching experience 1
Undergraduate course, University 1, Department, 2014
This is a description of a teaching experience. You can use markdown like any other post.
Teaching experience 2
Workshop, University 1, Department, 2015
This is a description of a teaching experience. You can use markdown like any other post.