Cover Image

Gauss-Southwell type descent methods for low-rank matrix optimization

Fuente: arXiv

Saved in:

Bibliographic Details
Main Authors:	Olikier, Guillaume, Uschmajew, André, Vandereycken, Bart
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

A geodesic convexity-like structure for the polar decomposition of a square matrix
by: Alimisis, Foivos, 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)

Accelerating operator Sinkhorn iteration with overrelaxation
by: Soma, Tasuku, et al.
Published: (2024)

Gradient-type subspace iteration methods for the symmetric eigenvalue problem
by: Alimisis, Foivos, et al.
Published: (2023)

Low-rank optimization methods based on projected projected-gradient descent that accumulate at Bouligand stationary points
by: Olikier, Guillaume, et al.
Published: (2022)

Computing Bouligand stationary points efficiently in low-rank optimization
by: Olikier, Guillaume, 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)

Numerically stable variants of overrelaxation for operator Sinkhorn iteration
by: Eisenmann, Henrik, et al.
Published: (2026)

An apocalypse-free first-order low-rank optimization algorithm with at most one rank reduction attempt per iteration
by: Olikier, Guillaume, et al.
Published: (2022)

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

Retractions on closed sets
by: Olikier, Guillaume
Published: (2024)

Projected gradient descent accumulates at Bouligand stationary points
by: Olikier, Guillaume, et al.
Published: (2024)

Natural Riemannian gradient for learning functional tensor networks
by: Klug, Nikolas, et al.
Published: (2026)

RGNMR: A Gauss-Newton method for robust matrix completion with theoretical guarantees
by: Laufer, Eilon Vaknin, et al.
Published: (2025)

Anderson-type acceleration method for Deep Neural Network optimization
by: Ito, Kazufumi, et al.
Published: (2025)

A perturbed preconditioned gradient descent method for the unconstrained minimization of composite objectives
by: Park, Jea-Hyun, et al.
Published: (2025)

A monotone block coordinate descent method for solving absolute value equations
by: Luo, Tingting, et al.
Published: (2024)

Stochastic dual coordinate descent with adaptive heavy ball momentum for linearly constrained convex optimization
by: Zeng, Yun, et al.
Published: (2023)

Optimization methods for solving matrix equations
by: Zhang, Juan, et al.
Published: (2024)

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

Quasioptimal alternating projections and their use in low-rank approximation of matrices and tensors
by: Budzinskiy, Stanislav
Published: (2023)

An extended Gauss-Newton method for full waveform inversion
by: Gholami, Ali
Published: (2023)

Learning rate adaptive stochastic gradient descent optimization methods: numerical simulations for deep learning methods for partial differential equations and convergence analyses
by: Dereich, Steffen, et al.
Published: (2024)

Limited memory gradient methods for unconstrained optimization
by: Ferrandi, Giulia, et al.
Published: (2023)

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

Flattened one-bit stochastic gradient descent: compressed distributed optimization with controlled variance
by: Stollenwerk, Alexander, et al.
Published: (2024)

Efficient nonlocal linear image denoising: Bilevel optimization with Nonequispaced Fast Fourier Transform and matrix-free preconditioning
by: Miniguano-Trujillo, Andrés, et al.
Published: (2024)

A generalization of the Newton-based matrix splitting iteration method for generalized absolute value equations
by: Li, Xuehua, et al.
Published: (2023)

An inexact framework of the Newton-based matrix splitting iterative method for the generalized absolute value equation
by: Yu, Dongmei, et al.
Published: (2021)

Particle method for a nonlinear multimarginal optimal transport problem
by: Cances, Adrien, et al.
Published: (2026)

IETI-based Low-Rank method for PDE-constrained optimization
by: Bünger, Alexandra, et al.
Published: (2024)

An efficient algorithm for entropic optimal transport under martingale-type constraints
by: Tang, Xun, et al.
Published: (2025)

Convergence of a steepest descent algorithm in shape optimisation using $W^{1,\infty}$ functions
by: Deckelnick, Klaus, et al.
Published: (2023)

Regularized methods via cubic model subspace minimization for nonconvex optimization
by: Bellavia, Stefania, et al.
Published: (2023)

On a fixed-point continuation method for a convex optimization problem
by: Fest, Jean-Baptiste, et al.
Published: (2022)

An accelerated gradient method with adaptive restart for convex multiobjective optimization problems
by: Luo, Hao, et al.
Published: (2025)

Non-overlapping Schwarz methods in time for parabolic optimal control problems
by: Gander, Martin Jakob, et al.
Published: (2024)

A robust and stable phase field method for structural topology optimization
by: Chen, Huangxin, et al.
Published: (2025)

Weak Scalability of time parallel Schwarz methods for parabolic optimal control problems
by: Lu, Liu-Di, et al.
Published: (2026)

Augmented Lagrangian methods for infeasible convex optimization problems and diverging proximal-point algorithms
by: Andrews, Roland, et al.
Published: (2025)