matrix_completion.hpp
Go to the documentation of this file.
1 
13 #ifndef MLPACK_METHODS_MATRIX_COMPLETION_MATRIX_COMPLETION_HPP
14 #define MLPACK_METHODS_MATRIX_COMPLETION_MATRIX_COMPLETION_HPP
15 
18 
19 namespace mlpack {
20 namespace matrix_completion {
21 
54 {
55  public:
68  MatrixCompletion(const size_t m,
69  const size_t n,
70  const arma::umat& indices,
71  const arma::vec& values,
72  const size_t r);
73 
86  MatrixCompletion(const size_t m,
87  const size_t n,
88  const arma::umat& indices,
89  const arma::vec& values,
90  const arma::mat& initialPoint);
91 
102  MatrixCompletion(const size_t m,
103  const size_t n,
104  const arma::umat& indices,
105  const arma::vec& values);
106 
112  void Recover(arma::mat& recovered);
113 
116  {
117  return sdp;
118  }
121 
122  private:
124  size_t m;
126  size_t n;
128  arma::umat indices;
130  arma::mat values;
131 
134 
136  void CheckValues();
138  void InitSDP();
139 
142  static size_t DefaultRank(const size_t m, const size_t n, const size_t p);
143 };
144 
145 } // namespace matrix_completion
146 } // namespace mlpack
147 
148 #endif
.hpp
Definition: add_to_po.hpp:21
MatrixCompletion(const size_t m, const size_t n, const arma::umat &indices, const arma::vec &values, const size_t r)
Construct a matrix completion problem, specifying the maximum rank of the solution.
LRSDP is the implementation of Monteiro and Burer's formulation of low-rank semidefinite programs (LR...
Definition: lrsdp.hpp:30
void Recover(arma::mat &recovered)
Solve the underlying SDP to fill in the remaining values.
optimization::LRSDP< optimization::SDP< arma::sp_mat > > & Sdp()
Modify the underlying SDP.
const optimization::LRSDP< optimization::SDP< arma::sp_mat > > & Sdp() const
Return the underlying SDP.
This class implements the popular nuclear norm minimization heuristic for matrix completion problems...