Software for weighted structured low-rank approximation
From MaRDI portal
Recommendations
- Structured weighted low rank approximation
- Structured low-rank approximation and its applications
- Factorization approach to structured low-rank approximation with applications
- Variable projection for affinely structured low-rank approximation in weighted \(2\)-norms
- Low rank approximation. Algorithms, implementation, applications
Cited in
(28)- Low-rank approximation. Algorithms, implementation, applications
- Optimal approximation with exponential sums by a maximum likelihood modification of Prony's method
- Minimum rank positive semidefinite solution to the matrix approximation problem in the spectral norm
- Variable projection for affinely structured low-rank approximation in weighted \(2\)-norms
- Minimum rank Hermitian solution to the matrix approximation problem in the spectral norm and its application
- Blind deconvolution of covariance matrix inverses for autoregressive processes
- Variable projection methods for approximate (greatest) common divisor computations
- Rank-constrained optimization and its applications
- An ODE-based method for computing the approximate greatest common divisor of polynomials
- Structured low-rank approximation with missing data
- Algorithms and Literate Programs for Weighted Low-Rank Approximation with Missing Data
- Factorization approach to structured low-rank approximation with applications
- Structured weighted low rank approximation
- scientific article; zbMATH DE number 3936369 (Why is no real title available?)
- Realization and identification of autonomous linear periodically time-varying systems
- Optimization on a Grassmann manifold with application to system identification
- A convex relaxation to compute the nearest structured rank deficient matrix
- A hybrid penalty method for a class of optimization problems with multiple rank constraints
- Rank constrained matrix best approximation problem with respect to (skew) Hermitian matrices
- An ODE-Based Method for Computing the Distance of Coprime Polynomials to Common Divisibility
- An inexact projected gradient method with rounding and lifting by nonlinear programming for solving rank-one semidefinite relaxation of polynomial optimization
- MIMO system identification using common denominator and numerators with known degrees
- A Riemannian optimization method to compute the nearest singular pencil
- A Geometry-Adaptive Regularized Newton-Type Method for Manifold-Affine Intersection Problems
- Reduction of nonlinear embedded boundary models for problems with evolving interfaces
- Riemann-oracle: a general-purpose Riemannian optimizer to solve nearness problems in matrix theory
- Rank constrained matrix best approximation problem
- Stochastic algorithms for solving structured low-rank matrix approximation problems
This page was built for publication: Software for weighted structured low-rank approximation
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2348979)
