Unlock your potential with Microsoft Copilot
Get things done faster and unleash your creativity with the power of AI anywhere you go.
Proximal-Gradient Homotopy Method for Sparse Least Squares
Proximal-gradient homotopy is an efficient numerical method for solving the L1-regularized least-squares problem—minimize_x (1/2) ||A*x-b||_2^2 + lambda*||x||_1—where A is an m-by-n matrix, and lambda is a positive regularization parameter. Last published: March 23, 2012.
Important! Selecting a language below will dynamically change the complete page content to that language.
Version:
1.0
Date Published:
5/12/2016
File Name:
PGH4SLS.zip
File Size:
19.8 KB
Proximal-gradient homotopy is an efficient numerical method for solving the L1-regularized least-squares problem—minimize_x (1/2) ||A*x-b||_2^2 + lambda*||x||_1—where A is an m-by-n matrix, and lambda is a positive regularization parameter. This method is especially effective for sparse recovery applications in which the dimensions satisfies m < n and the optimal solution x* is provably sparse. The implementation in MATLAB can solve the more general problem—minimize_x f(x) + lambda*R(x)—where f(x) is a differentiable convex function and R(x) is a simple convex function whose proximal mapping can be computed efficiently.Supported Operating Systems
Windows 10, Windows 7, Windows 8
- Windows 7, Windows 8, or Windows 10
- Click Download and follow the instructions.