Nonconvex Nonlinear Transformation of Low-Rank Approximation for Tensor Completion
Recovering incomplete high-dimensional data to create complete and valuable datasets is the main focus of tensor completion research, which lies at the intersection of mathematics and information science. Researchers typically apply various linear and nonlinear transformations to the original tensor...
Saved in:
| Main Authors: | Yifan Mei, Xinhua Su, Huixiang Lin, Huanmin Ge |
|---|---|
| Format: | Article |
| Language: | English |
| Published: |
MDPI AG
2024-12-01
|
| Series: | Applied Sciences |
| Subjects: | |
| Online Access: | https://www.mdpi.com/2076-3417/14/24/11895 |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
Similar Items
-
A Novel Nonconvex Penalty Method for a Rank Constrained Matrix Optimization Problem and its Applications
by: Zhang Wenjuan, et al.
Published: (2025-03-01) -
Positivity of convolution quadratures generated by nonconvex sequences
by: Karaa, Samir
Published: (2024-11-01) -
An interior proximal gradient method for nonconvex optimization
by: De Marchi, Alberto, et al.
Published: (2024-07-01) -
Temporal Denoising of Infrared Images via Total Variation and Low-Rank Bidirectional Twisted Tensor Decomposition
by: Zhihao Liu, et al.
Published: (2025-04-01) -
A new algorithm by embedding structured data for low-rank tensor ring completion
by: Ruiping Wen, et al.
Published: (2025-03-01)