A fast matrix completion method based on truncated $ {\mathit{L}}_{2, 1} $ norm minimization

Zhengyu Liu; Yufei Bao; Changhai Wang; Xiaoxiao Chen; Qing Liu; Zhengyu Liu; Yufei Bao; Changhai Wang; Xiaoxiao Chen; Qing Liu

doi:10.3934/era.2024095

Electronic Research Archive

2024, Volume 32, Issue 3: 2099-2119. doi: 10.3934/era.2024095

Previous Article Next Article

Research article Special Issues

A fast matrix completion method based on truncated ${\mathit{L}}_{2, 1}$ norm minimization

1.
School of Electronics and Information Engineering, West Anhui University, Lu'an 237012, China
2.
School of Mathematics and Big Data, Anhui University of Science and Technology, Huai'nan 232001, China
3.
Software Engineering College, Zhengzhou University of Light Industry, No.136 Science Avenue, Zhengzhou 450000, China

Received: 05 January 2024 Revised: 08 February 2024 Accepted: 29 February 2024 Published: 07 March 2024

In recent years, a truncated nuclear norm regularization (TNNR) method has obtained much attention from researchers in machine learning and image processing areas, because it is much more accurate on matrices with missing data than other traditional methods based on nuclear norm. However, the TNNR method is reported to be very slow, due to its large number of singular value decomposition (SVD) iterations. In this paper, a truncated ${\boldsymbol{L}}_\bf{2, 1}$ norm minimization method was presented for fast and accurate matrix completion, which is abbreviated as TLNM. In the proposed TLNM method, the truncated nuclear norm minimization model of TNNR was improved to a truncated ${\boldsymbol{L}}_\bf{2, 1}$ norm minimization model that aimed to optimize the truncated ${\boldsymbol{L}}_\bf{2, 1}$ Norm and a weighted noisy matrix simultaneously for improving the accuracy of TLNM. Using Qatar Riyal (QR) decomposition to calculate the orthogonal bases for reconstructing recovery results, the proposed TLNM method is much faster than the TNNR method. Adequate results for color images validate the effectiveness and efficiency of TLNM comparing with TNNR and other competing methods.

Keywords:

Citation: Zhengyu Liu, Yufei Bao, Changhai Wang, Xiaoxiao Chen, Qing Liu. A fast matrix completion method based on truncated ${\mathit{L}}_{2, 1}$ norm minimization[J]. Electronic Research Archive, 2024, 32(3): 2099-2119. doi: 10.3934/era.2024095

Related Papers:

[1]	P. Pirmohabbati, A. H. Refahi Sheikhani, H. Saberi Najafi, A. Abdolahzadeh Ziabari . Numerical solution of full fractional Duffing equations with Cubic-Quintic-Heptic nonlinearities. AIMS Mathematics, 2020, 5(2): 1621-1641. doi: 10.3934/math.2020110
[2]	SAIRA, Wenxiu Ma, Suliman Khan . An efficient numerical method for highly oscillatory logarithmic-algebraic singular integrals. AIMS Mathematics, 2025, 10(3): 4899-4914. doi: 10.3934/math.2025224
[3]	Kai Wang, Guicang Zhang . Curve construction based on quartic Bernstein-like basis. AIMS Mathematics, 2020, 5(5): 5344-5363. doi: 10.3934/math.2020343
[4]	Taher S. Hassan, Amir Abdel Menaem, Hasan Nihal Zaidi, Khalid Alenzi, Bassant M. El-Matary . Improved Kneser-type oscillation criterion for half-linear dynamic equations on time scales. AIMS Mathematics, 2024, 9(10): 29425-29438. doi: 10.3934/math.20241426
[5]	Dexin Meng . Wronskian-type determinant solutions of the nonlocal derivative nonlinear Schrödinger equation. AIMS Mathematics, 2025, 10(2): 2652-2667. doi: 10.3934/math.2025124
[6]	Samia BiBi, Md Yushalify Misro, Muhammad Abbas . Smooth path planning via cubic GHT-Bézier spiral curves based on shortest distance, bending energy and curvature variation energy. AIMS Mathematics, 2021, 6(8): 8625-8641. doi: 10.3934/math.2021501
[7]	Chunli Li, Wenchang Chu . Remarkable series concerning $ \binom{3n}{n} $ and harmonic numbers in numerators. AIMS Mathematics, 2024, 9(7): 17234-17258. doi: 10.3934/math.2024837
[8]	Beatriz Campos, Alicia Cordero, Juan R. Torregrosa, Pura Vindel . Dynamical analysis of an iterative method with memory on a family of third-degree polynomials. AIMS Mathematics, 2022, 7(4): 6445-6466. doi: 10.3934/math.2022359
[9]	A. Palanisamy, J. Alzabut, V. Muthulakshmi, S. S. Santra, K. Nonlaopon . Oscillation results for a fractional partial differential system with damping and forcing terms. AIMS Mathematics, 2023, 8(2): 4261-4279. doi: 10.3934/math.2023212
[10]	Tongzhu Li, Ruiyang Lin . Classification of Möbius homogeneous curves in $ \mathbb{R}^4 $. AIMS Mathematics, 2024, 9(8): 23027-23046. doi: 10.3934/math.20241119

