Pages that link to "Item:Q2348979"

The following pages link to Software for weighted structured low-rank approximation (Q2348979):

Displaying 25 items.

• Realization and identification of autonomous linear periodically time-varying systems (Q458862) (← links)
• Optimization on a Grassmann manifold with application to system identification (Q458866) (← links)
• Rank constrained matrix best approximation problem with respect to (skew) Hermitian matrices (Q515752) (← links)
• Reduction of nonlinear embedded boundary models for problems with evolving interfaces (Q728679) (← links)
• Rank constrained matrix best approximation problem (Q894411) (← links)
• Stochastic algorithms for solving structured low-rank matrix approximation problems (Q907198) (← links)
• Low-rank approximation. Algorithms, implementation, applications (Q1795645) (← links)
• Optimal approximation with exponential sums by a maximum likelihood modification of Prony's method (Q2000539) (← links)
• Minimum rank positive semidefinite solution to the matrix approximation problem in the spectral norm (Q2186731) (← links)
• Variable projection for affinely structured low-rank approximation in weighted \(2\)-norms (Q2253087) (← links)
• Minimum rank Hermitian solution to the matrix approximation problem in the spectral norm and its application (Q2275184) (← links)
• Blind deconvolution of covariance matrix inverses for autoregressive processes (Q2310396) (← 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)
• Structured low-rank approximation with missing data (Q2848639) (← links)
• Algorithms and Literate Programs for Weighted Low-Rank Approximation with Missing Data (Q2908407) (← links)
• Structured weighted low rank approximation (Q3412447) (← links)
• (Q3707252) (← 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)
• An inexact projected gradient method with rounding and lifting by nonlinear programming for solving rank-one semidefinite relaxation of polynomial optimization (Q6165592) (← links)
• MIMO system identification using common denominator and numerators with known degrees (Q6495683) (← links)
• A Riemannian optimization method to compute the nearest singular pencil (Q6641762) (← links)