Optimization Online


$S_{0.5}$ Regularization Methods and Fixed Point Algorithms for Affine Rank Minimization Problems

Peng Dingtao (dingtaopeng***at***126.com)
Xiu Naihua (nhxiu***at***bjtu.edu.cn)
Yu Jian (sci.jyu***at***gzu.edu.cn)

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}$ regularization problem; fixed point algorithm; singular value half thresholding operator

Category 1: Convex and Nonsmooth Optimization (Nonsmooth Optimization )

Category 2: Linear, Cone and Semidefinite Programming (Other )

Citation: 1/2013


Entry Submitted: 01/10/2013
Entry Accepted: 01/10/2013
Entry Last Modified: 05/01/2017

Modify/Update this entry

  Visitors Authors More about us Links
  Subscribe, Unsubscribe
Digest Archive
Search, Browse the Repository


Coordinator's Board
Classification Scheme
Give us feedback
Optimization Journals, Sites, Societies
Mathematical Optimization Society