Application of Linearized Alternating Direction Multiplier Method in Dictionary Learning ()

Xiaoli Yu^{}

School of Science, School of Science and Technology, Shanghai University of Technology, Shanghai, China.

**DOI: **10.4236/jamp.2019.71012
PDF
HTML XML
776
Downloads
1,602
Views
Citations

School of Science, School of Science and Technology, Shanghai University of Technology, Shanghai, China.

The Alternating Direction Multiplier Method (ADMM) is widely used in various fields, and different variables are customized in the literature for different application scenarios [1] [2] [3] [4]. Among them, the linearized alternating direction multiplier method (LADMM) has received extensive attention because of its effectiveness and ease of implementation. This paper mainly discusses the application of ADMM in dictionary learning (non-convex problem). Many numerical experiments show that to achieve higher convergence accuracy, the convergence speed of ADMM is slower, especially near the optimal solution. Therefore, we introduce the linearized alternating direction multiplier method (LADMM) to accelerate the convergence speed of ADMM. Specifically, the problem is solved by linearizing the quadratic term of the subproblem, and the convergence of the algorithm is proved. Finally, there is a brief summary of the full text.

Keywords

Alternating Direction Multiplier Method, Dictionary Learning, Linearized Alternating Direction Multiplier, Non-Convex Optimization, Convergence

Share and Cite:

Yu, X. (2019) Application of Linearized Alternating Direction Multiplier Method in Dictionary Learning. *Journal of Applied Mathematics and Physics*, **7**, 138-147. doi: 10.4236/jamp.2019.71012.

1. Introduction

With the development of technology, data collection and processing have become easier, and many areas involve high-dimensional data issues, such as information technology, economic finance, and data modeling. Faced with such huge data, many researchers have proposed different solutions, and compressed sensing and sparsity has become an effective algorithm, because sparsity reduces the dimensionality of data in a certain sense and alternates direction multiplier method (ADMM) [5] . It is a typical idea of using divide-and-conquer, which is to transform the original high-dimensional problem into two or more low-dimensional problem-solving algorithms, which is in line with the processing requirements of big data. However, the traditional ADMM is prone to the local best of the problem. The linear model has a simple structure, which is relatively basic, easy to handle, and widely used. There are many phenomena in real life that can be approximated by a linear model, for example, the relationship between per capita disposable income and consumer spending. Generally speaking, the higher the per capita disposable income X is, the higher the corresponding consumption expenditure Y is. The main advantage of the new algorithm is that it can make the sub-problem have a display solution and be easier to solve, which is of great significance in the application of many problems.

2. Introduction to the Method

The ADMM algorithm was first proposed by Gabay, Meicher and Glowinski in the mid-1970 [6] [7] [8] . A similar idea originated in the mid-1950s. A large number of articles analyzed the nature of this method, but ADMM was used to solve the problem of partial differential equations. Now ADMM is mainly used to solve the optimization problem with separable variables, which solves the problem that the augmented Lagrangian algorithm with good properties can’t solve. It can be parallelized, which speeds up the solution. The convergence and convergence rate of ADMM for convex optimization problems with two separable variables. Although there is a mature theoretical analysis, the convergence problem of convex optimization problems extended to more than three separable variables has not been improved in a good solution. Then ADMM is also a public problem for non-convex optimization problems. There have been many applications showing the effectiveness of ADMM for non-convex problems. Can ADMM be applied to more optimization problems and more non-convex optimization problems? What is the effect? This article will introduce the application of ADMM in non-convex optimization problems.

First consider the convex optimization problem with equality constraints

$\mathrm{min}f\left(x\right)\text{\hspace{0.17em}}\text{\hspace{0.17em}}\text{\hspace{0.17em}}\text{\hspace{0.17em}}\text{\hspace{0.17em}}\text{s}\text{.t}\text{.}\text{\hspace{0.17em}}Ax=b$ (1)

where $x\in {R}^{n},A\in {R}^{m\times n},f:{R}^{n}\to R$ is a convex function.

Firstly, an optimization algorithm with good properties is introduced, which augments the Lagrangian multiplier method. The augmented Lagrangian function is defined as:

${L}_{\rho}\left(x,\lambda \right)=f\left(x\right)-{\lambda}^{\text{T}}\left(Ax-b\right)+\left(\rho /2\right){\Vert Ax-b\Vert}_{2}^{2},$ (2)

