This is a preview. Log in through your library . Abstract The sparsity constrained rank-one matrix approximation problem is a difficult mathematical optimization problem which arises in a wide array ...
Results that may be inaccessible to you are currently showing.
Hide inaccessible results