Biblio Discovery — Demo Discovery Service

9 hasil untuk "Angang Cui"

Menampilkan 1–9 · 0,15 detik · RSS

  1. Artikel Jurnal Teks lengkap

    The Sufficiency of Solutions for Non-smooth Minimax Fractional Semi-Infinite Programming with (BK,ρ)−Invexity

    Hong Yang; Angang Cui

    Mathematics, Vol. 11 No. 20 · 2023 · Inggris · DOAJ Scopus

    Minimax fractional semi-infinite programming is an important research direction for semi-infinite programming, and has a wide range of applications, such as military allocation problems, economic theory, cooperative games, and other fields. Convexity theory plays a key role in many aspects of…

  2. Artikel Jurnal

    A fast algorithm for sparse signal recovery via fraction function

    Angang Cui; Haizhen He; Hong Yang

    Electronics Letters, Vol. 60 No. 11 · 2024 · Inggris · DOAJ Scopus

    Abstract In this article, a fast algorithm is studied to recover the sparse signals. It can be regarded as an extension of the parameterized fast iterative shrinkage‐thresholding algorithm from convex optimization to nonconvex optimization. Numerical results show that the proposed fast algorithm is…

  3. Artikel Jurnal Teks lengkap

    A Fast Designed Thresholding Algorithm for Low-Rank Matrix Recovery with Application to Missing English Text Completion

    Haizhen He; Angang Cui; Hong Yang

    Mathematics, Vol. 13 No. 19 · 2025 · Inggris · DOAJ Scopus

    This article is proposing a fast version of adaptive iterative matrix designed thresholding (AIMDT) algorithm which is studied in our previous work. In AIMDT algorithm, a designed thresholding operator is studied to the problem of recovering the low-rank matrices. By adjusting the size of the…

  4. Artikel Jurnal

    A splitting method for shifted skew-Hermitian linear system

    Angang Cui; Haiyang Li; Chengyi Zhang

    Journal of Inequalities and Applications, Vol. 2016 No. 1 · 2016 · Inggris · DOAJ Scopus

    Abstract In this paper, we present a splitting method for solving the shifted skew-Hermitian linear system, which is briefly called an α-SSS. Some convergence results are established and numerical experiments show that the splitting method is feasible for solving the problem of this linear system.

  5. Artikel Jurnal Teks lengkap

    An Image Recognition Method for the Foods of Northern Shaanxi Based on an Improved ResNet Network

    Yonggang Ma; Junmei Liu; Angang Cui

    Mathematics, Vol. 13 No. 16 · 2025 · Inggris · DOAJ Scopus

    With the development of artificial intelligence technology, food image recognition has become an important research direction in the field of computer vision. The region of Northern Shaanxi is famous for its rich food culture. This paper aims to propose a food image recognition method based on an…

  6. Artikel Jurnal Teks lengkap

    A Designed Thresholding Operator for Low-Rank Matrix Completion

    Angang Cui; Haizhen He; Hong Yang

    Mathematics, Vol. 12 No. 7 · 2024 · Inggris · DOAJ Scopus

    In this paper, a new thresholding operator, namely, designed thresholding operator, is designed to recover the low-rank matrices. With the change of parameter in designed thresholding operator, the designed thresholding operator can apply less bias to the larger singular values of a matrix compared…

  7. Artikel Jurnal

    The alternate direction iterative methods for generalized saddle point systems

    Shuanghua Luo; Angang Cui; Cheng-yi Zhang

    Journal of Inequalities and Applications, Vol. 2019 No. 1 · 2019 · Inggris · DOAJ Scopus

    Abstract The paper studies two splitting forms of generalized saddle point matrix to derive two alternate direction iterative schemes for generalized saddle point systems. Some convergence results are established for these two alternate direction iterative methods. Meanwhile, a numerical example is…

  8. Artikel Jurnal

    A Nonconvex Method to Low-Rank Matrix Completion

    Haizhen He; Angang Cui; Hong Yang dkk.

    IEEE Access, Vol. 10 · 2022 · Inggris · DOAJ Scopus

    In recent years, the problem of recovering a low-rank matrix from partial entries, known as low-rank matrix completion problem, has attracted much attention in many applications. However, it is a NP-hard problem due to the nonconvexity nature of the matrix rank function. In this paper, a rank…

  9. Artikel Jurnal

    Sparse signals recovered by non-convex penalty in quasi-linear systems

    Angang Cui; Haiyang Li; Meng Wen dkk.

    Journal of Inequalities and Applications, Vol. 2018 No. 1 · 2018 · Inggris · DOAJ Scopus

    Abstract The goal of compressed sensing is to reconstruct a sparse signal under a few linear measurements far less than the dimension of the ambient space of the signal. However, many real-life applications in physics and biomedical sciences carry some strongly nonlinear structures, and the linear…