where $\rho >0$ is called the penalty parameter. when $\rho =0$ , ${L}_{0}$ is the Lagrangian function. The iterative steps of the augmented Lagrangian multiplier method are:

$\begin{array}{l}{x}^{\left(k+1\right)}:=\mathrm{arg}\mathrm{min}{L}_{\rho}\left(x,{\lambda}^{k}\right)\\ {\lambda}^{k+1}:={\lambda}^{k}-\rho \left(A{x}^{k+1}-b\right)\end{array}$ (3)

where $\lambda $ is the Lagrangian multiplier, i.e. the dual variable.

The advantage of this algorithm is that the convergence of the iterative sequence can be guaranteed without too strong conditions. For example, for the penalty parameter, it is not required to increase to infinity in the iterative process, and a fixed value can be taken. But the disadvantage of this algorithm is that when the objective function is separable, the model becomes:

$\begin{array}{l}\mathrm{min}f\left(x\right)+g\left(y\right)\\ \text{s}\text{.t}\text{.}\text{\hspace{0.17em}}\text{\hspace{0.17em}}Ax+By=b\end{array}$ (4)

where g is also a convex function. In the x iteration step, the augmented Lagrangian function ${L}_{\rho}$ is inseparable, and the discrete variables cannot be solved in parallel for the x subproblem. This leads to the ADMM algorithm we will discuss in the next section. The Alternating Direction Method (ADMM) is mainly used to solve the optimization problem with separable variables like (4), where $x\in {R}^{n},y\in {R}^{m},A\in {R}^{p\times n},B\in {R}^{p\times m},b\in {R}^{p}$ . Let’s assume that both f and g are convex functions, and then make other assumptions. Similar to the definition in the previous section, the augmented Lagrangian penalty function of (4) is:

${L}_{\rho}\left(x,y,\lambda \right)=f\left(x\right)+g\left(y\right)-{\lambda}^{\text{T}}\left(Ax+By-b\right)+\left(\rho /2\right){\Vert Ax+By-b\Vert}_{2}^{2}$ (5)

The steps of the ADMM algorithm iteration are as follows:

$\begin{array}{l}{x}^{k+1}:=\mathrm{arg}\mathrm{min}{L}_{\rho}\left(x,{y}^{k},{\lambda}^{k}\right)\\ {y}^{k+1}:=\mathrm{arg}\mathrm{min}{L}_{\rho}\left({x}^{k+1},y,{\lambda}^{k}\right)\\ {\lambda}^{k+1}:={\lambda}^{k}-\rho \left(A{x}^{\left(k+1\right)}+B{y}^{\left(k+1\right)}-b\right)\end{array}$ (6)

where $\rho >0$ . The similarity between the algorithm and the augmented Lagrangian multiplier method is to iteratively solve the variables x and y and then iteratively solve the dual variables.

If the augmented Lagrangian multiplier method is used for iterative solution:

$\begin{array}{l}\left({x}^{\left(k+1\right)},{y}^{\left(k+1\right)}:=\mathrm{arg}\mathrm{min}{L}_{\rho}\left(x,y,{\lambda}^{\left(k\right)}\right)\right)\\ {\lambda}^{k+1}:={\lambda}^{k}-\rho \left(A{x}^{\left(k+1\right)}+B{y}^{\left(k+1\right)}-b\right)\end{array}$ (7)

As mentioned in the previous section, you can see that the augmented Lagrangian multiplier method deals with two separate variables at the same time, and ADMM alternates the variables, which is the origin of the algorithm name. It can be considered that this is the use of Gauss-Seidel iterations on two variables. For details, please refer to. It is obvious from the algorithm framework that the ADMM algorithm is more suitable for solving the problem of having separate variables because the objective functions f and g are also separated.

To get a simpler form of ADMM, normalize the dual variable so that $\mu =\left(1/\rho \right)\lambda $ . Then the ADMM iteration becomes:

