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 34 items.
- Scalable Semidefinite Programming (Q4999352) (← links)
- The Computation of Low Multilinear Rank Approximations of Tensors via Power Scheme and Random Projection (Q5112244) (← links)
- First-Order Methods for Nonconvex Quadratic Minimization (Q5113167) (← links)
- Spectral norm of a symmetric tensor and its computation (Q5113665) (← links)
- Norm and Trace Estimation with Random Rank-one Vectors (Q5150838) (← links)
- Memory-Efficient Structured Convex Optimization via Extreme Point Sampling (Q5154636) (← links)
- Uniform Error Estimates for the Lanczos Method (Q5158757) (← links)
- An Optimal-Storage Approach to Semidefinite Programming Using Approximate Complementarity (Q5162656) (← links)
- Subsampling Algorithms for Semidefinite Programming (Q5168846) (← links)
- A Linear-Time Algorithm for Globally Maximizing the Sum of a Generalized Rayleigh Quotient and a Quadratic Form on the Unit Sphere (Q5231687) (← links)
- Gradient Descent Finds the Cubic-Regularized Nonconvex Newton Step (Q5233102) (← links)
- Subspace Iteration Randomization and Singular Value Problems (Q5254699) (← links)
- A Second-Order Cone Based Approach for Solving the Trust-Region Subproblem and Its Variants (Q5348458) (← links)
- Structural Convergence Results for Approximation of Dominant Subspaces from Block Krylov Spaces (Q5373926) (← links)
- Sparse Approximate Solutions to Semidefinite Programs (Q5458538) (← links)
- A Recursive Skeletonization Factorization Based on Strong Admissibility (Q5737769) (← links)
- Trust-Region Newton-CG with Strong Second-Order Complexity Guarantees for Nonconvex Optimization (Q5853562) (← links)
- A Linear-Time Algorithm for Generalized Trust Region Subproblems (Q5853724) (← links)
- Error Bounds for Lanczos-Based Matrix Function Approximation (Q5863878) (← links)
- Randomized numerical linear algebra: Foundations and algorithms (Q5887823) (← links)
- Worst-Case Complexity of TRACE with Inexact Subproblem Solutions for Nonconvex Smooth Optimization (Q6046826) (← links)
- A Newton-CG Based Barrier Method for Finding a Second-Order Stationary Point of Nonconvex Conic Optimization with Complexity Guarantees (Q6114780) (← links)
- Implicit Regularity and Linear Convergence Rates for the Generalized Trust-Region Subproblem (Q6114784) (← links)
- A Newton-CG Based Augmented Lagrangian Method for Finding a Second-Order Stationary Point of Nonconvex Equality Constrained Optimization with Complexity Guarantees (Q6116250) (← links)
- Improved estimation of relaxation time in nonreversible Markov chains (Q6126104) (← links)
- Randomized Nyström Preconditioning (Q6166051) (← links)
- First-order methods for convex optimization (Q6169988) (← links)
- PCA Sparsified (Q6176425) (← links)
- A Riemannian dimension-reduced second-order method with application in sensor network localization (Q6562381) (← links)
- Geodesic convexity of the symmetric eigenvalue problem and convergence of steepest descent (Q6636815) (← links)
- Efficient bounds and estimates for canonical angles in randomized subspace approximations (Q6641761) (← links)
- A Newton-CG based barrier-augmented Lagrangian method for general nonconvex conic optimization (Q6642793) (← links)
- Nonsmooth projection-free optimization with functional constraints (Q6642795) (← links)
- SketchySGD: reliable stochastic optimization via randomized curvature estimates (Q6664471) (← links)
