2018Unpublished venueRequires access

Linearized Augmented Lagrangian Method For Sparse Solution Of Underdetermined Linear Equations

Jian-Jun Zhang, Su-Feng Yue

Open publisher page 0 citations

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.

About this research paper

What this paper is about

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.

Why it matters

A significance statement is not available in the OpenAlex record.

Key contribution

A contribution statement is not available in the OpenAlex record.

Method / approach

Method details are not available in the OpenAlex metadata.

Main findings

Findings are not separately available in the OpenAlex metadata.

Limitations

Limitations are not available in the OpenAlex metadata.

Applications

Application details are not available in the OpenAlex metadata.

Available 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.

Key concepts: Underdetermined system, Augmented Lagrangian method, Constraint (computer-aided design), Convergence (economics), Overdetermined system, Karush–Kuhn–Tucker conditions, Lagrangian, Applied mathematics

Related papers

Back to paper searchBrowse research topicsOriginal source
Linearized Augmented Lagrangian Method For Sparse Solution Of Underdetermined Linear Equations — Research Paper | ScholarLens