$\begin{array}{l}{x}^{\left(k+1\right)}:=\mathrm{arg}\mathrm{min}\left(f\left(x\right)+\left(\rho /2\right){\Vert Ax+B{y}^{\left(k\right)}-b+{\mu}^{\left(k\right)}\Vert}_{2}^{2}\right)\\ {y}^{\left(k+1\right)}:=\mathrm{arg}\mathrm{min}\left(g\left(y\right)+\left(\rho /2\right){\Vert A{x}^{k+1}+By-b+{\mu}^{\left(k\right)}\Vert}_{2}^{2}\right)\\ {\mu}^{\left(k+1\right)}:={\mu}^{\left(k\right)}-\left(A{x}^{\left(k+1\right)}+B{y}^{\left(k+1\right)}-b\right)\end{array}$ (8)

ADMM convergence: Regarding the convergence of ADMM, please refer to the literature.

3. Application of ADMM in Dictionary Learning

As we all know, the alternating direction method (ADMM) is one of the effective algorithms for solving large-scale sparse optimization problems. It is solved by splitting the problem into a number of low-dimensional sub-problems by augmented Lagrangian function construction. In recent years, a large number of working signals have pointed to the sparse expression of signals. Sparse expression refers to the use of a $D\in {R}^{m\times n}\left(m\ll n\right)$ dictionary, the dictionary contains nSignal atoms ${\left\{{d}_{j}\right\}}_{j=1}^{n}$ . A signal $y\in {R}^{m}$ can be expressed as a sparse linear representation of these signal atoms. In fact, the so-called sparse means that the number of non-zero coefficients is much smaller than that of n. Such a sparse representation may be a determined $y=Dx$ or an approximate representation with an error term ${\Vert y-Dx\Vert}_{p}\le \epsilon $ . The vector $x\in {R}^{n}$ is the signal y sparse expression coefficient. In practice, p often takes a value of 1, 2, or ∞.

If $m<n$ and the dictionary D is full rank, then the underdetermined system of the problem has an infinite number of solutions, and the solution using the least non-zero coefficient is one of them, and is the solution we hope to find. Sparse expression is expressed as a mathematical expression

$\left({P}_{0}\right)\text{\hspace{0.17em}}\text{\hspace{0.17em}}\mathrm{min}{\Vert x\Vert}_{0}\text{\hspace{0.17em}}\text{\hspace{0.17em}}\text{subject}\text{\hspace{0.17em}}\text{to}\text{\hspace{0.17em}}y=Dx$ (9)

Or

$\left({P}_{0}^{\u03f5}\right)\text{\hspace{0.17em}}\text{\hspace{0.17em}}\text{min}{\Vert x\Vert}_{0}\text{\hspace{0.17em}}\text{\hspace{0.17em}}\text{subject}\text{\hspace{0.17em}}\text{to}\text{\hspace{0.17em}}{\Vert y-Dx\Vert}_{2}\le \u03f5$ (10)

where ${\Vert \text{\hspace{0.05em}}\cdot \text{\hspace{0.05em}}\Vert}_{0}$ is ${\iota}_{0}$ ―module, which means that the corresponding vector takes a non-zero quantity.

Dictionary Design

Learn the dictionary based on the signal set. First given a data set $Y={\left\{{y}_{i}\right\}}_{i=1}^{L}$ , assuming that there is a dictionary D so that for a given signal can be represented as a sparse representation of the dictionary, i.e. for a given signal ${y}_{i}$ , the model $\left({P}_{0}\right)$ Or $\left({P}_{1}\right)$ can find the sparse coefficient ${x}_{i}$ . The question then is how to find such a dictionary D. Detailed reference can be found in the literature [9] .

The model of the problem can be written as:

${\mathrm{min}}_{D,X}\left\{{\Vert Y-Dx\Vert}_{F}^{2}\right\}\text{\hspace{0.17em}}\text{\hspace{0.17em}}\text{\hspace{0.17em}}\text{s}\text{.t}\text{.}\text{\hspace{0.17em}}{\Vert {x}_{i}\Vert}_{0}\le {\tau}_{0},\text{\hspace{0.17em}}i=1,\cdots ,L$ (11)

where ${\tau}_{0}$ is the upper bound of the coefficient sparsity, ${x}_{i}$ is the ith column of the coefficient matrix X, and ${\Vert \text{\hspace{0.05em}}\cdot \text{\hspace{0.05em}}\Vert}_{F}^{2}$ is the Frobenius norm of the matrix, i.e. the sum of the squares of the elements of the matrix.

