Sparse matrix computations are pivotal to advancing high-performance scientific applications, particularly as modern numerical simulations and data analyses demand efficient management of large, ...

This paper presents a numerical comparison between algorithms for unconstrained optimization that take account of sparsity in the second derivative matrix of the objective function. Some of the ...

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 ...