Pages that link to "Item:Q2440674"

The following pages link to Structured low-rank approximation and its applications (Q2440674):

Displaying 36 items.

• A quadratically convergent algorithm for structured low-rank approximation (Q285440) (← links)
• The most powerful unfalsified model for data with missing values (Q305625) (← links)
• Alternating projections on nontangential manifolds (Q387545) (← links)
• Computing the radius of controllability for state space systems (Q414570) (← links)
• Optimization on a Grassmann manifold with application to system identification (Q458866) (← links)
• Discretisation of sparse linear systems: an optimisation approach (Q893990) (← links)
• Stochastic algorithms for solving structured low-rank matrix approximation problems (Q907198) (← links)
• Nearest matrix with prescribed eigenvalues and its applications (Q908369) (← links)
• Speeding up finite-time consensus via minimal polynomial of a weighted graph -- a numerical approach (Q1797040) (← links)
• Meshless Hermite-HDMR finite difference method for high-dimensional Dirichlet problems (Q2000930) (← links)
• A gradient system approach for Hankel structured low-rank approximation (Q2029850) (← links)
• Perturbation expansions and error bounds for the truncated singular value decomposition (Q2041768) (← links)
• Low phase-rank approximation (Q2074973) (← links)
• Variable projection for affinely structured low-rank approximation in weighted \(2\)-norms (Q2253087) (← links)
• Computing lower rank approximations of matrix polynomials (Q2284958) (← links)
• Multi-kernel unmixing and super-resolution using the modified matrix pencil method (Q2291571) (← links)
• Variable projection methods for approximate (greatest) common divisor computations (Q2357371) (← links)
• Rank-constrained optimization and its applications (Q2409136) (← links)
• An ODE-based method for computing the approximate greatest common divisor of polynomials (Q2420166) (← links)
• A successive difference-of-convex approximation method for a class of nonconvex nonsmooth optimization problems (Q2425176) (← links)
• Optimization challenges in the structured low rank approximation problem (Q2434635) (← links)
• Low rank approximation of the symmetric positive semidefinite matrix (Q2511200) (← links)
• Computation of the nearest non-prime polynomial matrix: structured low-rank approximation approach (Q2656632) (← links)
• Exact solutions in low-rank approximation with zeros (Q2669183) (← links)
• Proximal linearization methods for Schatten \(p\)-quasi-norm minimization (Q2678970) (← links)
• A global exact penalty for rank-constrained optimization problem and applications (Q2696914) (← links)
• Weighted norms in subspace-based methods for time series analysis (Q2955991) (← links)
• Nonlinearly Structured Low-Rank Approximation (Q3449314) (← links)
• Upper and lower bounds for the rank of the matrix-valued function when <i>X</i> has a fixed rank (Q4603681) (← links)
• Prony methods for recovery of structured functions (Q4982277) (← links)
• A Convex Relaxation to Compute the Nearest Structured Rank Deficient Matrix (Q4994436) (← links)
• A Hybrid Penalty Method for a Class of Optimization Problems with Multiple Rank Constraints (Q5146698) (← links)
• An ODE-Based Method for Computing the Distance of Coprime Polynomials to Common Divisibility (Q5270354) (← links)
• Goal-Oriented Optimal Approximations of Bayesian Linear Inverse Problems (Q5372624) (← links)
• Best Low-rank Approximations and Kolmogorov $n$-widths (Q5857847) (← links)
• An inexact projected gradient method with rounding and lifting by nonlinear programming for solving rank-one semidefinite relaxation of polynomial optimization (Q6165592) (← links)