Showing math.OCShow all
2 papers · 1 filter
math.OC2025
A flexible block-coordinate forward-backward algorithm for non-smooth and non-convex optimization
Luis Briceño-Arias, Paulo Gonçalves, Guillaume Lauga +2
Block coordinate descent (BCD) methods are prevalent in large scale optimization problems due to the low memory and computational costs per iteration, the predisposition to paralle…
math.OC2025
Butterfly factorization with error guarantees
Quoc-Tung Le, Léon Zheng, Elisa Riccietti +1
In this paper, we investigate the butterfly factorization problem, i.e., the problem of approximating a matrix by a product of sparse and structured factors. We propose a new forma…