Paper
A comparative numerical study of graph-based splitting algorithms for linear subspaces
Authors
Francisco J. Aragón-Artacho, Rubén Campoy, Irene López-Larios, César López-Pastor
Abstract
In this note, we test the performance of six algorithms from the family of graph-based splitting methods [SIAM J. Optim., 34 (2024), pp. 1569-1594] specialized to normal cones of linear subspaces. To do this, we first implement some numerical experiments to determine the best relaxation parameter for each algorithm. Then, we compare the number of iterations each algorithm requires to reach a given stopping criterion, using the previously identified best relaxation parameter. The numerical results allow us to identify some relevant patterns and provide numerical evidence that may guide further theoretical analysis.
Metadata
Related papers
Fractal universe and quantum gravity made simple
Fabio Briscese, Gianluca Calcagni • 2026-03-25
POLY-SIM: Polyglot Speaker Identification with Missing Modality Grand Challenge 2026 Evaluation Plan
Marta Moscati, Muhammad Saad Saeed, Marina Zanoni, Mubashir Noman, Rohan Kuma... • 2026-03-25
LensWalk: Agentic Video Understanding by Planning How You See in Videos
Keliang Li, Yansong Li, Hongze Shen, Mengdi Liu, Hong Chang, Shiguang Shan • 2026-03-25
Orientation Reconstruction of Proteins using Coulomb Explosions
Tomas André, Alfredo Bellisario, Nicusor Timneanu, Carl Caleman • 2026-03-25
The role of spatial context and multitask learning in the detection of organic and conventional farming systems based on Sentinel-2 time series
Jan Hemmerling, Marcel Schwieder, Philippe Rufin, Leon-Friedrich Thomas, Mire... • 2026-03-25
Raw Data (Debug)
{
"raw_xml": "<entry>\n <id>http://arxiv.org/abs/2603.04231v1</id>\n <title>A comparative numerical study of graph-based splitting algorithms for linear subspaces</title>\n <updated>2026-03-04T16:10:58Z</updated>\n <link href='https://arxiv.org/abs/2603.04231v1' rel='alternate' type='text/html'/>\n <link href='https://arxiv.org/pdf/2603.04231v1' rel='related' title='pdf' type='application/pdf'/>\n <summary>In this note, we test the performance of six algorithms from the family of graph-based splitting methods [SIAM J. Optim., 34 (2024), pp. 1569-1594] specialized to normal cones of linear subspaces. To do this, we first implement some numerical experiments to determine the best relaxation parameter for each algorithm. Then, we compare the number of iterations each algorithm requires to reach a given stopping criterion, using the previously identified best relaxation parameter. The numerical results allow us to identify some relevant patterns and provide numerical evidence that may guide further theoretical analysis.</summary>\n <category scheme='http://arxiv.org/schemas/atom' term='math.NA'/>\n <published>2026-03-04T16:10:58Z</published>\n <arxiv:primary_category term='math.NA'/>\n <author>\n <name>Francisco J. Aragón-Artacho</name>\n </author>\n <author>\n <name>Rubén Campoy</name>\n </author>\n <author>\n <name>Irene López-Larios</name>\n </author>\n <author>\n <name>César López-Pastor</name>\n </author>\n </entry>"
}