Another model for dictionary learning is corresponding to the above model.

${\mathrm{min}}_{D,X}{\displaystyle {\sum}_{i=1}^{L}{\Vert {x}_{i}\Vert}_{0}}\text{\hspace{0.17em}}\text{\hspace{0.17em}}\text{\hspace{0.17em}}\text{s}\text{.t}\text{.}\text{\hspace{0.17em}}\left\{{\Vert Y-Dx\Vert}_{F}^{2}\right\}\le \u03f5$ (12)

$\u03f5$ is a fixed error value.

Before applying ADMM, first make some transformations to the model, let $Z=DX$ , then the model becomes:

${\mathrm{min}}_{D,X,Z}\left\{{\Vert Y-DX\Vert}_{F}^{2}\right\}\text{\hspace{0.17em}}\text{\hspace{0.17em}}\text{\hspace{0.17em}}\text{s}\text{.t}\text{.}\text{\hspace{0.17em}}Z=DX,\text{\hspace{0.17em}}{\Vert {x}_{i}\Vert}_{0}\le {\tau}_{0},\text{\hspace{0.17em}}\text{\hspace{0.17em}}i=1,\cdots ,L$ (13)

Then the augmented Lagrangian function of the problem is:

${L}_{\beta}\left(D,X,Z,\text{\Lambda}\right):={\Vert Y-DX\Vert}_{F}^{2}+\underset{i=1}{\overset{L}{{\displaystyle \sum}}}\langle {\text{\Lambda}}_{i},{\left(Z-DX\right)}_{i}\rangle +\frac{\beta}{2}{\Vert Z-DX\Vert}_{F}^{2}$ (14)

where $\Lambda $ is the Lagrange multiplier matrix and ${\text{\Lambda}}_{i}$ is the ith column of $\Lambda $ .

Using the ADMM algorithm in the above model, there is a X subproblem

$\underset{X}{\mathrm{min}}\underset{i=1}{\overset{L}{{\displaystyle \sum}}}\langle {\text{\Lambda}}_{i},{\left(Z-DX\right)}_{i}\rangle +\frac{\beta}{2}{\Vert Z-DX\Vert}_{F}^{2}\text{\hspace{0.17em}}\text{\hspace{0.17em}}\text{\hspace{0.17em}}\text{s}\text{.t}\text{.}\text{\hspace{0.17em}}{\Vert {x}_{i}\Vert}_{0}\le {\tau}_{0},\text{\hspace{0.17em}}\text{\hspace{0.17em}}i=1,\cdots ,L$ (15)

Equivalent to

${\mathrm{min}}_{X}\frac{\beta}{2}{\Vert Z+\text{\Lambda}/\beta -DX\Vert}_{F}^{2}\text{\hspace{0.17em}}\text{\hspace{0.17em}}\text{\hspace{0.17em}}\text{s}\text{.t}\text{.}\text{\hspace{0.17em}}{\Vert {x}_{i}\Vert}_{0}\le {\tau}_{0},\text{\hspace{0.17em}}\text{\hspace{0.17em}}i=1,\cdots ,L$ (16)

The Z subproblem is

${\mathrm{min}}_{Z}{\Vert Y-Z\Vert}_{F}^{2}+{\displaystyle {\sum}_{i=1}^{L}\langle {\text{\Lambda}}_{i},{\left(Z-DX\right)}_{i}\rangle}+\frac{\beta}{2}{\Vert Z-DX\Vert}_{F}^{2}$ (17)

This sub-question has a solution.

$Z=\left(\beta DX+2Y-\Lambda \right)/\left(2+\beta \right)$ (18)

D sub-problem is

${\mathrm{min}}_{D}\frac{\beta}{2}{\Vert Z+\Lambda /\beta -DX\Vert}_{F}^{2}$ (19)

$\Lambda $ updated to

${\Lambda}^{\left(k+1\right)}={\Lambda}^{\left(k\right)}+\gamma \beta \left(Z-DX\right)$ (20)

But ADL (ADMM for Dictionary Learning) is prone to the local best of the problem. Using linearization techniques, we extended LADMM to solve the problem of ADL local straits and proved the convergence of the algorithm. Numerical experiments are used to illustrate the effectiveness of the proposed algorithm.

4. Application of Linearized ADMM in Dictionary Learning

