Abstract:Optimization of quadratic functions and their quotients is relevant in subspace and iterative optimization methods. In this paper, we consider the matrix-free computation of the generalized operator norm and the maximization of a generalized Rayleigh quotient when only forward evaluations of two linear operators $A$ and $B$ are available. The proposed method samples search directions uniformly from the full unit sphere, thereby avoiding tangent-space sampling and explicit access to the metric matrix $B^{\mathrm T}B$. The exact line search along each sampled direction reduces to a $2\times2$ generalized eigenvalue problem on specific Gram matrices. In the generic case its maximizing step has a closed form. We prove that the objective values converge almost surely to the largest generalized eigenvalue and that the distance of the iterates to the leading generalized eigenspace converges to zero. We also relate full-sphere moment estimators to the Riemannian gradient and Hessian. The numerical experiments on synthetic Gaußian operators illustrate the behavior of the methods, and further studies of the proposed algorithms indicate favorable empirical convergence and weak dependence on the tested problem dimensions.
From: Jonas Bresch [view email]
[v1]
Wed, 29 Apr 2026 17:23:40 UTC (2,402 KB)
[v2]
Mon, 10 Aug 2026 17:22:09 UTC (2,952 KB)
此内容由惯性聚合(RSS阅读器)自动聚合整理，仅供阅读参考。 原文来自 — 版权归原作者所有。