Abstract

1. Introduction

We consider the following family of nonlinear oscillators

$\begin{equation} y_{zz}+k(y)y_{z}^{3}+h(y)y_{z}^{2}+f(y)y_{z}+g(y) = 0, \end{equation}$

(1.1)

where $k$ , $h$ , $f\neq0$ and $g\neq0$ are arbitrary sufficiently smooth functions. Particular members of (1.1) are used for the description of various processes in physics, mechanics and so on and they also appear as invariant reductions of nonlinear partial differential equations ^[1,2,3].

Integrability of (1.1) was studied in a number of works ^{[4,5,6,7,8,9,10,11,12,13,14,15,16]}. In particular, in ^[15] linearization of (1.1) via the following generalized nonlocal transformations

$\begin{equation} w = F(y), \quad d\zeta = (G_{1}(y)y_{z}+G_{2}(y))dz. \end{equation}$

(1.2)

was considered. However, equivalence problems with respect to transformations (1.2) for (1.1) and its integrable nonlinear subcases have not been studied previously. Therefore, in this work we deal with the equivalence problem for (1.1) and its integrable subcase from the Painlevé-Gambier classification. Namely, we construct an equivalence criterion for (1.1) and a non-canonical form of Ince Ⅶ equation ^[17,18]. As a result, we obtain two new integrable subfamilies of (1.1). What is more, we demonstrate that for any equation from (1.1) that satisfy one of these equivalence criteria one can construct an autonomous first integral in the parametric form. Notice that we use Ince Ⅶ equation because it is one of the simplest integrable members of (1.1) with known general solution and known classification of invariant curves.

Moreover, we show that transformations (1.2) preserve autonomous invariant curves for equations from (1.1). Since the considered non-canonical form of Ince Ⅶ equation admits two irreducible polynomial invariant curves, we obtain that any equation from (1.1), which is equivalent to it, also admits two invariant curves. These invariant curves can be used for constructing an integrating factor for equations from (1.1) that are equivalent to Ince Ⅶ equation. If this integrating factor is Darboux one, then the corresponding equation is Liouvillian integrable ^[19]. This demonstrates the connection between nonlocal equivalence approach and Darboux integrability theory and its generalizations, which has been recently discussed for a less general class of nonlocal transformations in ^[20,21,22].

The rest of this work is organized as follows. In the next Section we present an equivalence criterion for (1.1) and a non-canonical form of the Ince Ⅶ equation. In addition, we show how to construct an autonomous first integral for an equation from (1.1) satisfying this equivalence criterion. We also demonstrate that transformations (1.2) preserve autonomous invariant curves for (1.1). In Section 3 we provide two examples of integrable equations from (1.1) and construct their parametric first integrals, invariant curves and integrating factors. In the last Section we briefly discuss and summarize our results.

2. Main results

We begin with the equivalence criterion between (1.1) and a non-canonical form of the Ince Ⅶ equation, that is ^[17,18]

$\begin{equation} w_{\zeta\zeta}+3w_{\zeta}+\epsilon w^{3}+2w = 0. \end{equation}$

(2.1)

Here $\epsilon\neq0$ is an arbitrary parameter, which can be set, without loss of generality, to be equal to $\pm 1$ .

The general solution of (1.1) is

$\begin{equation} w = {\rm e}^{-(\zeta-\zeta_{0})}\rm{cn}\left\{\sqrt{\epsilon}({\rm e}^{-(\zeta-\zeta_{0})}-C_{1}),\frac{1}{\sqrt{2}}\right\}. \end{equation}$

(2.2)

Here $\zeta_{0}$ and $C_{1}$ are arbitrary constants and $\rm{cn}$ is the Jacobian elliptic cosine. Expression (2.2) will be used below for constructing autonomous parametric first integrals for members of (1.1).

The equivalence criterion between (1.1) and (2.1) can be formulated as follows:

Theorem 2.1. Equation (1.1) is equivalent to (2.1) if and only if either

$\begin{equation} \begin{gathered} (I)\quad 25515lgp^{2}q_{y}+2352980l^{10}+\left(3430q-6667920p^{3}\right) l^{5}\\ -14580qp^{3}-10q^{2}-76545lgqpp_{y} = 0, \end{gathered} \end{equation}$

(2.3)

$\begin{equation} \begin{gathered} (II)\quad 343l^{5}-972p^{3} = 0, \end{gathered} \end{equation}$

(2.4)

holds. Here

$\begin{equation} \begin{gathered} l = 9(fg_{y}-gf_{y}+fgh-3kg^{2})-2f^{3}, \quad p = gl_{y}-3lg_{y}+l(f^{2}-3gh),\\ q = 25515g_{y}lp^{2}-5103lgpp_{y}+686l^{5}-8505p^{2}\left( f^{2}-3gh \right) l+6561p^{3}. \end{gathered} \end{equation}$

(2.5)

The expression for $G_{2}$ in each case is either

$\begin{equation} (I) \quad G_{2} = \frac {126 l^{2}qp^{2}}{470596 l^{10}- \left( 1333584 p^{3}+1372 q \right) l^{5}+q^{2}}, \end{equation}$

