Global ETD Search

Search theses and dissertations gathered from participating repositories worldwide. Every result links back to the library that holds it. No account is needed.

Results

Showing 1 to 4 of 4 for “"rank minimization"”.

  1. Algorithms for Sparse and Low-Rank Optimization: Convergence, Complexity and Applications

    Solving optimization problems with sparse or low-rank optimal solutions has been an important topic since the recent emergence of compressed sensing and its matrix extensions such as the matrix rank minimization and robust principal component analysis problems. Compressed sensing enables one to …

    columbia-diss Repository record for Algorithms for Sparse and Low-Rank Optimization: Convergence, Complexity and Applications (opens in a new tab)

  2. LOW RANK AND SPARSE MODELING FOR DATA ANALYSIS

    … many machine learning and data mining tasks. Low-rank and sparse modeling are emerging mathematical tools dealing with uncertainties of real-world data. Leveraging on the underlying structure of data, low-rank and sparse modeling approaches have achieved impressive performance in many data …

    siu-theses Repository record for LOW RANK AND SPARSE MODELING FOR DATA ANALYSIS (opens in a new tab)

  3. First Order Methods for Large-Scale Sparse Optimization

    … has some desirable properties. Sparse and low-rank solutions to large scale optimization problems are typically obtained by regularizing the objective function with L1 and nuclear norms, respectively. Practical instances of these problems are very high dimensional (~ million variables) and …

    columbia-diss Repository record for First Order Methods for Large-Scale Sparse Optimization (opens in a new tab)

  4. Efficient and guaranteed algorithms for sparse inverse problems

    … unfavorable but practically significant case of rank defect or ill-conditioning. This situation arises with a limited number of measurement vectors, or with highly correlated signal components. In this case, MUSIC fails and, in practice, none of the existing methods can consistently approach the …

    uiuc Repository record for Efficient and guaranteed algorithms for sparse inverse problems (opens in a new tab)