Pages that link to "Item:Q3584157"

The following pages link to Interior-Point Method for Nuclear Norm Approximation with Application to System Identification (Q3584157):

Displaying 25 items.

• Regularized linear system identification using atomic, nuclear and kernel-based norms: the role of the stability constraint (Q286265) (← links)
• Minimum \( n\)-rank approximation via iterative hard thresholding (Q299732) (← links)
• Matrix completion via max-norm constrained optimization (Q302432) (← links)
• The most powerful unfalsified model for data with missing values (Q305625) (← links)
• N2SID: nuclear norm subspace identification of innovation models (Q311894) (← links)
• \(s\)-goodness for low-rank matrix recovery (Q369686) (← links)
• Approximation of rank function and its application to the nearest low-rank correlation matrix (Q386463) (← links)
• Exact minimum rank approximation via Schatten \(p\)-norm minimization (Q396052) (← links)
• An implementable proximal point algorithmic framework for nuclear norm minimization (Q431025) (← links)
• Kernel methods in system identification, machine learning and function estimation: a survey (Q462325) (← links)
• Decomposable norm minimization with proximal-gradient homotopy algorithm (Q513723) (← links)
• Finding a low-rank basis in a matrix subspace (Q517309) (← links)
• Convergence of fixed-point continuation algorithms for matrix rank minimization (Q535287) (← links)
• Fixed point and Bregman iterative methods for matrix rank minimization (Q543413) (← links)
• Estimation of (near) low-rank matrices with noise and high-dimensional scaling (Q548547) (← links)
• Approximation accuracy, gradient methods, and error bound for structured convex optimization (Q607498) (← links)
• Null space conditions and thresholds for rank minimization (Q633114) (← links)
• Max-norm optimization for robust matrix recovery (Q681486) (← links)
• An alternating direction algorithm for matrix completion with nonnegative factors (Q693195) (← links)
• Projected Landweber iteration for matrix completion (Q708281) (← links)
• Low rank matrix recovery with adversarial sparse noise* (Q5030160) (← links)
• Flip-flop spectrum-revealing QR factorization and its applications to singular value decomposition (Q5218403) (← links)
• A Single-Phase, Proximal Path-Following Framework (Q5219702) (← links)
• Block-sparse recovery and rank minimization using a weighted \(l_p-l_q\) model (Q6062413) (← links)
• Normal Cones Intersection Rule and Optimality Analysis for Low-Rank Matrix Optimization with Affine Manifolds (Q6116233) (← links)