(2.6)

$\begin{equation} (II) \quad G_{2}^{2} = -\frac{49l^{3}G_{2}+9p^{2}}{189pl}. \end{equation}$

(2.7)

In all cases the functions $F$ and $G_{1}$ are given by

$\begin{equation} F^{2} = \frac{l}{81\epsilon G_{2}^{3}}, \quad G_{1} = \frac{G_{2}(f-3G_{2})}{3g}. \end{equation}$

(2.8)

Proof. We begin with the necessary conditions. Substituting (1.2) into (2.1) we get

$\begin{equation} y_{zz}+k(y)y_{z}^{3}+h(y)y_{z}^{2}+f(y)y_{z}+g(y) = 0, \end{equation}$

(2.9)

where

$\begin{equation} \begin{gathered} k = \frac{FG_{1}^{3}(\epsilon F^{2}+2)+3G_{1}^{2}F_{y}+G_{1}F_{yy}-F_{y}G_{1,y}}{G_{2}F_{y}}, \\ h = \frac{G_{2}F_{yy}+(6G_{1}G_{2}-G_{2,y})F_{y}+3FG_{2}G_{1}^{2}(\epsilon F^{2}+2)}{G_{2}F_{y}},\\ f = \frac{3G_{2}(F_{y}+FG_{1}(\epsilon F^{2}+2))}{F_{y}}, \quad g = \frac{FG_{2}^{2}(\epsilon F^{2}+2)}{F_{y}}. \end{gathered} \end{equation}$

(2.10)

As a consequence, we obtain that (1.1) can be transformed into (2.1) if it is of the form (2.9) (or (1.1)).

Conversely, if the functions $F$ , $G_{1}$ and $G_{2}$ satisfy (2.10) for some values of $k$ , $h$ , $f$ and $g$ , then (1.1) can be mapped into (2.1) via (1.2). Thus, we see that the compatibility conditions for (2.10) as an overdertmined system of equations for $F$ , $G_{1}$ and $G_{2}$ result in the necessary and sufficient conditions for (1.1) to be equivalent to (2.1) via (1.2).

To obtain the compatibility conditions, we simplify system (2.10) as follows. Using the last two equations from (2.10) we find the expression for $G_{1}$ given in (2.8). Then, with the help of this relation, from (2.10) we find that

$\begin{equation} 81\epsilon F^{2}G_{2}^{3}-l = 0, \end{equation}$

(2.11)

and

$\begin{equation} \begin{gathered} 567lG_{2}^{3}+(243lgh-81lf^{2}-81gl_{y}+243lg_{y})G_{2}-7l^{2} = 0,\\ 243lgG_{2,y}+324lG_{2}^{3}-81gl_{y}G_{2}+2l^{2} = 0, \end{gathered} \end{equation}$

(2.12)

Here $l$ is given by (2.5).

As a result, we need to find compatibility conditions only for (2.12). In order to find the generic case of this compatibility conditions, we differentiate the first equation twice and find the expression for $G_{2}^{2}$ and condition (2.3). Differentiating the first equation from (2.12) for the third time, we obtain (2.6). Further differentiation does not lead to any new compatibility conditions. Particular case (2.4) can be treated in the similar way.

Finally, we remark that the cases of $l = 0$ , $p = 0$ and $q = 0$ result in the degeneration of transformations (1.2). This completes the proof.

As an immediate corollary of Theorem 2.1 we get

Corollary 2.1. If coefficients of an equation from (1.1) satisfy either (2.3) or (2.4), then an autonomous first integral of this equation can be presented in the parametric form as follows:

$\begin{equation} y = F^{-1}(w), \quad y_{z} = \frac{G_{2}w_{\zeta}}{F_{y}-G_{1}w_{\zeta}}\,. \end{equation}$

(2.13)

Here $w$ is the general solution of (2.1) given by (2.2). Notice also that, formally, (2.13) contains two arbitrary constants, namely $\zeta_{0}$ and $C_{1}$ . However, without loss of generality, one of them can be set equal to zero.

Now we demonstrate that transformations (1.2) preserve autonomous invariant curves for equations from (1.1).

First, we need to introduce the definition of an invariant curve for (1.1). We recall that Eq (1.1) can be transformed into an equivalent dynamical system

$\begin{equation} y_{z} = P, \quad u_{z} = Q, \quad P = u, \quad Q = -k u^{3}-h u^{2}-f u -g. \end{equation}$

(2.14)

A smooth function $H(y, u)$ is called an invariant curve of (2.14) (or, equivalently, of (1.1)), if it is a nontrivial solution of ^[19]

$\begin{equation} PH_{y}+QH_{u} = \lambda H, \end{equation}$

(2.15)

for some value of the function $\lambda$ , which is called the cofactor of $H$ .

Second, we need to introduce the equation that is equivalent to (1.1) via (1.2). Substituting (1.2) into (1.1) we get

$\begin{equation} w_{\zeta\zeta}+\tilde{k}w_{\zeta}^{3}+\tilde{h}w_{\zeta}^{2}+\tilde{f}w_{\zeta}+\tilde{g} = 0, \end{equation}$

