A quadratically convergent algorithm for structured low-rank approximation
From MaRDI portal
Publication:285440
DOI10.1007/s10208-015-9256-xzbMath1347.65080arXiv1312.7279OpenAlexW2127771846MaRDI QIDQ285440
Pierre-Jean Spaenlehauer, Éric Schost
Publication date: 19 May 2016
Published in: Foundations of Computational Mathematics (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1312.7279
algorithmmatrix completionNewton iterationquadratic convergenceHankel matricesapproximate greatest common divisorstructured low-rank approximation
Lua error in Module:PublicationMSCList at line 37: attempt to index local 'msc_result' (a nil value).
Related Items (14)
Relaxed NewtonSLRA for approximate GCD ⋮ Computation of the nearest non-prime polynomial matrix: structured low-rank approximation approach ⋮ Exact solutions in low-rank approximation with zeros ⋮ An ODE-based method for computing the approximate greatest common divisor of polynomials ⋮ SLRA Interpolation for Approximate GCD of Several Multivariate Polynomials ⋮ Approximate square-free part and decomposition ⋮ Effective criteria for bigraded birational maps ⋮ Unnamed Item ⋮ Computing lower rank approximations of matrix polynomials ⋮ Computing approximate greatest common right divisors of differential polynomials ⋮ A Convex Relaxation to Compute the Nearest Structured Rank Deficient Matrix ⋮ Structured low-rank approximation: optimization on matrix manifold approach ⋮ Real polynomial root-finding by means of matrix and polynomial iterations ⋮ Variable projection methods for approximate (greatest) common divisor computations
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Fixed points, zeros and Newton's method
- Structured low rank approximations of the sylvester resultant matrix for approximate GCDS of Bernstein basis polynomials
- Quasi-gcd computations
- Determinantal rings
- On approximate GCDs of univariate polynomials
- Reducibility of polynomials \(f(x,y)\) modulo \(p\)
- Certified approximate univariate GCDs
- Newton's method for analytic systems of equations with constant rank derivatives
- Computation of approximate polynomial GCDs and an extension
- Structured low rank approximation
- Low rank approximation of a Hankel matrix by structured total least norm
- Two Newton methods on the manifold of fixed-rank matrices endowed with Riemannian quotient geometries
- A modified Newton-Raphson method for the solution of systems of equations
- Structured low-rank approximation and its applications
- Approximate factorization of multivariate polynomials using singular value decomposition
- Exact matrix completion via convex optimization
- Low-Rank Matrix Completion by Riemannian Optimization
- An iterative method for calculating approximate GCD of univariate polynomials
- Approximate greatest common divisors of several polynomials with linearly constrained coefficients and singular polynomials
- Computing nearest Gcd with certification
- Signal enhancement-a composite property mapping algorithm
- Structured Total Least Norm for Nonlinear Problems
- Approximate factorization of multivariate polynomials via differential equations
- The approximate GCD of inexact polynomials
- Linear Sections of Determinantal Varieties
- Exact Solutions in Structured Low-Rank Approximation
- The Power of Convex Relaxation: Near-Optimal Matrix Completion
- <tex>$QR$</tex>Factoring to Compute the GCD of Univariate Approximate Polynomials
- Alternating Projections on Manifolds
- A Simpler Approach to Matrix Completion
- Low-rank matrix completion using alternating minimization
- Best approximation in inner product spaces
- The Euclidean distance degree of an algebraic variety
This page was built for publication: A quadratically convergent algorithm for structured low-rank approximation
