Hankel Matrix Rank Minimization with Applications to System Identification and Realization
From MaRDI portal
Publication:2866219
DOI10.1137/110853996zbMath1302.90127OpenAlexW2056145308WikidataQ57511221 ScholiaQ57511221MaRDI QIDQ2866219
Defeng Sun, Ting Kei Pong, Maryam Fazel, Paul Tseng
Publication date: 13 December 2013
Published in: SIAM Journal on Matrix Analysis and Applications (Search for Journal in Brave)
Full work available at URL: https://semanticscholar.org/paper/1e6ddff3443997b22ea8381ac070952963ba9fc9
Convex programming (90C25) Large-scale problems in mathematical programming (90C06) Applications of mathematical programming (90C90) System identification (93B30) Identification in stochastic control theory (93E12)
Related Items (only showing first 100 items - show all)
An efficient semismooth Newton method for adaptive sparse signal recovery problems ⋮ Solving the OSCAR and SLOPE Models Using a Semismooth Newton-Based Augmented Lagrangian Method ⋮ Edge adaptive hybrid regularization model for image deblurring ⋮ Efficient dual ADMMs for sparse compressive sensing MRI reconstruction ⋮ Tensor completion by multi-rank via unitary transformation ⋮ An upper bound on the minimum rank of a symmetric Toeplitz matrix completion problem ⋮ Majorized iPADMM for Nonseparable Convex Minimization Models with Quadratic Coupling Terms ⋮ A golden ratio proximal alternating direction method of multipliers for separable convex optimization ⋮ A binary characterization method for shape convexity and applications ⋮ Variational analysis of norm cones in finite dimensional Euclidean spaces ⋮ Fully-connected tensor network decomposition for robust tensor completion problem ⋮ Doubly iteratively reweighted algorithm for constrained compressed sensing models ⋮ An efficient semi-proximal ADMM algorithm for low-rank and sparse regularized matrix minimization problems with real-world applications ⋮ A FE-ADMM algorithm for Lavrentiev-regularized state-constrained elliptic control problem ⋮ Impulse noise removal by using a nonconvex TGV regularizer and nonconvex fidelity ⋮ Normal Cones Intersection Rule and Optimality Analysis for Low-Rank Matrix Optimization with Affine Manifolds ⋮ Unnamed Item ⋮ Perturbation analysis of the Euclidean distance matrix optimization problem and its numerical implications ⋮ HTR-CTO algorithm for wireless data recovery ⋮ Kernel-based identification with frequency domain side-information ⋮ Communication-efficient distributed estimation for high-dimensional large-scale linear regression ⋮ Decomposition of dynamical signals into jumps, oscillatory patterns, and possible outliers ⋮ A weighted gradient model with total variation regularization for multi-focus image fusion ⋮ An iDCA with sieving strategy for PDE-constrained optimization problems with \(L^{1-2}\)-control cost ⋮ Synchronous distributed ADMM for consensus convex optimization problems with self-loops ⋮ The Proximal Alternating Direction Method of Multipliers in the Nonconvex Setting: Convergence Analysis and Rates ⋮ Alternating Direction Methods for Latent Variable Gaussian Graphical Model Selection ⋮ Data Driven Tight Frame for Compressed Sensing MRI Reconstruction via Off-the-Grid Regularization ⋮ A Three-Stage Variational Image Segmentation Framework Incorporating Intensity Inhomogeneity Information ⋮ Convergence revisit on generalized symmetric ADMM ⋮ Hankel tensors, Vandermonde tensors and their positivities ⋮ A Schur complement based semi-proximal ADMM for convex quadratic conic programming and extensions ⋮ ADMM for multiaffine constrained optimization ⋮ Spectral Operators of Matrices: Semismoothness and Characterizations of the Generalized Jacobian ⋮ Flip-flop spectrum-revealing QR factorization and its applications to singular value decomposition ⋮ Linear Rate Convergence of the Alternating Direction Method of Multipliers for Convex Composite Programming ⋮ On the iteration-complexity of a non-Euclidean hybrid proximal extragradient framework and of a proximal ADMM ⋮ The Analytic Solutions of a Class of Constrained Matrix Minimization and Maximization Problems with Applications ⋮ Efficient Sparse Semismooth Newton Methods for the Clustered Lasso Problem ⋮ Blind Ptychographic Phase Retrieval via Convergent Alternating Direction Method of Multipliers ⋮ An image sharpening operator combined with framelet for image deblurring ⋮ Spectrum estimation with missing values: A regularized nuclear norm minimization approach ⋮ Duality Mapping for Schatten Matrix Norms ⋮ A Convergent 3-Block SemiProximal Alternating Direction Method of Multipliers for Conic Programming with 4-Type Constraints ⋮ On the Convergence Rate of Inexact Majorized sGS ADMM with Indefinite Proximal Terms for Convex Composite Programming ⋮ Portfolio Selection with Regularization ⋮ Alternating Direction Method of Multipliers for a Class of Nonconvex and Nonsmooth Problems with Applications to Background/Foreground Extraction ⋮ A Dimension Reduction Technique for Large-Scale Structured Sparse Optimization Problems with Application to Convex Clustering ⋮ Convergence analysis on a modified generalized alternating direction method of multipliers ⋮ Alternating direction method of multipliers with variable metric indefinite proximal terms for convex optimization ⋮ Continuous dynamics related to monotone inclusions and non-smooth optimization problems ⋮ An efficient algorithm for batch images alignment with adaptive rank-correction term ⋮ On how to solve large-scale log-determinant optimization problems ⋮ A General Inertial Proximal Point Algorithm for Mixed Variational Inequality Problem ⋮ The most powerful unfalsified model for data with missing values ⋮ ADMM for monotone operators: convergence analysis and rates ⋮ Inertial Proximal ADMM for Linearly Constrained Separable Convex Optimization ⋮ A globally convergent method for solving a quartic generalized Markowitz portfolio problem ⋮ N2SID: nuclear norm subspace identification of innovation models ⋮ A rank-corrected procedure for matrix completion with fixed basis coefficients ⋮ An algorithm twisted from generalized ADMM for multi-block separable convex minimization models ⋮ On the global and linear convergence of direct extension of ADMM for 3-block separable convex minimization models ⋮ Inertial alternating direction method of multipliers for non-convex non-smooth optimization ⋮ Alternating proximal gradient method for convex minimization ⋮ Inertial generalized proximal Peaceman-Rachford splitting method for separable convex programming ⋮ A proximal ADMM with the Broyden family for convex optimization problems ⋮ An ADMM algorithm for two-stage stochastic programming problems ⋮ A nonconvex \(l_1 (l_1-l_2)\) model for image restoration with impulse noise ⋮ Image restoration: structured low rank matrix framework for piecewise smooth functions and beyond ⋮ An accelerated proximal augmented Lagrangian method and its application in compressive sensing ⋮ Regular and limiting normal cones to the graph of the subdifferential mapping of the nuclear norm ⋮ Efficient color image segmentation via quaternion-based \(L_1/L_2\) Regularization ⋮ A new interpretation of the progressive hedging algorithm for multistage stochastic minimization problems ⋮ An improved total variation regularized RPCA for moving object detection with dynamic background ⋮ Miscellaneous reverse order laws for generalized inverses of matrix products with applications ⋮ Dynamic behavior analysis via structured rank minimization ⋮ Unnamed Item ⋮ A primal majorized semismooth Newton-CG augmented Lagrangian method for large-scale linearly constrained convex programming ⋮ Improved Pointwise Iteration-Complexity of A Regularized ADMM and of a Regularized Non-Euclidean HPE Framework ⋮ Matrix completion for matrices with low-rank displacement ⋮ Nuclear norm system identification with missing inputs and outputs ⋮ A survey on operator splitting and decomposition of convex programs ⋮ A 2-block semi-proximal ADMM for solving the H-weighted nearest correlation matrix problem ⋮ Kernel methods in system identification, machine learning and function estimation: a survey ⋮ On the equivalence of inexact proximal ALM and ADMM for a class of convex composite programming ⋮ A multi-stage convex relaxation approach to noisy structured low-rank matrix recovery ⋮ Fixing and extending some recent results on the ADMM algorithm ⋮ A partially proximal S-ADMM for separable convex optimization with linear constraints ⋮ Multi-block nonconvex nonsmooth proximal ADMM: convergence and rates under Kurdyka-Łojasiewicz property ⋮ Several Classes of Stationary Points for Rank Regularized Minimization Problems ⋮ 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 ⋮ A generalized alternating direction method of multipliers with semi-proximal terms for convex composite conic programming ⋮ Decomposition Methods for Computing Directional Stationary Solutions of a Class of Nonsmooth Nonconvex Optimization Problems ⋮ An inexact PAM method for computing Wasserstein barycenter with unknown supports ⋮ An alternating direction method of multipliers with the BFGS update for structured convex quadratic optimization ⋮ An efficient duality-based approach for PDE-constrained sparse optimization ⋮ An efficient inexact symmetric Gauss-Seidel based majorized ADMM for high-dimensional convex composite conic programming ⋮ A note on the sufficient initial condition ensuring the convergence of directly extended 3-block ADMM for special semidefinite programming ⋮ A note on the convergence of ADMM for linearly constrained convex optimization problems
This page was built for publication: Hankel Matrix Rank Minimization with Applications to System Identification and Realization