(2.16)

where

$\begin{equation} \begin{gathered} \tilde{k} = \frac{kG_{2}^{3}-gG_{1}^{3}+(G_{1,y}-hG_{1})G_{2}^{2}+(fG_{1}-G_{2,y})G_{1}G_{2}}{F_{y}^{2}G_{2}^{2}},\\ \tilde{h} = \frac{(hF_{y}-F_{yy})G_{2}^{2}-(2fG_{1}-G_{2,y})G_{2}F_{y}+3gG_{1}^{2}F_{y}}{F_{y}^{2}G_{2}^{2}},\\ \tilde{f} = \frac{fG_{2}-3gG_{1}}{G_{2}^{2}}, \quad \tilde{g} = \frac{gF_{y}}{G_{2}^{2}}. \end{gathered} \end{equation}$

(2.17)

An invariant curve for (2.16) can be defined in the same way as that for (1.1). Notice that, further, we will denote $w_{\zeta}$ as $v$ .

Theorem 2.2. Suppose that either (1.1) possess an invariant curve $H(y, u)$ with the cofactor $\lambda(y, u)$ or (2.16) possess an invariant curve $\widetilde{H}(w, v)$ with the cofactor $\tilde{\lambda}(w, v)$ . Then, the other equation also has an invariant curve and the corresponding invariant curves and cofactors are connected via

$\begin{equation} \begin{gathered} H(y,u) = \widetilde{H}\left(F,\frac{F_{y}u}{G_{1}u+G_{2}}\right), \quad \lambda(y,u) = (G_{1}u+G_{2})\tilde{\lambda}\left(F,\frac{F_{y}u}{G_{1}u+G_{2}}\right). \end{gathered} \end{equation}$

(2.18)

Proof. Suppose that $\widetilde{H}(w, v)$ is an invariant curve for (2.16) with the cofactor $\widetilde{\lambda}(w, v)$ . Then it satisfies

$\begin{equation} v\widetilde{H}_{w}+(-\tilde{k} v^{3}-\tilde{h} v^{2}-\tilde{f} v -\tilde{g})\widetilde{H}_{v} = \widetilde{\lambda}\widetilde{H}. \end{equation}$

(2.19)

Substituting (1.2) into (2.19) we get

$\begin{equation} uH_{y}+(-k u^{3}-h u^{2}-f u-g)H = (G_{1}u+G_{2}) \tilde{\lambda}\left(F,\frac{F_{y}u}{G_{1}u+G_{2}}\right) H . \end{equation}$

(2.20)

This completes the proof.

As an immediate consequence of Theorem 2.2 we have that transformations (1.2) preserve autonomous first integrals admitted by members of (1.1), since they are invariant curves with zero cofactors.

Another corollary of Theorem 2.2 is that any equation from (1.1) that is connected to (2.1) admits two invariant curves that correspond to irreducible polynomial invariant curves of (2.1). This invariant curves of (2.1) and the corresponding cofactors are the following (see, ^[23] formulas (3.18) and (3.19) taking into account scaling transformations)

$\begin{equation} \widetilde{H} = \pm i \sqrt{-2\epsilon}(v+w)+w^{2}, \quad \tilde{\lambda} = \pm \sqrt{-2\epsilon}w-2. \end{equation}$

(2.21)

Therefore, we have that the following statement holds:

Corollary 2.2. If coefficients of an equation from (1.1) satisfy either (2.3) or (2.4), then is admits the following invariant curves with the corresponding cofactors

$\begin{equation} H = \pm i \sqrt{-2\epsilon}\left(\frac{F_{y}u}{G_{1}u+G_{2}}+F\right)+F^{2}, \quad \lambda = \left(G_{1}u+G_{2}\right)\left(\pm \sqrt{-2\epsilon}F-2\right). \end{equation}$

(2.22)

Let us remark that connections between (2.1) and non-autonomous variants of (1.1) can be considered via a non-autonomous generalization of transformations (1.2). However, one of two nonlocally related equations should be autonomous since otherwise nonlocal transformations do not map a differential equation into a differential equation ^[5].

In this Section we have obtained the equivalence criterion between (1.1) and (2.1), that defines two new completely integrable subfamilies of (1.1). We have also demonstrated that members of these subfamilies posses an autonomous parametric first integral and two autonomous invariant curves.

3. Examples

In this Section we provide two examples of integrable equations from (1.1) satisfying integrability conditions from Theorem 2.1.

Example 1. One can show that the coefficients of the following cubic oscillator

$\begin{equation} y_{zz}-\frac{12\epsilon \mu y}{(\epsilon \mu^{2}y^{4}+2)^{2}}y_{z}^{3}-6\mu y y_{z}+2\mu^{2}y^{3}(\epsilon\mu^{2}y^{4}+2) = 0, \end{equation}$

(3.1)

satisfy condition (2.3) from Theorem 2.1. Consequently, Eq (3.1) is completely integrable and its general solution can be obtained from (2.2) by inverting transformations (1.2). However, it is more convenient to use Corollary 2.1 and present the autonomous first integral of (3.1) in the parametric form as follows:

