$$S_{1/2}$$ S 1 / 2 regularization methods and fixed point algorithms for affine rank minimization problems

Dingtao Peng (), Naihua Xiu () and Jian Yu ()
Additional contact information
Dingtao Peng: Guizhou University
Naihua Xiu: Beijing Jiaotong University
Jian Yu: Guizhou University

Computational Optimization and Applications, 2017, vol. 67, issue 3, No 4, 543-569

Abstract: Abstract The affine rank minimization problem is to minimize the rank of a matrix under linear constraints. It has many applications in various areas such as statistics, control, system identification and machine learning. Unlike the literatures which use the nuclear norm or the general Schatten $$q~ (0

Keywords: Affine rank minimization problem; Matrix completion problem; $$S_{1/2}$$ S 1 / 2 Regularization problem; Fixed point algorithm; Singular value half thresholding operator; 90C06; 90C26; 90C59; 65F22 (search for similar items in EconPapers)
Date: 2017
References: View complete reference list from CitEc
Citations: View citations in EconPapers (1)

Downloads: (external link)
http://link.springer.com/10.1007/s10589-017-9898-5 Abstract (text/html)
Access to the full text of the articles in this series is restricted.

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:spr:coopap:v:67:y:2017:i:3:d:10.1007_s10589-017-9898-5

Ordering information: This journal article can be ordered from
http://www.springer.com/math/journal/10589

DOI: 10.1007/s10589-017-9898-5

Access Statistics for this article

Computational Optimization and Applications is currently edited by William W. Hager

More articles in Computational Optimization and Applications from Springer
Bibliographic data for series maintained by Sonal Shukla () and Springer Nature Abstracting and Indexing ().