Interior-Point Method for Nuclear Norm Approximation with Application to System Identification
From MaRDI portal
Publication:3584157
DOI10.1137/090755436zbMath1201.90151OpenAlexW2059283452MaRDI QIDQ3584157
Lieven Vandenberghe, Zhang Liu
Publication date: 19 August 2010
Published in: SIAM Journal on Matrix Analysis and Applications (Search for Journal in Brave)
Full work available at URL: https://semanticscholar.org/paper/5f375bb9c691862caf11322679c94219c0057c83
system identificationsemidefinite programminginterior-point methodsmatrix rank minimizationsubspace algorithmnuclear norm approximation
Semidefinite programming (90C22) Convex programming (90C25) Interior-point methods (90C51) System identification (93B30)
Related Items (97)
On linear convergence of projected gradient method for a class of affine rank minimization problems ⋮ Convergence and stability of iteratively reweighted least squares for low-rank matrix recovery ⋮ A penalty method for rank minimization problems in symmetric matrices ⋮ \(S_{1/2}\) regularization methods and fixed point algorithms for affine rank minimization problems ⋮ Nuclear norm-based recursive subspace prediction of time-varying continuous-time stochastic systems via distribution theory ⋮ Regularized linear system identification using atomic, nuclear and kernel-based norms: the role of the stability constraint ⋮ Minimum \( n\)-rank approximation via iterative hard thresholding ⋮ Matrix completion via max-norm constrained optimization ⋮ Kernels for Linear Time Invariant System Identification ⋮ The most powerful unfalsified model for data with missing values ⋮ N2SID: nuclear norm subspace identification of innovation models ⋮ Unnamed Item ⋮ Unnamed Item ⋮ Global optimality condition and fixed point continuation algorithm for non-Lipschitz \(\ell_p\) regularized matrix minimization ⋮ Parallel stochastic gradient algorithms for large-scale matrix completion ⋮ A Nonmonotone Alternating Updating Method for a Class of Matrix Factorization Problems ⋮ On the minimum trace norm/energy of \((0,1)\)-matrices ⋮ \(s\)-goodness for low-rank matrix recovery ⋮ Ensemble learning-based computational imaging method for electrical capacitance tomography ⋮ Guarantees of Riemannian optimization for low rank matrix completion ⋮ Maximum entropy vector kernels for MIMO system identification ⋮ Dealing with missing information in data envelopment analysis by means of low-rank matrix completion ⋮ Approximation accuracy, gradient methods, and error bound for structured convex optimization ⋮ Nuclear norm subspace system identification and its application on a stochastic model of plague ⋮ Penalty decomposition methods for rank minimization ⋮ Approximation of rank function and its application to the nearest low-rank correlation matrix ⋮ An alternating minimization method for matrix completion problems ⋮ A new convergence analysis and perturbation resilience of some accelerated proximal forward–backward algorithms with errors ⋮ Exact minimum rank approximation via Schatten \(p\)-norm minimization ⋮ Multistage Convex Relaxation Approach to Rank Regularized Minimization Problems Based on Equivalent Mathematical Program with a Generalized Complementarity Constraint ⋮ An upper bound on the minimum rank of a symmetric Toeplitz matrix completion problem ⋮ Block-sparse recovery and rank minimization using a weighted \(l_p-l_q\) model ⋮ Hammerstein system identification using nuclear norm minimization ⋮ Proximal iteratively reweighted algorithm for low-rank matrix recovery ⋮ Normal Cones Intersection Rule and Optimality Analysis for Low-Rank Matrix Optimization with Affine Manifolds ⋮ Two relaxation methods for rank minimization problems ⋮ Null space conditions and thresholds for rank minimization ⋮ Low rank matrix completion by alternating steepest descent methods ⋮ Solving a low-rank factorization model for matrix completion by a nonlinear successive over-relaxation algorithm ⋮ An implementable proximal point algorithmic framework for nuclear norm minimization ⋮ Nuclear norm system identification with missing inputs and outputs ⋮ A new nonconvex approach to low-rank matrix completion with application to image inpainting ⋮ Proximity point algorithm for low-rank matrix recovery from sparse noise corrupted data ⋮ Noisy Matrix Completion: Understanding Statistical Guarantees for Convex Relaxation via Nonconvex Optimization ⋮ A singular value thresholding with diagonal-update algorithm for low-rank matrix completion ⋮ Kernel methods in system identification, machine learning and function estimation: a survey ⋮ Subspace-based spectrum estimation in innovation models by mixed norm minimization ⋮ Optimal rank-1 Hankel approximation of matrices: Frobenius norm and spectral norm and Cadzow's algorithm ⋮ The two-stage iteration algorithms based on the shortest distance for low-rank matrix completion ⋮ A relaxed interior point method for low-rank semidefinite programming problems with applications to matrix completion ⋮ On the equivalence between low-rank matrix completion and tensor rank ⋮ Rate-optimal perturbation bounds for singular subspaces with applications to high-dimensional statistics ⋮ Max-norm optimization for robust matrix recovery ⋮ Decomposable norm minimization with proximal-gradient homotopy algorithm ⋮ Finding a low-rank basis in a matrix subspace ⋮ Matrix recipes for hard thresholding methods ⋮ Convergence of projected Landweber iteration for matrix rank minimization ⋮ An alternating direction algorithm for matrix completion with nonnegative factors ⋮ Convergence of fixed-point continuation algorithms for matrix rank minimization ⋮ Low-rank and sparse matrices fitting algorithm for low-rank representation ⋮ Fixed point and Bregman iterative methods for matrix rank minimization ⋮ Toeplitz matrix completion via smoothing augmented Lagrange multiplier algorithm ⋮ Estimation of (near) low-rank matrices with noise and high-dimensional scaling ⋮ Projected Landweber iteration for matrix completion ⋮ Homotopy method for matrix rank minimization based on the matrix hard thresholding method ⋮ Unnamed Item ⋮ Approximating the minimum rank of a graph via alternating projection ⋮ A penalty decomposition method for rank minimization problem with affine constraints ⋮ Recovery of simultaneous low rank and two-way sparse coefficient matrices, a nonconvex approach ⋮ Recovery of Low Rank Symmetric Matrices via Schatten p Norm Minimization ⋮ A unified framework for high-dimensional analysis of \(M\)-estimators with decomposable regularizers ⋮ System identification using kernel-based regularization: new insights on stability and consistency issues ⋮ Convergence analysis of projected gradient descent for Schatten-\(p\) nonconvex matrix recovery ⋮ Decentralized and privacy-preserving low-rank matrix completion ⋮ Minimal rank completions for overlapping blocks ⋮ Low-rank factorization for rank minimization with nonconvex regularizers ⋮ Regularization parameter selection for the low rank matrix recovery ⋮ Flip-flop spectrum-revealing QR factorization and its applications to singular value decomposition ⋮ A Single-Phase, Proximal Path-Following Framework ⋮ Guarantees of Riemannian Optimization for Low Rank Matrix Recovery ⋮ Minimization of the difference of Nuclear and Frobenius norms for noisy low rank matrix recovery ⋮ A new method based on the manifold-alternative approximating for low-rank matrix completion ⋮ A semi-smoothing augmented Lagrange multiplier algorithm for low-rank Toeplitz matrix completion ⋮ Toeplitz matrix completion via a low-rank approximation algorithm ⋮ An adaptation for iterative structured matrix completion ⋮ An alternating minimization method for robust principal component analysis ⋮ Truncated sparse approximation property and truncated \(q\)-norm minimization ⋮ Alternating direction and Taylor expansion minimization algorithms for unconstrained nuclear norm optimization ⋮ Optimization-Based Modal Decomposition for Systems with Multiple Transports ⋮ A Splitting Augmented Lagrangian Method for Low Multilinear-Rank Tensor Recovery ⋮ A modified primal-dual method with applications to some sparse recovery problems ⋮ Weighted lp − l1 minimization methods for block sparse recovery and rank minimization ⋮ A Superlinearly Convergent Smoothing Newton Continuation Algorithm for Variational Inequalities over Definable Sets ⋮ Truncated $l_{1-2}$ Models for Sparse Recovery and Rank Minimization ⋮ Semi-supervised learning with nuclear norm regularization ⋮ Continuous-time Laguerre-based subspace identification utilising nuclear norm minimisation ⋮ Low rank matrix recovery with adversarial sparse noise*
Uses Software
This page was built for publication: Interior-Point Method for Nuclear Norm Approximation with Application to System Identification