$\begin{equation} y = \pm\sqrt{\frac{w}{\mu}}, \quad y_{z} = \frac{w(\epsilon w^{2}+2) w_{\zeta}}{2w_{\zeta}+w(\epsilon w^{2}+2)}, \end{equation}$

(3.2)

where $w$ is given by (2.2), $\zeta$ is considered as a parameter and $\zeta_{0}$ , without loss of generality, can be set equal to zero. As a result, we see that (3.1) is integrable since it has an autonomous first integral.

Moreover, using Corollary 2.2 one can find invariant curves admitted by (3.1)

$\begin{equation} \begin{gathered} H_{1,2} = \frac{y^{4}\left[(\sqrt{2}\pm \sqrt{-\epsilon}\mu y^{2})^{2}(\sqrt{2}\mp\sqrt{-\epsilon}\mu y^{2})+2(\epsilon\mu y^{2}\mp\sqrt{-2\epsilon})u\right]}{2\mu^{2}y^{2}(\epsilon\mu^{2}y^{4}+2)-4u},\\ \lambda_{1,2} = \pm\frac{2(\mu y^{2}(\epsilon\mu^{2}y^{4}+2)-2u)(\sqrt{-2\epsilon}\mu y^{2}\mp 2)}{y(\epsilon\mu^{2}y^{4}+2)} \end{gathered} \end{equation}$

(3.3)

With the help of the standard technique of the Darboux integrability theory ^[19], it is easy to find the corresponding Darboux integrating factor of (3.1)

$\begin{equation} M = \frac{(\epsilon \mu^{2}y^{4}+2)^{\frac{9}{4}}}{(2\epsilon u^{2}+(\epsilon\mu^{2}y^{4}+2)^{2})^{\frac{3}{4}}(\mu y^{2}(\epsilon \mu^{2}y^{4}+2)-2u)^{\frac{3}{2}}}. \end{equation}$

(3.4)

Consequently, equation is (3.1) Liouvillian integrable.

Example 2. Consider the Liénard (1, 9) equation

$\begin{equation} y_{zz}+(b_{i}y^{i}){y_{z}}+a_{j}y^{j} = 0, \quad i = 0,\ldots 4, \quad j = 0,\ldots,9. \end{equation}$

(3.5)

Here summation over repeated indices is assumed. One can show that this equation is equivalent to (2.1) if it is of the form

$\begin{equation} y_{zz}-9(y+\mu)(y+3\mu)^{3}y_{z}+2y(2y+3\mu)(y+3\mu)^{7} = 0, \end{equation}$

(3.6)

where $\mu$ is an arbitrary constant.

With the help of Corollary 2.1 one can present the first integral of (3.6) in the parametric form as follows:

$\begin{equation} y = \frac{3\sqrt{-2\epsilon}\mu w}{2-\sqrt{-2\epsilon}w}, \quad y_{z} = \frac{7776 \sqrt{2} \epsilon \mu^{5} w w_{\zeta}}{(\sqrt{-2\epsilon}w-2)^{5}(2\sqrt{-\epsilon}w_{\zeta}+(\sqrt{2}\epsilon w +2\sqrt{-\epsilon})w)}, \end{equation}$

(3.7)

where $w$ is given by (2.2). Thus, one can see that (3.5) is completely integrable due to the existence of this parametric autonomous first integral.

Using Corollary 2.2 we find two invariant curves of (3.6):

$\begin{equation} H_{1} = \frac{y^{2}[(2y+3\mu)(y+3\mu)^{4}-2u)]}{(y+3\mu)^{2}[(y+3\mu)^{4}y-u]}, \quad \lambda_{1} = \frac{6\mu(u-y(y+3\mu)^{4})}{y(y+3\mu)}, \end{equation}$

(3.8)

and

$\begin{equation} H_{2} = \frac{y^{2}(y+3\mu)^{2}}{y(y+3\mu)^{4}-u}, \quad \lambda_{2} = \frac{2(2y+3\mu)(u-2y(y+3\mu)^{4})}{y(y+3\mu)}. \end{equation}$

(3.9)

The corresponding Darboux integrating factor is

$\begin{equation} M = \left[y(y+3\mu)^{4}-u\right]^{-\frac{3}{2}}\left[(2y+3\mu)(y+3\mu)^{4}-2u\right]^{-\frac{3}{4}}. \end{equation}$

(3.10)

As a consequence, we see that Eq (3.6) is Liouvillian integrable.

Therefore, we see that equations considered in Examples 1 and 2 are completely integrable from two points of view. First, they possess autonomous parametric first integrals. Second, they have Darboux integrating factors.

4. Conclusions and discussion

In this work we have considered the equivalence problem between family of Eqs (1.1) and its integrable member (2.1), with equivalence transformations given by generalized nonlocal transformations (1.2). We construct the corresponding equivalence criterion in the explicit form, which leads to two new integrable subfamilies of (1.1). We have demonstrated that one can explicitly construct a parametric autonomous first integral for each equation that is equivalent to (2.1) via (1.2). We have also shown that transformations (1.2) preserve autonomous invariant curves for (1.1). As a consequence, we have obtained that equations from the obtained integrable subfamilies posses two autonomous invariant curves, which corresponds to the irreducible polynomial invariant curves of (2.1). This fact demonstrate a connection between nonlocal equivalence approach and Darboux and Liouvillian integrability approach. We have illustrate our results by two examples of integrable equations from (1.1).

