Estimating the Largest Eigenvalue by the Power and Lanczos Algorithms with a Random Start
From MaRDI portal
Publication:4021609
Recommendations
- Estimating a largest eigenvector by Lanczos and polynomial algorithms with a random start
- Error bounds on the power method for determining the largest eigenvalue of a symmetric, positive definite matrix
- Probabilistic Bounds on the Extremal Eigenvalues and Condition Number by the Lanczos Algorithm
- Randomized error estimation for eigenvalue approximation
- On the randomized error of polynomial methods for eigenvector and eigenvalue estimates
Cited in
(83)- An optimal-storage approach to semidefinite programming using approximate complementarity
- Improved estimation of relaxation time in nonreversible Markov chains
- Perspectives on information-based complexity
- Probabilistic bounds for the matrix condition number with extended Lanczos bidiagonalization
- Randomized algorithms for the low-rank approximation of matrices
- Randomized block Krylov methods for approximating extreme eigenvalues
- A Riemannian dimension-reduced second-order method with application in sensor network localization
- Evaluation of spectral zeta-functions with the renormalization group
- Implicit Regularity and Linear Convergence Rates for the Generalized Trust-Region Subproblem
- Sparse Approximate Solutions to Semidefinite Programs
- A linear-time algorithm for globally maximizing the sum of a generalized Rayleigh quotient and a quadratic form on the unit sphere
- Complexity analysis of second-order line-search algorithms for smooth nonconvex optimization
- Generalized conditional gradient for sparse estimation
- Globally maximizing the sum of squares of quadratic forms over the unit sphere
- Convex relaxations for permutation problems
- Structural Convergence Results for Approximation of Dominant Subspaces from Block Krylov Spaces
- The Computation of Low Multilinear Rank Approximations of Tensors via Power Scheme and Random Projection
- First-Order Methods for Nonconvex Quadratic Minimization
- Error Bounds for Lanczos-Based Matrix Function Approximation
- A deterministic algorithm for the Frieze-Kannan regularity lemma
- Symbolic and numeric methods for exploiting structure in constructing resultant matrices
- Randomized numerical linear algebra: Foundations and algorithms
- First-order methods for convex optimization
- Lanczos, Householder transformations, and implicit deflation for fast and reliable dominant singular subspace computation
- Statistical Condition Estimation for Linear Systems
- A fast randomized algorithm for the approximation of matrices
- Spectrally-truncated kernel ridge regression and its free lunch
- A distributed Frank-Wolfe framework for learning low-rank matrices with the trace norm
- On the randomized error of polynomial methods for eigenvector and eigenvalue estimates
- A recursive skeletonization factorization based on strong admissibility
- Estimating a largest eigenvector by Lanczos and polynomial algorithms with a random start
- Hierarchical interpolative factorization for elliptic operators: differential equations
- Hierarchical interpolative factorization for elliptic operators: integral equations
- Accelerated methods for nonconvex optimization
- Approximate inversion of discrete Fourier integral operators
- A linear-time algorithm for minimizing the ratio of quadratic functions with a quadratic constraint
- Worst-Case Complexity of TRACE with Inexact Subproblem Solutions for Nonconvex Smooth Optimization
- A linear-time algorithm for trust region problems
- Sublinear time algorithms for approximate semidefinite programming
- Computing the field of values and pseudospectra using the Lanczos method with continuation
- A second-order cone based approach for solving the trust-region subproblem and its variants
- Gradient descent finds the cubic-regularized nonconvex Newton step
- Newton-type methods for non-convex optimization under inexact Hessian information
- Randomization and the parallel solution of linear algebra problems
- Subspace Iteration Randomization and Singular Value Problems
- Hierarchical interpolative factorization preconditioner for parabolic equations
- Trust-region Newton-CG with strong second-order complexity guarantees for nonconvex optimization
- An accelerated first-order method with complexity analysis for solving cubic regularization subproblems
- Uniform Error Estimates for the Lanczos Method
- A Newton-CG algorithm with complexity guarantees for smooth unconstrained optimization
- A linear-time algorithm for generalized trust region subproblems
- The generalized trust region subproblem: solution complexity and convex hull results
- PCA Sparsified
- A Newton-CG based barrier-augmented Lagrangian method for general nonconvex conic optimization
- A note on probably certifiably correct algorithms
- Combining stochastic adaptive cubic regularization with negative curvature for nonconvex optimization
- Geodesic convexity of the symmetric eigenvalue problem and convergence of steepest descent
- Efficient bounds and estimates for canonical angles in randomized subspace approximations
- Nonsmooth projection-free optimization with functional constraints
- On norm compression inequalities for partitioned block tensors
- Cubic regularization methods with second-order complexity guarantee based on a new subproblem reformulation
- Smallest eigenvalue of large Hankel matrices at critical point: comparing conjecture with parallelised computation
- Complexity of linear minimization and projection on some sets
- Fast quantum subroutines for the simplex method
- Bounding the spectrum of large Hermitian matrices
- Norm and trace estimation with random rank-one vectors
- Subsampling algorithms for semidefinite programming
- Randomized Nyström Preconditioning
- A linear-time algorithm for the trust region subproblem based on hidden convexity
- Spectrum Approximation Beyond Fast Matrix Multiplication: Algorithms and Hardness
- Optimal information dissemination strategy to promote preventive behaviors in multilayer epidemic networks
- Scalable semidefinite programming
- Randomized error estimation for eigenvalue approximation
- Conditional gradient sliding for convex optimization
- SketchySGD: reliable stochastic optimization via randomized curvature estimates
- Probabilistic upper bounds for the matrix two-norm
- The Monte Carlo Algorithm with a Pseudorandom Generator
- A Newton-CG Based Barrier Method for Finding a Second-Order Stationary Point of Nonconvex Conic Optimization with Complexity Guarantees
- Convergence rate of block-coordinate maximization Burer-Monteiro method for solving large SDPs
- Memory-efficient structured convex optimization via extreme point sampling
- Spectral norm of a symmetric tensor and its computation
- A Newton-CG Based Augmented Lagrangian Method for Finding a Second-Order Stationary Point of Nonconvex Equality Constrained Optimization with Complexity Guarantees
- Near-optimal stochastic approximation for online principal component estimation
This page was built for publication: Estimating the Largest Eigenvalue by the Power and Lanczos Algorithms with a Random Start
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4021609)
