Recovering Low-Rank Matrices From Few Coefficients in Any BasisGROSS, David.IEEE transactions on information theory. 2011, Vol 57, Num 3, pp 1548-1566, issn 0018-9448, 19 p.Article

First- and second-order methods for semidefinite programmingMONTEIRO, Renato D. C.Mathematical programming. 2003, Vol 97, Num 1-2, pp 209-244, issn 0025-5610, 36 p.Article

Towards better accuracy for missing value estimation of epistatic miniarray profiling data by a novel ensemble approachPAN, Xiao-Yong; YE TIAN; YAN HUANG et al.Genomics (San Diego, Calif.). 2011, Vol 97, Num 5, pp 257-264, issn 0888-7543, 8 p.Article

Matrix Completion à la Dempster by the Principle of ParsimonyFERRANTE, Augusto; PAVON, Michele.IEEE transactions on information theory. 2011, Vol 57, Num 6, pp 3925-3931, issn 0018-9448, 7 p.Article

Some remarks on matrix pencil completion problemsLOISEAU, Jean-Jacques; ZAGALAK, Petr; MONDIE, Sabine et al.Kybernetika. 2004, Vol 40, Num 6, pp 665-680, issn 0023-5954, 16 p.Article

Neurodegenerative disease diagnosis using incomplete multi-modality data via matrix shrinkage and completionTHUNG, Kim-Han; WEE, Chong-Yaw; YAP, Pew-Thian et al.NeuroImage (Orlando, Fla.). 2014, Vol 91, pp 386-400, issn 1053-8119, 15 p.Article

Totally positive shapes and TP_k-completable patternsHOFF, D; JOHNSON, C. R; NASSERASR, S et al.Linear algebra and its applications. 2012, Vol 436, Num 12, pp 4412-4422, issn 0024-3795, 11 p.Article

On the completion of a partial integral matrix to a unimodular matrixMAOZHONG FANG.Linear algebra and its applications. 2007, Vol 422, Num 1, pp 291-294, issn 0024-3795, 4 p.Article

Special loop connections of linear systemsDODIG, Marija.Linear algebra and its applications. 2007, Vol 424, Num 2-3, pp 555-569, issn 0024-3795, 15 p.Article

A note on Constructing matrices with prescribed off-diagonal submatrix and invariant polynomialsBOROBIA, Alberto; CANOGAR, Roberto.Linear algebra and its applications. 2008, Vol 429, Num 7, pp 1684-1686, issn 0024-3795, 3 p.Article

The copositive completion problem : Unspecified diagonal entriesHOGBEN, Leslie.Linear algebra and its applications. 2007, Vol 420, Num 1, pp 160-162, issn 0024-3795, 3 p.Article

Cuts, matrix completions and graph rigidityLAURENT, M.Mathematical programming. 1997, Vol 79, Num 1-3, pp 255-283, issn 0025-5610Conference Paper

Constructing matrices with prescribed off-diagonal submatrix and invariant polynomialsBOROBIA, Alberto; CANOGAR, Roberto.Linear algebra and its applications. 2007, Vol 424, Num 2-3, pp 615-633, issn 0024-3795, 19 p.Article

On the uniqueness of Euclidean distance matrix completions: the case of points in general positionALFAKIH, Abdo Y.Linear algebra and its applications. 2005, Vol 397, pp 265-277, issn 0024-3795, 13 p.Article

The copositive completion problemHOGBEN, Leslie; JOHNSON, Charles R; REAMS, Robert et al.Linear algebra and its applications. 2005, Vol 408, pp 207-211, issn 0024-3795, 5 p.Article

Convergence in measure with respect to a matrix-valued measure and some matrix completion problemsKLOTZ, Lutz; KUNKEL, Peter; RUDOLPH, David et al.Linear algebra and its applications. 2011, Vol 434, Num 4, pp 990-999, issn 0024-3795, 10 p.Article

On singular values of partially prescribed matricesAGUIAR, Pedro M. Q; STOSIC, Marko; XAVIER, Joao et al.Linear algebra and its applications. 2008, Vol 429, Num 8-9, pp 2136-2145, issn 0024-3795, 10 p.Article

Alternating-projection algorithms for operator-theoretic calculationsZARIKIAN, Vrej.Linear algebra and its applications. 2006, Vol 419, Num 2-3, pp 710-734, issn 0024-3795, 25 p.Article

Calibration Using Matrix Completion With Application to Ultrasound TomographyPARHIZKAR, Reza; KARBASI, Amin; SEWOONG OH et al.IEEE transactions on signal processing. 2013, Vol 61, Num 17-20, pp 4923-4933, issn 1053-587X, 11 p.Article

Sparse Bayesian Methods for Low-Rank Matrix EstimationDERIN BABACAN, S; LUESSI, Martin; MOLINA, Rafael et al.IEEE transactions on signal processing. 2012, Vol 60, Num 8, pp 3964-3977, issn 1053-587X, 14 p.Article

A Geometric Approach to Low-Rank Matrix CompletionWEI DAI; KERMAN, Ely; MILENKOVIC, Olgica et al.IEEE transactions on information theory. 2012, Vol 58, Num 1, pp 237-247, issn 0018-9448, 11 p.Article

Recovery of Low-Rank Matrices Under Affine Constraints via a Smoothed Rank FunctionMALEK-MOHAMMADI, Mohammadreza; BABAIE-ZADEH, Massoud; AMINI, Arash et al.IEEE transactions on signal processing. 2014, Vol 62, Num 1-4, pp 981-992, issn 1053-587X, 12 p.Article

Analysis of a Collaborative Filter Based on Popularity Amongst NeighborsBARMAN, Kishor; DABEER, Onkar.IEEE transactions on information theory. 2012, Vol 58, Num 12, pp 7110-7134, issn 0018-9448, 25 p.Article

Estimation of missing RTTs in computer networks: Matrix completion vs compressed sensingZIQIAN DONG; ANAND, Santhanakrishnan; CHANDRAMOULI, Rajarathnam et al.Computer networks (1999). 2011, Vol 55, Num 15, pp 3364-3375, issn 1389-1286, 12 p.Article

Subspace Evolution and Transfer (SET) for Low-Rank Matrix CompletionWEI DAI; MILENKOVIC, Olgica; KERMAN, Ely et al.IEEE transactions on signal processing. 2011, Vol 59, Num 7, pp 3120-3132, issn 1053-587X, 13 p.Article