EUVIMEDEUVIMED entdecken
Crossref

An inexact LPA for DC composite optimization and application to matrix completion with outliers

Ting Tao, Ruyu Liu, Shaohua Pan

IMA Journal of Numerical Analysis · 13.11.2026

DOI: 10.1093/imanum/drag112 ↗

Kurz gefasst

Fachartikel in der Zeitschrift IMA Journal of Numerical Analysis, online erschienen am 13.11.2026. Verfasst von Ting Tao und 2 weiteren Autor:innen. Die Arbeit nennt 69 Literaturangaben. Gefördert von: National Natural Science Foundation of China, Guangdong Basic and Applied Basic Research Foundation.

AbstractBibliografische AngabenZitierenVerwandte Studien

Abstract (Originalsprache)

This paper concerns a class of DC composite optimization problems which, as an extension of convex composite optimization problems and DC programs with nonsmooth components, often arises in robust factorization models of low-rank matrix recovery. For this class of nonconvex and nonsmooth problems, we propose an inexact linearized proximal algorithm (iLPA) by computing at each step an inexact minimizer of a strongly convex majorization constructed with a partial linearization of their objective functions at the current iterate. We establish the full convergence of the generated iterate sequence under the Kurdyka–Łojasiewicz (KL) property of a potential function, and employ the composite structure to provide a verifiable condition for the potential function to satisfy the KL property of exponent $1/2$ at the limit point, so for the iterate sequence to have a local R-linear convergence rate. This condition is weaker than the one provided in Li & Pong (2018, Calculus of the exponent of Kurdyka–Łojasiewicz inequality and its applications to linear convergence of first-order methods. Found. Comput. Math., 18, 1199–1232, Theorem 3.2) for identifying the KL property of exponent $p\in [0,1)$ for a general composite function. The proposed iLPA is applied to a robust factorization model for matrix completion with outliers and nonuniform sampling, and numerical comparisons with the Polyak subgradient method and a proximal alternating minimization method validate its efficiency.

Förderung

  • National Natural Science Foundation of China
  • Guangdong Basic and Applied Basic Research Foundation

Zitieren

APA

Tao, T., Liu, R., & Pan, S. (2026). An inexact LPA for DC composite optimization and application to matrix completion with outliers. IMA Journal of Numerical Analysis. https://doi.org/10.1093/imanum/drag112

Vancouver

Tao T, Liu R, Pan S. An inexact LPA for DC composite optimization and application to matrix completion with outliers. IMA Journal of Numerical Analysis. 2026. doi:10.1093/imanum/drag112

BibTeX
@article{Tao2026,
  author = {Tao, Ting and Liu, Ruyu and Pan, Shaohua},
  title = {An inexact LPA for DC composite optimization and application to matrix completion with outliers},
  journal = {IMA Journal of Numerical Analysis},
  year = {2026},
  doi = {10.1093/imanum/drag112}
}
Kostenlos starten →