2018
DOI: 10.2139/ssrn.3245681
|View full text |Cite
|
Sign up to set email alerts
|

A Note on Rank Constrained Solutions to Linear Matrix Equations

Abstract: This preliminary note presents a heuristic for determining rank constrained solutions to linear matrix equations (LME). The method proposed here is based on minimizing a nonconvex quadratic functional, which will hence-forth be termed as the Low-Rank-Functional (LRF). Although this method lacks a formal proof/comprehensive analysis, for example in terms of a probabilistic guarantee for converging to a solution, the proposed idea is intuitive and has been seen to perform well in simulations. To that end, many n… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1

Citation Types

0
1
0

Year Published

2022
2022
2022
2022

Publication Types

Select...
1

Relationship

0
1

Authors

Journals

citations
Cited by 1 publication
(1 citation statement)
references
References 4 publications
(8 reference statements)
0
1
0
Order By: Relevance
“…In recent years, the research area of low-rank tensors has been extended to numerical analysis, computer vision, machine learning, signal and image processing, etc. [27][28][29][30][31]. erefore, it is worthwhile to pay attention and explore how to perform efficient and accurate tensor complementation to recover the information of each dimension of the incomplete tensor.…”
Section: Introductionmentioning
confidence: 99%
“…In recent years, the research area of low-rank tensors has been extended to numerical analysis, computer vision, machine learning, signal and image processing, etc. [27][28][29][30][31]. erefore, it is worthwhile to pay attention and explore how to perform efficient and accurate tensor complementation to recover the information of each dimension of the incomplete tensor.…”
Section: Introductionmentioning
confidence: 99%