In order to apply ADMM, we can rewrite (11) into the following form

${\mathrm{min}}_{D,X}{\displaystyle {\sum}_{i=1}^{L}{\Vert {x}_{i}\Vert}_{0}}\text{\hspace{0.17em}}\text{\hspace{0.17em}}\text{\hspace{0.17em}}\text{s}\text{.t}\text{.}\text{\hspace{0.17em}}Y=DX$ (21)

Then the augmented Lagrangian function of the model (20) is

${L}_{\mu}\left(X,Y,\lambda \right)={\displaystyle {\sum}_{i=1}^{L}{\Vert {x}_{i}\Vert}_{0}}-{\lambda}^{\text{T}}\left(Y-DX\right)+\frac{\mu}{2}{\Vert Y-DX\Vert}_{2}^{2}$ (22)

The iterative method of ADMM is:

$\{\begin{array}{l}{X}^{k+1}=\mathrm{arg}\mathrm{min}{L}_{\mu}\left(X,{Y}^{k},{\lambda}^{k}\right)\\ {Y}^{k+1}=\mathrm{arg}\mathrm{min}{L}_{\mu}\left({X}^{k+1},Y,{\lambda}^{k}\right)\\ {\lambda}^{k+1}={\lambda}^{k}-\mu \left({Y}^{k+1}-D{X}^{k+1}\right)\end{array}$ (23)

Now, we solve the subproblem in (22). First we solve the X-sub problem.

$\begin{array}{c}{X}^{k+1}=\mathrm{arg}\mathrm{min}\left\{{\displaystyle {\sum}_{i=1}^{L}{\Vert {x}_{i}\Vert}_{0}}-{\left({\lambda}^{k}\right)}^{\text{T}}\left({Y}^{k}-DX\right)+\frac{\mu}{2}{\Vert {Y}^{k}-DX\Vert}_{2}^{2}\right\}\\ =\mathrm{arg}\mathrm{min}\left\{{\displaystyle {\sum}_{i=1}^{L}{\Vert {x}_{i}\Vert}_{0}}-{\left({\lambda}^{k}\right)}^{\text{T}}\left({Y}^{k}-DX\right)+\frac{\mu}{2}{\Vert {Y}^{k}-DX\Vert}_{2}^{2}\right\}\\ ={\displaystyle {\sum}_{i=1}^{L}{\Vert {x}_{i}\Vert}_{0}}+\frac{\mu}{2}{\Vert {Y}^{k}-DX-{\lambda}^{k}/\mu \Vert}_{2}^{2}\end{array}$ (24)

Because of the non-identity of matrix D, this subproblem does not show a solution. Inspired by [9] , we linearize this quadratic term $\frac{1}{2}{\Vert {Y}^{k}-DX-{\lambda}^{k}/\mu \Vert}_{2}^{2}$ as

${D}^{\text{T}}{\left(D{X}^{k}-{Y}^{k}-{\lambda}^{k}/\mu \right)}^{\text{T}}\left(X-{X}^{k}\right)+\frac{\rho}{2}{\Vert X-{X}^{k}\Vert}_{2}^{2}$ (25)

The parameter $\rho >0$ controls the degree of approximation of X and ${X}^{k}$ , then we solve the following problem and use the solution of this problem to approximate the solution of the subproblem generated by ADMM.

$\begin{array}{c}{X}^{k}=\mathrm{arg}\mathrm{min}\{{\displaystyle {\sum}_{i=1}^{L}{\Vert {x}_{i}\Vert}_{0}}+\frac{\mu \rho}{2}{\Vert X-{X}^{k}\Vert}_{2}^{2}\\ \text{\hspace{0.17em}}\text{\hspace{0.17em}}+\mu \left[{D}^{\text{T}}{\left(D{X}^{k}-{Y}^{k}-{\lambda}^{k}/\mu \right)}^{\text{T}}\left(X-{X}^{k}\right)\right]\}\\ =\mathrm{arg}\mathrm{min}\left\{{\displaystyle {\sum}_{i=1}^{L}{\Vert {x}_{i}\Vert}_{0}}+\frac{\mu \rho}{2}{\Vert X-{X}^{k}+{D}^{\text{T}}\left(D{X}^{k}-{Y}^{k}+{\lambda}^{k}/\mu \right)/\rho \Vert}_{2}^{2}\right\}\end{array}$ (26)

For the above problem, it is known from [9] medium (11)

$\begin{array}{c}{\left({x}_{i}\right)}^{k+1}=\mathrm{arg}\mathrm{min}\left\{\underset{i=1}{\overset{L}{{\displaystyle \sum}}}{\Vert {x}_{i}\Vert}_{0}+\frac{\mu \rho}{2}{\Vert {x}_{i}-{\left({X}^{k}-\frac{{D}^{\text{T}}\left(D{X}^{k}-{Y}^{k}-{\lambda}^{k}/\mu \right)}{\rho}\right)}_{i}\Vert}_{2}^{2}\right\}\\ =\text{shrink}\left({\left({X}^{k}-{D}^{\text{T}}\left(D{X}^{k}-{Y}^{k}-{\lambda}^{k}/\mu \right)/\rho \right)}_{i},\frac{\lambda}{\mu \rho}\right)\end{array}$ (27)

Furthermore, for the Y subproblem, the Equation (10) in [9] shows that the display solution is

${Y}^{k+1}={\text{shrink}}_{1,2}\left(D{X}^{k+1}-\frac{{\lambda}^{\kappa}}{\mu},\frac{1}{\mu}\right)$ (28)

As can be seen from the above discussion, the LADMM iterative algorithm can be described by the following table.

Convergence Proof

In this section, we will demonstrate that the LADMM algorithm is convergent. ${I}_{p}$ is the unit matrix of $p\times p$ . Let $S={R}^{p}\times {R}^{n+p}\times {R}^{n+p}$ and $\omega ={\left({\beta}^{\text{T}},{\gamma}^{\text{T}},{\alpha}^{\text{T}}\right)}^{\text{T}}$ , $f\left(\beta \right)\in \partial \left({\Vert \beta \Vert}_{2,1}\right)$ , $g\left(\gamma \right)\in \partial \left({\Vert \gamma \Vert}_{1}\right)$ . Solving the model is equivalent to finding $\left({\beta}^{*},{\gamma}^{*},{\alpha}^{*}\right)$ that satisfies the KKT condition of the model, i.e.

$\{\begin{array}{l}{\lambda}_{2}f\left({\beta}^{*}\right)-{\stackrel{\u02dc}{X}}^{\text{T}}{\alpha}^{*}=0\\ g\left({\gamma}^{*}\right)+{\alpha}^{*}=0\\ \stackrel{\u02dc}{X}{\beta}^{*}-\stackrel{\u02dc}{y}-{\gamma}^{*}=0\end{array}$ (29)

Let us remember that the set of elements that satisfy the above formula in S is ${S}^{*}$ . The KKT condition of the above formula can be written as the form of variational inequality (VI) as:

${\left(\omega -{\omega}^{*}\right)}^{\text{T}}F\left({\omega}^{*}\right)\ge 0,\text{\hspace{0.17em}}\text{\hspace{0.17em}}\forall \omega \in S,$ (30)

where

$F\left(\omega \right)=\left\{\begin{array}{c}{\lambda}_{2}f\left(\beta \right)-{\stackrel{\u02dc}{X}}^{\text{T}}\alpha \\ g\left(\gamma \right)+\alpha \\ \stackrel{\u02dc}{X}\beta -\stackrel{\u02dc}{y}-\gamma \end{array}\right\}$ (31)

In order to prove these conclusions, as well as the proof of convergence of LADMM, need to introduce some lemma. For details, please refer to the literature [9] .

5. Numerical Experiments

In this chapter, we will discuss the application of the algorithm in image deblur ring to prove the effectiveness of the algorithm. All experiments were carried out on a four-core notebook computer with Intel Intel(R) Core(TM) i5-7200UCPU @ 2.50 GHz and 4 GB memory. Procedures for this experiment, pictures are referenced [10] .

Figure 1 shows the application of ADMM algorithm in image deblurring, which has motion blur and Gaussian blur respectively. (“motion”, 35, 50), (“gaussian”, 20, 20).

The noise levels are delta = 0.256, 0.511 respectively. For comparison, we also include the results of FTVd v4.1 in [11] , which is the most advanced image deblurring algorithm. It can be seen from the pictures that our proposed algorithm and FTVd algorithm have the same quality as PSNR (Figure 2), and our algorithm does not need regularization operator.

$\text{PSNR}=10\cdot {\mathrm{log}}_{10}\frac{{255}^{2}}{\text{MSE}}\left[\text{dB}\right]$

MSE represents the average square error of each pixel.

6. Conclusions

In this paper, we propose a linearized alternating direction multiplier method

Figure 1. ADMM algorithm for deblurring.

Figure 2. LADMM algorithm for deblurring.

(LADMM) to solve the problem of rapid convergence of the dictionary model that is easy to fall into the local optimal solution. This model combines the advantages of linearization features to make sub-problems easier to solve. When the algorithm is applied to the problem of image reconstruction, we use the quadratic term of the linearized sub-problem to make the sub-problem easier to solve.

Moreover, in the case of similar PSNR, the algorithm does not need regularization operator.

In addition, we analyze the convergence of the LADMM algorithm. Our next step is to generalize the model to more non-convex problems (non-negative matrix factorization problems) and use practical problems.

Conflicts of Interest

The authors declare no conflicts of interest regarding the publication of this paper.

[1] |
Boyd, S., Parikh, N., Chu, E., Peleato, B. and Eckstein, J. (2010) Distributed Optimization and Statistical Learning via the Alternating Direction Method of Multipliers. Foundations and Trends® in Machine Learning, 3, 1-122. https://doi.org/10.1561/2200000016 |

[2] | Nadai E. (2011) Statistics for High-Dimensional Data: Methods, Theory and Applicatios. Springer, Berlin. |

[3] |
Wu, Z.M. (2016) Linearized Alternating Direction Method for Solving Separable Convex Optimization Problems. https://wenku.baidu.com/view/7aff15227ed5360cba1aa8114431b90d6c8589e3.html |

[4] |
Fu, X.L., He, B.H., Wang, X.F., et al. (2014) Block-Wise Alternating Direction Method of Multipliers with Gaussian Back Substitution for Multiple-Block Convex Programming. 1-37. http://xueshu.baidu.com/usercenter/paper/show?paperid=4cb7be88f0f61a585690896f1da8bf31&site=xueshu_se |

[5] | Wang, H.F. and Kong, L.C. (2017) The Linearized Alternating Direction Method of Multipliers for Sparse Group LAD Model. Beijing Jiaotong University, Beijing. |

[6] |
Eckstein, J. (2016) Approximate ADMM Algorithms Derived from Lagrangian Splitting. Computational Optimization and Applications, 68, 363-405. https://doi.org/10.1007/s10589-017-9911-z |

[7] | Haubruge, S., Nguyen, V.H. and Strodiot, J.J. (1998) Convergence Analysis and Applications of the Glowinski—Le Tallec Splitting Method for Finding a Zero of the Sum of Two Maximal Monotone Operators. Journal of Optimization Theory and Applications, 97, 645-673. |

[8] | Glowinski, R. and Marroco, A. (1975) Sur l’approximation, par éléments finis d’ordre un, et la résolution, par Pénalisation-Dualité d’une classe de problèmes de Dirichlet non linéaires. Journal of Equine Veterinary Science, 2, 41-76. |

[9] |
Wang, H.F. (2017) Linearized Multiplier Alternating Direction Method for Solving Least Degree Model of Sparse Group. https://wenku.baidu.com/view/f25e8ff1d5d8d15abe23482fb4daa58da0111c9c.html |

[10] |
Jiao, Y.L., Jin, Q.N., Lu, X.L., et al. (2016) Alternating Direction Method of Multipliers for Linear Inverse Problems. SIAM Journal on Numerical Analysis, 54, 2114-2137. https://doi.org/10.1137/15M1029308 |

[11] | Wang, Y.L., Yang, J.F., Yin, W.T., et al. (2016) A New Alternating Minimization Algorithm for Total Variation Image Reconstruction. SIAM Journal on Imaging Sciences, 1, 248–272. |

Journals Menu

Contact us

+1 323-425-8868 | |

customer@scirp.org | |

+86 18163351462(WhatsApp) | |

1655362766 | |

Paper Publishing WeChat |

Copyright © 2024 by authors and Scientific Research Publishing Inc.

This work and the related PDF file are licensed under a Creative Commons Attribution 4.0 International License.