Acknowledgments

The author was partially supported by Russian Science Foundation grant 19-71-10003.

Conflict of interest

The author declares no conflict of interest in this paper.

References

[1]	J. Miao, K. I. Kou, Color image recovery using low-rank quaternion matrix completion algorithm, IEEE Trans. Image Process., 31 (2022), 190–201. https://doi.org/10.1109/TIP.2021.3128321 doi: 10.1109/TIP.2021.3128321
[2]	Z. Jia, Q. Jin, M. K. Ng, X. Zhao, Non-local robust quaternion matrix completion for large-scale color image and video inpainting, IEEE Trans. Image Process., 31 (2022), 3868–3883. https://doi.org/10.1109/TIP.2022.3176133 doi: 10.1109/TIP.2022.3176133
[3]	X. Li, H. Zhang, R. Zhang, Matrix completion via non-convex relaxation and adaptive correlation learning, IEEE Trans. Pattern Anal. Mach. Intell., 45 (2023), 1981–1991. https://doi.org/10.1109/TPAMI.2022.3157083 doi: 10.1109/TPAMI.2022.3157083
[4]	H. Cai, L. Huang, P. Li, D. Needell, Matrix completion with cross-concentrated sampling: Bridging uniform sampling and CUR sampling, IEEE Trans. Pattern Anal. Mach. Intell., 45 (2023), 10100–10113. https://doi.org/10.1109/TPAMI.2023.3261185 doi: 10.1109/TPAMI.2023.3261185
[5]	S. Bhattacharya, S. Chatterjee, Matrix completion with data-dependent missingness probabilities, IEEE Trans. Inf. Theory, 68 (2022), 6762–6773. https://doi.org/10.1109/TIT.2022.3170244 doi: 10.1109/TIT.2022.3170244
[6]	Y. Yang, C. Ma, Optimal tuning-free convex relaxation for noisy matrix completion, IEEE Trans. Inf. Theory, 69 (2023), 6571–6585. https://doi.org/10.1109/TIT.2023.3284341 doi: 10.1109/TIT.2023.3284341
[7]	K. F. Masood, J. Tong, J. Xi, J. Yuan, Y. Yu, Inductive matrix completion and root-MUSIC-based channel estimation for intelligent reflecting surface (IRS)-aided hybrid MIMO systems, IEEE Trans. Wireless Commun., 22 (2023), 7917–7931. https://doi.org/10.1109/TWC.2023.3257138 doi: 10.1109/TWC.2023.3257138
[8]	O. Elnahas, Y. Ma, Y. Jiang, Z. Quan, Clock synchronization in wireless networks using matrix completion-based maximum likelihood estimation, IEEE Trans. Wireless Commun., 19 (2020), 8220–8231. https://doi.org/10.1109/TWC.2020.3020191 doi: 10.1109/TWC.2020.3020191
[9]	Q. Liu, X. Li, H. Cao, Two-dimensional localization: Low-rank matrix completion with random sampling in massive MIMO system, IEEE Syst. J., 15 (2020), 3628–3631. https://doi.org/10.1109/JSYST.2020.3012775 doi: 10.1109/JSYST.2020.3012775
[10]	Z. Liu, X. Li, H. C. So, ℓ0-norm minimization based robust matrix completion approach for MIMO radar target localization, IEEE Trans. Aerosp. Electronic Syst., 59 (2023), 6759–6770. https://doi.org/10.1109/TAES.2023.3280462 doi: 10.1109/TAES.2023.3280462
[11]	M. Fazel, Matrix Rank Minimization with Applications, Ph.D thesis, Stanford University, 2002.
[12]	E. J. Candès, B. Recht, Exact matrix completion via convex optimization, Found. Comput. Math., 9 (2009), 717–772. https://doi.org/10.1007/s10208-009-9045-5 doi: 10.1007/s10208-009-9045-5
[13]	J. Cai, E. Candès, Z. Shen, A singular value thresholding method for matrix completion, SIAM J. Optim., 20 (2010), 1956–1982. https://doi.org/10.1137/080738970 doi: 10.1137/080738970
[14]	S. Ma, D. Goldfarb, L. Chen, Fixed point and Bregman iterative methods for matrix rank minimization, Math. Program., 128 (2011), 321–353. https://doi.org/10.1007/s10107-009-0306-5 doi: 10.1007/s10107-009-0306-5
[15]	K. C. Toh, S. Yun, An accelerated proximal gradient algorithm for nuclear norm regularized linear least squares problems, Pacific J. Optim., 6 (2010), 615–640.
[16]	R. Meka, P. Jain, I. Dhillon, Guaranteed rank minimization via singular value projection, in Proceedings of Advances in Neural Information Processing Systems, (2009), 937–945.
[17]	Y. Hu, D. Zhang, J. Ye, X. Li, X. He, Fast and accurate matrix completion via truncated nuclear norm regularization, IEEE Trans. Pattern Anal. Mach. Intell., 35 (2013), 2117–2130. https://doi.org/10.1109/TPAMI.2012.271 doi: 10.1109/TPAMI.2012.271
[18]	Y. Liu, L. Jiao, F. Shang, F. Yin, F. Liu, An efficient matrix bi-factorization alternative optimization method for low-rank matrix recovery and completion, Neural Networks, 48 (2013), 8–18. https://doi.org/10.1016/j.neunet.2013.06.013 doi: 10.1016/j.neunet.2013.06.013
[19]	Y. Liu, L. Jiao, F. Shang, A fast tri-factorization method for low-rank matrix recovery and completion, Pattern Recognit., 46 (2013), 163–173. https://doi.org/10.1016/j.patcog.2012.07.003 doi: 10.1016/j.patcog.2012.07.003
[20]	Z. Wen, W. Yin, Y. Zhang, Solving a low-rank factorization model for matrix completion by a nonlinear successive over-relaxation, Math. Program. Comput., 4 (2012), 333–361. https://doi.org/10.1007/s12532-012-0044-1 doi: 10.1007/s12532-012-0044-1
[21]	S. Gu, L. Zhang, W. Zuo, X. Feng, Weighted nuclear norm minimization with application to image denoising, in Proceedings of 2014 IEEE Conference on Computer Vision and Pattern Recognition, (2014).
[22]	C. Wen, W. Qian, Q. Zhang, F. Cao, Algorithms of matrix recovery based on truncated Schatten p-norm, Int. J. Mach. Learn. Cybern., 12 (2021), 1557–1570. https://doi.org/10.1007/s13042-020-01256-7 doi: 10.1007/s13042-020-01256-7
[23]	G. Li, G. Guo, S. Peng, C. Wang, S. Yu, J. Niu, et al., Matrix completion via Schatten capped p norm, IEEE Trans. Knowl. Data Eng., 34 (2022), 394–404. https://doi.org/10.1109/TKDE.2020.2978465 doi: 10.1109/TKDE.2020.2978465
[24]	Q. Liu, Z. Lai, Z. Zhou, F. Kuang, Z. Jin, A truncated nuclear norm regularization method based on weighted residual error for matrix completion, IEEE Trans. Image Process., 25 (2016), 316–330. https://doi.org/10.1109/TIP.2015.2503238 doi: 10.1109/TIP.2015.2503238
[25]	W. Zeng, H. C. So, Outlier-robust matrix completion via ℓp-minimization, IEEE Trans. Signal Process., 66 (2018), 1125–1140. https://doi.org/10.1109/TSP.2017.2784361 doi: 10.1109/TSP.2017.2784361
[26]	X. P. Li, Q. Liu, H. C. So, Rank-one matrix approximation with ℓp-norm for image inpainting, IEEE Signal Process. Lett., 27 (2020), 680–684. https://doi.org/10.1109/LSP.2020.2988596 doi: 10.1109/LSP.2020.2988596
[27]	M. Muma, W. Zeng, A. M. Zoubir, Robust M-estimation based matrix completion, in ICASSP 2019–2019 IEEE International Conference on Acoustics, Speech and Signal Processing (ICASSP), (2019), 5476–5480. https://doi.org/10.1109/ICASSP.2019.8682657
[28]	Y. He, F. Wang, Y. Li, J. Qin, B. Chen, Robust matrix completion via maximum correntropy criterion and half-quadratic optimization, IEEE Trans. Signal Process., 68 (2019), 181–195. https://doi.org/10.1109/TSP.2019.2952057 doi: 10.1109/TSP.2019.2952057
[29]	Z. Shi, X. P. Li, W. Li, T. Yan, J. Wang, Y. Fu, Robust low-rank matrix recovery as mixed integer programming via ℓ0-norm optimization, IEEE Signal Process. Lett., 30 (2023), 1012–1016. https://doi.org/10.1109/LSP.2023.3301244 doi: 10.1109/LSP.2023.3301244
[30]	Q. Zhao, D. Meng, Z. Xu, W. Zuo, Y. Yan, L1-norm low rank matrix factorization by variational Bayesian method, IEEE Trans. Neural Network Learn. Syst., 26 (2015), 825–839. https://doi.org/10.1109/TNNLS.2014.2387376 doi: 10.1109/TNNLS.2014.2387376
[31]	X. P. Li, Z. Shi, Q. Liu, H. C. So, Fast robust matrix completion via entry-wise ℓ2-norm minimization, IEEE Trans. Cybern., 53 (2023), 7199–7212. https://doi.org/10.1109/TCYB.2022.3224070 doi: 10.1109/TCYB.2022.3224070
[32]	Q. Liu, F. Davoine, J. Yang, Y. Cui, Z. Jin, F. Han, A fast and accurate matrix completion method based on QR decomposition and L2, 1-norm minimization, IEEE Trans. Neural Networks Learn. Syst., 30 (2019), 803–817. https://doi.org/10.1109/TNNLS.2018.2851957
[33]	Q. Liu, C. Peng, P. Yang, X. Zhou, Z. Liu, A fast matrix completion method based on matrix bifactorization and QR decomposition, Wireless Commun. Mobile Comput., 2023 (2023), 2117876. https://doi.org/10.1155/2023/2117876 doi: 10.1155/2023/2117876
[34]	M. Yang, Y. Li, J. Wang, Feature and nuclear norm minimization for matrix completion, IEEE Trans. Knowl. Data Eng., 34 (2022), 2190–2199. https://doi.org/10.1109/TKDE.2020.3005978 doi: 10.1109/TKDE.2020.3005978
[35]	Q. Fan, Y. Liu, T. Yang, H. Peng, Fast and accurate spectrum estimation via virtual co-array interpolation based on truncated nuclear norm regularization, IEEE Signal Process. Lett., 29 (2021), 169–173. https://doi.org/10.1109/LSP.2021.3130018 doi: 10.1109/LSP.2021.3130018
[36]	G. Morison, SURE based truncated tensor nuclear norm regularization for low rank tensor completion, in Proceedings of the 28^th European Signal Processing Conference (EUSIPCO) in 2020, (2021), 2001–2005. https://doi.org/10.23919/Eusipco47968.2020.9287726
[37]	J. Dong, Z. Xue, J. Guan, Z. F. Han, W. Wang, Low rank matrix completion using truncated nuclear norm and sparse regularizer, Signal Process. Image Commun., 68 (2018), 76–87. https://doi.org/10.1016/j.image.2018.06.007 doi: 10.1016/j.image.2018.06.007
[38]	M. Zhang, M. Zhang, F. Zhao, F. Zhang, Y. Liu, A. Evans, Truncated weighted nuclear norm regularization and sparsity for image denoising, in Proceedings of 2023 IEEE International Conference on Image Processing (ICIP), (2023), 1825–1829. https://doi.org/10.1109/ICIP49359.2023.10221971
[39]	Y. Song, J. Li, X. Chen, D. Zhang, Q. Tang, K. Yang, An efficient tensor completion method via truncated nuclear norm, J. Visual Commun. Image Representation, 70 (2020), 102791. https://doi.org/10.1016/j.jvcir.2020.102791 doi: 10.1016/j.jvcir.2020.102791
[40]	Y. Qiu, G. Zhou, J. Zeng, Q. Zhao, S. Xie, Imbalanced low-rank tensor completion via latent matrix factorization, Neural Networks, 155 (2022), 369. https://doi.org/10.1016/j.neunet.2022.08.023 doi: 10.1016/j.neunet.2022.08.023
[41]	Z. Hu, F. Nie, R. Wang, X. Li, Low rank regularization: A review, Neural Networks, 136 (2021), 218. https://doi.org/10.1016/j.neunet.2020.09.021 doi: 10.1016/j.neunet.2020.09.021
[42]	Q. Shen, S. Yi, Y. Liang, Y. Chen, W. Liu, Bilateral fast low-rank representation with equivalent transformation for subspace clustering, IEEE Trans. Multimedia, 25 (2023), 6371–6383. https://doi.org/10.1109/TMM.2022.3207922 doi: 10.1109/TMM.2022.3207922
[43]	Y. Yang, J. Zhang, S. Song, C. Zhang, D. Liu, Low-rank and sparse matrix decomposition with orthogonal subspace projection-based background suppression for hyperspectral anomaly detection, IEEE Geosci. Remote Sens. Lett., 17 (2020), 1378–1382. https://doi.org/10.1109/LGRS.2019.2948675 doi: 10.1109/LGRS.2019.2948675
[44]	X. Wang, X. P. Li, H. C. So, Truncated quadratic norm minimization for bilinear factorization-based matrix completion, Signal Process., 214 (2024), 109219. https://doi.org/10.1016/j.sigpro.2023.109219 doi: 10.1016/j.sigpro.2023.109219
[45]	J. Wen, H. He, Z. He, F. Zhu, A pseudo-inverse-based hard thresholding algorithm for sparse signal recovery, IEEE Trans. Intell. Transp. Syst., 24 (2023), 7621–7630. https://doi.org/10.1109/TITS.2022.3172868 doi: 10.1109/TITS.2022.3172868

This article has been cited by:

1.	Dmitry I. Sinelshchikov, Linearizabiliy and Lax representations for cubic autonomous and non-autonomous nonlinear oscillators, 2023, 01672789, 133721, 10.1016/j.physd.2023.133721
2.	Jaume Giné, Xavier Santallusia, Integrability via algebraic changes of variables, 2024, 184, 09600779, 115026, 10.1016/j.chaos.2024.115026
3.	Meryem Belattar, Rachid Cheurfa, Ahmed Bendjeddou, Paulo Santana, A class of nonlinear oscillators with non-autonomous first integrals and algebraic limit cycles, 2023, 14173875, 1, 10.14232/ejqtde.2023.1.50
4.	Jaume Giné, Dmitry Sinelshchikov, Integrability of Oscillators and Transcendental Invariant Curves, 2025, 24, 1575-5460, 10.1007/s12346-024-01182-x

Reader Comments

Your name:*

Email:*
© 2024 the Author(s), licensee AIMS Press. This is an open access article distributed under the terms of the Creative Commons Attribution License (http://creativecommons.org/licenses/by/4.0)