Linearized Augmented Lagrangian Method For Sparse Solution Of Underdetermined Linear Equations
Jian-Jun Zhang, Su-Feng Yue
Abstract
Jian-Jun Zhang, Su-Feng Yue
Abstract
In this paper, we consider to find the sparest solution of the large underdetermined system of linear equations y = Ax with nonnegative constraint x ≥ 0. Such problems are frequently encountered in signal and image processing, in handling of multispectral data, considering nonnegative factorization for recognition. Based on the classical augmented Lagrangian method, we propose an efficient linearized augmented Lagrangian method for this problem. The convergence theorem of the proposed method is given. Experimental results are given to illustrate feasibility and effectiveness of our method.
A significance statement is not available in the OpenAlex record.
A contribution statement is not available in the OpenAlex record.
Method details are not available in the OpenAlex metadata.
Findings are not separately available in the OpenAlex metadata.
Limitations are not available in the OpenAlex metadata.
Application details are not available in the OpenAlex metadata.
In this paper, we consider to find the sparest solution of the large underdetermined system of linear equations y = Ax with nonnegative constraint x ≥ 0. Such problems are frequently encountered in signal and image processing, in handling of multispectral data, considering nonnegative factorization for recognition. Based on the classical augmented Lagrangian method, we propose an efficient linearized augmented Lagrangian method for this problem. The convergence theorem of the proposed method is given. Experimental results are given to illustrate feasibility and effectiveness of our method.
Key concepts: Underdetermined system, Augmented Lagrangian method, Constraint (computer-aided design), Convergence (economics), Overdetermined system, Karush–Kuhn–Tucker conditions, Lagrangian, Applied mathematics