Variable Projected Augmented Lagrangian Methods for Generalized Lasso Problems
By: Stefano Aleotti , Davide Bianchi , Florian Bossmann and more
Potential Business Impact:
Makes computer pictures clearer and faster.
We introduce variable projected augmented Lagrangian (VPAL) methods for solving generalized nonlinear Lasso problems with improved speed and accuracy. By eliminating the nonsmooth variable via soft-thresholding, VPAL transforms the problem into a smooth reduced formulation. For linear models, we develop a preconditioned variant that mimics Newton-type updates and yields significant acceleration. We prove convergence guarantees for both standard and preconditioned VPAL under mild assumptions and show that variable projection leads to sharper convergence and higher solution quality. The method seamlessly extends to nonlinear inverse problems, where it outperforms traditional approaches in applications such as phase retrieval and contrast enhanced MRI (LIP-CAR). Across tasks including deblurring, inpainting, and sparse-view tomography, VPAL consistently delivers state-of-the-art reconstructions, positioning variable projection as a powerful tool for modern large-scale inverse problems.
Similar Papers
Variable projection framework for the reduced-rank matrix approximation problem by weighted least-squares
Numerical Analysis
Makes computers find patterns in big data faster.
A proximal augmented Lagrangian method for nonconvex optimization with equality and inequality constraints
Optimization and Control
Solves hard math problems faster and more reliably.
Inexact Projected Preconditioned Gradient Methods with Variable Metrics: General Convergence Theory via Lyapunov Approach
Optimization and Control
Solves hard math problems faster for science.