Cover Image

Quasioptimal alternating projections and their use in low-rank approximation of matrices and tensors

Fuente: arXiv

Saved in:

Bibliographic Details
Main Author:	Budzinskiy, Stanislav
Format:	Preprint
Published:	2023
Subjects:	Optimization and Control Numerical Analysis
Online Access:	Acceder al recurso
Tags:	Add Tag No Tags, Be the first to tag this record!

Similar Items

On the distance to low-rank matrices in the maximum norm
by: Budzinskiy, Stanislav
Published: (2023)

When big data actually are low-rank, or entrywise approximation of certain function-generated matrices
by: Budzinskiy, Stanislav
Published: (2024)

Matrices over a Hilbert space and their low-rank approximation
by: Budzinskiy, Stanislav
Published: (2025)

Entrywise tensor-train approximation of large tensors via random embeddings
by: Budzinskiy, Stanislav
Published: (2024)

Variable projection framework for the reduced-rank matrix approximation problem by weighted least-squares
by: Terray, Pascal
Published: (2025)

Low-rank cross approximation of function-valued tensors for reduced-order modeling of parametric PDEs
by: Budzinskiy, Stanislav, et al.
Published: (2025)

A Riemannian rank-adaptive method for higher-order tensor completion in the tensor-train format
by: Vermeylen, Charlotte, et al.
Published: (2024)

A two-phase rank-based algorithm for low-rank matrix completion
by: Araújo, Tacildo de Souza, et al.
Published: (2022)

Optimization over bounded-rank matrices through a desingularization enables joint global and local guarantees
by: Rebjock, Quentin, et al.
Published: (2024)

Gauss-Southwell type descent methods for low-rank matrix optimization
by: Olikier, Guillaume, et al.
Published: (2023)

New perturbation bounds for low rank approximation of matrices: Beyond Eckart-Young-Mirsky
by: Tran, Phuc, et al.
Published: (2025)

On joint eigen-decomposition of matrices
by: Troedsson, Erik, et al.
Published: (2024)

Riemannian optimization using three different metrics for Hermitian PSD fixed-rank constraints: an extended version
by: Zheng, Shixin, et al.
Published: (2022)

Computing cone-constrained singular values of matrices
by: Barbarino, Giovanni, et al.
Published: (2025)

Subspace power method for symmetric tensor decomposition
by: Kileel, Joe, et al.
Published: (2019)

Generalized cyclic symmetric decompositions for the matrix multiplication tensor
by: Vermeylen, Charlotte, et al.
Published: (2024)

Eigenvalue bounds for preconditioned symmetric multiple saddle-point matrices
by: Bergamaschi, L., et al.
Published: (2025)

On approximating the nearest Ω-stable matrix
by: Choudhary, Neelam, et al.
Published: (2019)

Full- and low-rank exponential midpoint schemes for forward and adjoint Lindblad equations
by: Chen, Hao, et al.
Published: (2025)

Partial smoothness of the numerical radius at matrices whose fields of values are disks
by: Lewis, Adrian S., et al.
Published: (2018)

Characterizing matrices with eigenvalues in an LMI region: A dissipative-Hamiltonian approach
by: Choudhary, Neelam, et al.
Published: (2022)

Polynomial argmin for recovery and approximation of multivariate discontinuous functions
by: Henrion, Didier, et al.
Published: (2023)

H2 optimal rational approximation on general domains
by: Borghi, Alessandro, et al.
Published: (2023)

Tensor-based Dinkelbach method for computing generalized tensor eigenvalues and its applications
by: Chen, Haibin, et al.
Published: (2025)

Adaptive projected SOR algorithms for nonnegative quadratic programming
by: Miyatake, Yuto, et al.
Published: (2021)

Fast convergence of trust-regions for non-isolated minima via analysis of CG on indefinite matrices
by: Rebjock, Quentin, et al.
Published: (2023)

A reconstructed discontinuous approximation for distributed elliptic control problems
by: Li, Ruo, et al.
Published: (2025)

How averaged is the projection?
by: Song, Shuang
Published: (2023)

Second-order methods for quartically-regularised cubic polynomials, with applications to high-order tensor methods
by: Cartis, Coralia, et al.
Published: (2023)

A generalized Hurwitz stability criterion via rectangular block Hankel matrices for nonmonic matrix polynomials
by: Ni, Zixiang, et al.
Published: (2025)

Data-driven optimal approximation on Hardy spaces in simply connected domains
by: Borghi, Alessandro, et al.
Published: (2025)

Estimation of the input-to-state stability gain functions from finite-dimensional approximations
by: Hillebrecht, Birgit, et al.
Published: (2026)

Tensor train based sampling algorithms for approximating regularized Wasserstein proximal operators
by: Han, Fuqun, et al.
Published: (2024)

Chebyshev approximation by non-Chebyshev systems
by: Protasov, Vladimir Yu., et al.
Published: (2024)

Inexact Gauss-Newton methods with matrix approximation by sampling for nonlinear least-squares and systems
by: Bellavia, Stefania, et al.
Published: (2023)

An approximate Itô-SDE based simulated annealing algorithm for multivariate design optimization problems
by: Batou, A.
Published: (2019)

Suboptimality bounds for trace-bounded SDPs enable a faster and scalable low-rank SDP solver SDPLR+
by: Huang, Yufan, et al.
Published: (2024)

A comparison study of supervised learning techniques for the approximation of high dimensional functions and feedback control
by: Oster, Mathias, et al.
Published: (2024)

On feedback stabilisation for the Cahn-Hilliard equation and its numerical approximation
by: Egger, Herbert, et al.
Published: (2025)

Sensor network localization has a benign landscape after low-dimensional relaxation
by: Criscitiello, Christopher, et al.
Published: (2025)