Structured low-rank approximation and its applications

From MaRDI portal
Revision as of 22:44, 2 February 2024 by Import240129110113 (talk | contribs) (Created automatically from import240129110113)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)

Publication:2440674

DOI10.1016/J.AUTOMATICA.2007.09.011zbMath1283.93061DBLPjournals/automatica/Markovsky08OpenAlexW2126625374WikidataQ60395824 ScholiaQ60395824MaRDI QIDQ2440674

Ivan Markovsky

Publication date: 19 March 2014

Published in: Automatica (Search for Journal in Brave)

Full work available at URL: https://eprints.soton.ac.uk/263379/1/slra_answer.pdf




Related Items (36)

A quadratically convergent algorithm for structured low-rank approximationNonlinearly Structured Low-Rank ApproximationThe most powerful unfalsified model for data with missing valuesComputation of the nearest non-prime polynomial matrix: structured low-rank approximation approachRank-constrained optimization and its applicationsExact solutions in low-rank approximation with zerosAlternating projections on nontangential manifoldsAn ODE-based method for computing the approximate greatest common divisor of polynomialsProximal linearization methods for Schatten \(p\)-quasi-norm minimizationDiscretisation of sparse linear systems: an optimisation approachWeighted norms in subspace-based methods for time series analysisComputing the radius of controllability for state space systemsA successive difference-of-convex approximation method for a class of nonconvex nonsmooth optimization problemsAn inexact projected gradient method with rounding and lifting by nonlinear programming for solving rank-one semidefinite relaxation of polynomial optimizationUpper and lower bounds for the rank of the matrix-valued function when X has a fixed rankStochastic algorithms for solving structured low-rank matrix approximation problemsNearest matrix with prescribed eigenvalues and its applicationsOptimization challenges in the structured low rank approximation problemA global exact penalty for rank-constrained optimization problem and applicationsGoal-Oriented Optimal Approximations of Bayesian Linear Inverse ProblemsOptimization on a Grassmann manifold with application to system identificationA Hybrid Penalty Method for a Class of Optimization Problems with Multiple Rank ConstraintsVariable projection for affinely structured low-rank approximation in weighted \(2\)-normsMeshless Hermite-HDMR finite difference method for high-dimensional Dirichlet problemsA gradient system approach for Hankel structured low-rank approximationComputing lower rank approximations of matrix polynomialsLow rank approximation of the symmetric positive semidefinite matrixSpeeding up finite-time consensus via minimal polynomial of a weighted graph -- a numerical approachMulti-kernel unmixing and super-resolution using the modified matrix pencil methodPerturbation expansions and error bounds for the truncated singular value decompositionProny methods for recovery of structured functionsLow phase-rank approximationA Convex Relaxation to Compute the Nearest Structured Rank Deficient MatrixBest Low-rank Approximations and Kolmogorov $n$-widthsAn ODE-Based Method for Computing the Distance of Coprime Polynomials to Common DivisibilityVariable projection methods for approximate (greatest) common divisor computations


Uses Software



Cites Work




This page was built for publication: Structured low-rank approximation and its applications