Penalty decomposition methods for rank minimization
From MaRDI portal
Abstract: In this paper we consider general rank minimization problems with rank appearing in either objective function or constraint. We first establish that a class of special rank minimization problems has closed-form solutions. Using this result, we then propose penalty decomposition methods for general rank minimization problems in which each subproblem is solved by a block coordinate descend method. Under some suitable assumptions, we show that any accumulation point of the sequence generated by the penalty decomposition methods satisfies the first-order optimality conditions of a nonlinear reformulation of the problems. Finally, we test the performance of our methods by applying them to the matrix completion and nearest low-rank correlation matrix problems. The computational results demonstrate that our methods are generally comparable or superior to the existing methods in terms of solution quality.
Recommendations
- A penalty decomposition method for rank minimization problem with affine constraints
- A penalty method for rank minimization problems in symmetric matrices
- Sparse Approximation via Penalty Decomposition Methods
- Penalty-proximal methods in convex programming
- Exact penalization for cardinality and rank-constrained optimization problems via partial regularization
- A penalty decomposition method for nuclear norm minimization with l₁ norm fidelity term
- Optimal rank-sparsity decomposition
- Low-rank optimization with trace norm penalty
- Exact penalties for decomposable convex optimization problems
- A global exact penalty for rank-constrained optimization problem and applications
Cites work
- A sequential semismooth Newton method for the nearest low-rank correlation matrix problem
- ADMiRA: Atomic Decomposition for Minimum Rank Approximation
- An augmented Lagrangian dual approach for the H-weighted nearest correlation matrix problem
- An implementable proximal point algorithmic framework for nuclear norm minimization
- Convergence of a block coordinate descent method for nondifferentiable minimization
- Convex optimization methods for dimension reduction and coefficient estimation in multivariate linear regression
- Derivatives of Spectral Functions
- Efficient rank reduction of correlation matrices
- Estimation of Positive Semidefinite Correlation Matrices by Using Convex Quadratic Semidefinite Programming
- Exact matrix completion via convex optimization
- Fixed point and Bregman iterative methods for matrix rank minimization
- Guaranteed minimum-rank solutions of linear matrix equations via nuclear norm minimization
- scientific article; zbMATH DE number 47926 (Why is no real title available?)
- Improved iteratively reweighted least squares for unconstrained smoothed _q minimization
- Interior-point method for nuclear norm approximation with application to system identification
- Lectures on modern convex optimization. Analysis, algorithms, and engineering applications
- Low-rank matrix recovery via iteratively reweighted least squares minimization
- Maximum stable set formulations and heuristics based on continuous optimization
- Optimal low-rank approximation to a correlation matrix
- Parameterizing correlations: a geometric interpretation
- Review Paper. Interest–rate term–structure pricing models: a review
- Solving a low-rank factorization model for matrix completion by a nonlinear successive over-relaxation algorithm
- Sparse Optimization with Least-Squares Constraints
Cited in
(35)- A penalty method for rank minimization problems in symmetric matrices
- Global optimality condition and fixed point continuation algorithm for non-Lipschitz _p regularized matrix minimization
- A novel method for a class of structured low-rank minimizations with equality constraint
- \(\ell _p\) regularized low-rank approximation via iterative reweighted singular value minimization
- Error bounds for rank constrained optimization problems and applications
- An efficient method for convex constrained rank minimization problems based on DC programming
- Toeplitz matrix completion via smoothing augmented Lagrange multiplier algorithm
- Toeplitz matrix completion via a low-rank approximation algorithm
- Efficient proximal mapping computation for low-rank inducing norms
- A smoothing proximal gradient algorithm for matrix rank minimization problem
- Quaternion matrix optimization: motivation and analysis
- An inexact proximal DC algorithm with sieving strategy for rank constrained least squares semidefinite programming
- Bayesian rank penalization
- Two relaxation methods for rank minimization problems
- Homotopy method for matrix rank minimization based on the matrix hard thresholding method
- A penalty decomposition method for rank minimization problem with affine constraints
- Matrix optimization over low-rank spectral sets: stationary points and local and global minimizers
- Optimality conditions for rank-constrained matrix optimization
- \(S_{1/2}\) regularization methods and fixed point algorithms for affine rank minimization problems
- A successive difference-of-convex approximation method for a class of nonconvex nonsmooth optimization problems
- Low rank matrix minimization with a truncated difference of nuclear norm and Frobenius norm regularization
- A global exact penalty for rank-constrained optimization problem and applications
- Several classes of stationary points for rank regularized minimization problems
- Optimal rank-sparsity decomposition
- Sparse inverse covariance matrix estimation via the _0-norm with Tikhonov regularization
- A hybrid penalty method for a class of optimization problems with multiple rank constraints
- Spectral operators of matrices: semismoothness and characterizations of the generalized Jacobian
- Matrix completion via minimizing an approximate rank
- Sparse Approximation via Penalty Decomposition Methods
- An exact penalty method for semidefinite-box-constrained low-rank matrix optimization problems
- Exact penalization for cardinality and rank-constrained optimization problems via partial regularization
- Inexact penalty decomposition methods for optimization problems with geometric constraints
- A singular value shrinkage thresholding algorithm for folded concave penalized low-rank matrix optimization problems
- An efficient asymptotic DC method for sparse and low-rank matrix recovery
- A novel nonconvex penalty method for a rank constrained matrix optimization problem and its applications
This page was built for publication: Penalty decomposition methods for rank minimization
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2943834)
