Cover Image

Generalization of Zeroth-Order Method for Quotients of Quadratic Functions

Fuente: arXiv

Saved in:

Bibliographic Details
Main Author:	Bresch, Jonas
Format:	Preprint
Published:	2026
Subjects:	Optimization and Control Numerical Analysis Probability 65F35, 15A60, 68W20
Online Access:	Acceder al recurso
Tags:	Add Tag No Tags, Be the first to tag this record!

Similar Items

Computing adjoint mismatch of linear maps
by: Bresch, Jonas, et al.
Published: (2025)

Matrix-free stochastic calculation of operator norms without using adjoints
by: Bresch, Jonas, et al.
Published: (2024)

Beyond Expectation: Concentration Inequalities for Randomized Iterative Methods
by: Anderson, Toby, et al.
Published: (2025)

Subspace-constrained randomized coordinate descent for linear systems with good low-rank matrix approximations
by: Lok, Jackie, et al.
Published: (2025)

Efficient Sketching-Based Summation of Tucker Tensors
by: Smith, Rudi, et al.
Published: (2026)

Learning nonnegative matrix factorizations from compressed data
by: Chaudhry, Abraar, et al.
Published: (2024)

FlexTrace: Exchangeable Randomized Trace Estimation for Matrix Functions
by: Madhavan, Madhusudan, et al.
Published: (2026)

Survey of a Class of Iterative Row-Action Methods: The Kaczmarz Method
by: Ferreira, Inês A., et al.
Published: (2024)

A randomized preconditioned Cholesky-QR algorithm
by: Garrison, James E., et al.
Published: (2024)

Where Have All the Kaczmarz Iterates Gone?
by: Bergou, El Houcine, et al.
Published: (2025)

A Note on Randomized Kaczmarz Algorithm for Solving Doubly-Noisy Linear Systems
by: Bergou, El Houcine, et al.
Published: (2023)

Improving Sketching Algorithms for Low-Rank Matrix Approximation via Sketch-Power Iterations
by: Chang, Chao, et al.
Published: (2026)

Randomized Large-Scale Quaternion Matrix Approximation: Practical Rangefinders and One-Pass Algorithm
by: Chang, Chao, et al.
Published: (2024)

Beyond Low Rank: Fast Low-Rank + Diagonal Decomposition with a Spectral Approach
by: Yeon, Kingsley, et al.
Published: (2025)

Generalized matrix nearness problems II
by: Wang, Rongbiao Thomas, et al.
Published: (2026)

Randomized block-Krylov subspace methods for low-rank approximation of matrix functions
by: Persson, David, et al.
Published: (2025)

Fast and Accurate Interpolative Decompositions for General, Sparse, and Structured Tensors
by: Zhang, Yifan, et al.
Published: (2025)

Fast, High-Accuracy, Randomized Nullspace Computations for Tall Matrices
by: Epperly, Ethan N., et al.
Published: (2026)

On a randomized small-block Lanczos method for large-scale null space computations
by: Kressner, Daniel, et al.
Published: (2024)

Parallelization Strategies for the Randomized Kaczmarz Algorithm on Large-Scale Dense Systems
by: Ferreira, Inês, et al.
Published: (2024)

Accelerating a restarted Krylov method for matrix functions with randomization
by: Guidotti, Nicolas L., et al.
Published: (2025)

Randomized Flexible LSQR and LSMR with applications to inverse problems
by: Bucci, Alberto, et al.
Published: (2026)

Randomized algorithms for streaming low-rank approximation in tree tensor network format
by: Bucci, Alberto, et al.
Published: (2024)

A sequential multilinear Nyström algorithm for streaming low-rank approximation of tensors in Tucker format
by: Bucci, Alberto, et al.
Published: (2024)

Low-rank approximation of parameter-dependent matrices via CUR decomposition
by: Park, Taejun, et al.
Published: (2024)

HOSCF: Efficient decoupling algorithms for finding the best rank-one approximation of higher-order tensors
by: Xiao, Chuanfu, et al.
Published: (2024)

A randomized algorithm for simultaneously diagonalizing symmetric matrices by congruence
by: He, Haoze, et al.
Published: (2024)

Convergence of Markov Chains for Constant Step-size Stochastic Gradient Descent with Separable Functions
by: Shirokoff, David, et al.
Published: (2024)

Stochastic trace estimation for parameter-dependent matrices applied to spectral density approximation
by: Matti, Fabio, et al.
Published: (2025)

Numerical Instabilities in the Kaczmarz Method and Stabilization by Iterative Refinement
by: Dereziński, Michał, et al.
Published: (2026)

Bayesian D-Optimal Experimental Designs via Column Subset Selection
by: Eswar, Srinivas, et al.
Published: (2024)

Sharp error bounds for approximate eigenvalues and singular values from subspace methods
by: Haas, Irina-Beatrice, et al.
Published: (2025)

Efficient Bounds and Estimates for Canonical Angles in Randomized Subspace Approximations
by: Dong, Yijun, et al.
Published: (2022)

Matrix perturbation analysis of methods for extracting singular values from approximate singular subspaces
by: Lazzarino, Lorenzo, et al.
Published: (2024)

GMRES with randomized sketching and deflated restarting
by: Burke, Liam, et al.
Published: (2023)

Sketched and truncated polynomial Krylov methods: Evaluation of matrix functions
by: Palitta, Davide, et al.
Published: (2023)

A Mini-Batch Method for Solving Nonlinear PDEs with Gaussian Processes
by: Yang, Xianjin, et al.
Published: (2023)

On Subsample Size of Quantile-Based Randomized Kaczmarz
by: Cai, Jian-Feng, et al.
Published: (2025)

An accelerated randomized Bregman-Kaczmarz method for strongly convex linearly constraint optimization
by: Tondji, Lionel, et al.
Published: (2025)

Some Remarks on the Optimal Level of Randomization in Global Optimization
by: Theodosopoulos, Ted
Published: (2004)