Schatten-p Quasi-Norm Regularized Matrix Optimization via Iterative Reweighted Singular Value Minimization

by   Zhaosong Lu, et al.

In this paper we study general Schatten-p quasi-norm (SPQN) regularized matrix minimization problems. In particular, we first introduce a class of first-order stationary points for them, and show that the first-order stationary points introduced in [11] for an SPQN regularized vector minimization problem are equivalent to those of an SPQN regularized matrix minimization reformulation. We also show that any local minimizer of the SPQN regularized matrix minimization problems must be a first-order stationary point. Moreover, we derive lower bounds for nonzero singular values of the first-order stationary points and hence also of the local minimizers of the SPQN regularized matrix minimization problems. The iterative reweighted singular value minimization (IRSVM) methods are then proposed to solve these problems, whose subproblems are shown to have a closed-form solution. In contrast to the analogous methods for the SPQN regularized vector minimization problems, the convergence analysis of these methods is significantly more challenging. We develop a novel approach to establishing the convergence of these methods, which makes use of the expression of a specific solution of their subproblems and avoids the intricate issue of finding the explicit expression for the Clarke subdifferential of the objective of their subproblems. In particular, we show that any accumulation point of the sequence generated by the IRSVM methods is a first-order stationary point of the problems. Our computational results demonstrate that the IRSVM methods generally outperform some recently developed state-of-the-art methods in terms of solution quality and/or speed.


page 21

page 22


Iterative Reweighted Minimization Methods for l_p Regularized Unconstrained Nonlinear Programming

In this paper we study general l_p regularized unconstrained minimizatio...

Penalty Decomposition Methods for L0-Norm Minimization

In this paper we consider general l0-norm minimization problems, that is...

Lower Bounds for BMRM and Faster Rates for Training SVMs

Regularized risk minimization with the binary hinge loss and its variant...

Fast and Accurate Low-Rank Tensor Completion Methods Based on QR Decomposition and L_2,1 Norm Minimization

More recently, an Approximate SVD Based on Qatar Riyal (QR) Decompositio...

Generalized Singular Value Thresholding

This work studies the Generalized Singular Value Thresholding (GSVT) ope...

A generalized MBO diffusion generated motion for orthogonal matrix-valued fields

We consider the problem of finding stationary points of the Dirichlet en...

Local Saddle Point Optimization: A Curvature Exploitation Approach

Gradient-based optimization methods are the most popular choice for find...

Please sign up or login with your details

Forgot password? Click here to reset