Pages that link to "Item:Q4021609"
From MaRDI portal
The following pages link to Estimating the Largest Eigenvalue by the Power and Lanczos Algorithms with a Random Start (Q4021609):
Displaying 50 items.
- Sublinear time algorithms for approximate semidefinite programming (Q304246) (← links)
- A linear-time algorithm for trust region problems (Q304248) (← links)
- Bounding the spectrum of large Hermitian matrices (Q541913) (← links)
- Near-optimal stochastic approximation for online principal component estimation (Q681490) (← links)
- A fast randomized algorithm for the approximation of matrices (Q952399) (← links)
- On the randomized error of polynomial methods for eigenvector and eigenvalue estimates (Q1383440) (← links)
- Randomized error estimation for eigenvalue approximation (Q1570401) (← links)
- Symbolic and numeric methods for exploiting structure in constructing resultant matrices (Q1600039) (← links)
- A distributed Frank-Wolfe framework for learning low-rank matrices with the trace norm (Q1631800) (← links)
- A linear-time algorithm for the trust region subproblem based on hidden convexity (Q1686552) (← links)
- A note on probably certifiably correct algorithms (Q1695210) (← links)
- Error bounds on the power method for determining the largest eigenvalue of a symmetric, positive definite matrix (Q1808933) (← links)
- Randomization and the parallel solution of linear algebra problems (Q1905899) (← links)
- Computing the field of values and pseudospectra using the Lanczos method with continuation (Q1923867) (← links)
- An accelerated first-order method with complexity analysis for solving cubic regularization subproblems (Q2044484) (← links)
- Complexity of linear minimization and projection on some sets (Q2060605) (← links)
- Fast quantum subroutines for the simplex method (Q2061891) (← links)
- Randomized block Krylov methods for approximating extreme eigenvalues (Q2068363) (← links)
- Convergence rate of block-coordinate maximization Burer-Monteiro method for solving large SDPs (Q2089773) (← links)
- The generalized trust region subproblem: solution complexity and convex hull results (Q2118085) (← links)
- Approximate inversion of discrete Fourier integral operators (Q2133539) (← links)
- On norm compression inequalities for partitioned block tensors (Q2174201) (← links)
- Newton-type methods for non-convex optimization under inexact Hessian information (Q2205970) (← links)
- Hierarchical interpolative factorization preconditioner for parabolic equations (Q2219805) (← links)
- Globally maximizing the sum of squares of quadratic forms over the unit sphere (Q2228375) (← links)
- Spectrally-truncated kernel ridge regression and its free lunch (Q2233553) (← links)
- A linear-time algorithm for minimizing the ratio of quadratic functions with a quadratic constraint (Q2244966) (← links)
- Smallest eigenvalue of large Hankel matrices at critical point: comparing conjecture with parallelised computation (Q2286151) (← links)
- A Newton-CG algorithm with complexity guarantees for smooth unconstrained optimization (Q2297654) (← links)
- Combining stochastic adaptive cubic regularization with negative curvature for nonconvex optimization (Q2302838) (← links)
- Optimal information dissemination strategy to promote preventive behaviors in multilayer epidemic networks (Q2339924) (← links)
- Probabilistic upper bounds for the matrix two-norm (Q2441121) (← links)
- Cubic regularization methods with second-order complexity guarantee based on a new subproblem reformulation (Q2676160) (← links)
- Hierarchical interpolative factorization for elliptic operators: integral equations (Q2812291) (← links)
- Conditional gradient sliding for convex optimization (Q2816241) (← links)
- Evaluation of spectral zeta-functions with the renormalization group (Q2978947) (← links)
- Randomized algorithms for the low-rank approximation of matrices (Q3010073) (← links)
- A Deterministic Algorithm for the Frieze-Kannan Regularity Lemma (Q3088120) (← links)
- Hierarchical Interpolative Factorization for Elliptic Operators: Differential Equations (Q3185925) (← links)
- Probabilistic Bounds for the Matrix Condition Number with Extended Lanczos Bidiagonalization (Q3449798) (← links)
- Convex Relaxations for Permutation Problems (Q3456867) (← links)
- The Monte Carlo Algorithm with a Pseudorandom Generator (Q3987938) (← links)
- Perspectives on information-based complexity (Q3992024) (← links)
- Statistical Condition Estimation for Linear Systems (Q4389259) (← links)
- Accelerated Methods for NonConvex Optimization (Q4571877) (← links)
- Generalized Conditional Gradient for Sparse Estimation (Q4637076) (← links)
- Complexity Analysis of Second-Order Line-Search Algorithms for Smooth Nonconvex Optimization (Q4641667) (← links)
- Lanczos, Householder transformations, and implicit deflation for fast and reliable dominant singular subspace computation (Q4814584) (← links)
- Estimating a largest eigenvector by Lanczos and polynomial algorithms with a random start (Q4940818) (← links)
- Spectrum Approximation Beyond Fast Matrix Multiplication: Algorithms and Hardness (Q4993271) (← links)
