On the public citation graph

Estimating the Largest Eigenvalue by the Power and Lanczos Algorithms with a Random Start

0 signed · 248 inferred · view as graph

Inferred edges come from two machine sources: sweeps of open repository metadata (mostly SSRN and Zenodo), and a bulk OpenAlex citation snapshot. Every row below is labelled with the one it came from. Neither is a complete citation index — absence here is not evidence of absence.

Is this your work? Sign in with ORCID and put your name on the claims that are yours.
Claim with ORCID
Reference health. See whether every reference in this work resolves to a known work and none has been retracted — and get a dated CiteStamped badge you can embed.
See reference health

What this work says

Outgoing claims: the papers this work cites, builds on, or argues with.

inferredcites →https://doi.org/10.1007/978-3-540-38004-7openalex-snapshot
Matrix Eigensystem Routines — EISPACK Guide
inferredcites →https://doi.org/10.1016/0041-5553(66)90153-4openalex-snapshot
The algebraic eigenvalue problem
inferredcites →https://doi.org/10.1016/0378-4754(89)90072-4openalex-snapshot
Information-based complexity
inferredcites →https://doi.org/10.1016/0885-064x(86)90016-6openalex-snapshot
On the optimal solution of large eigenpair problems
inferredcites →https://doi.org/10.1016/0885-064x(87)90003-3openalex-snapshot
On the optimality of Krylov information
inferredcites →https://doi.org/10.1016/b978-0-12-141050-6.50013-1openalex-snapshot
HOW FAR SHOULD YOU GO WITH THE LANCZOS PROCESS?††The authors are pleased to acknowledge partial support from Office of Naval Research Contract N00014-69-A-0200-1017.
inferredcites →https://doi.org/10.1038/328029a0openalex-snapshot
Information-based complexity
inferredcites →https://doi.org/10.1090/s0025-5718-1966-0234618-4openalex-snapshot
Estimates for Some Computational Techniques in Linear Algebra
inferredcites →https://doi.org/10.1090/s0025-5718-1979-0537973-xopenalex-snapshot
Estimating the largest eigenvalue of a positive definite matrix
inferredcites →https://doi.org/10.1090/s0025-5718-1982-0637293-9openalex-snapshot
On Estimating the Largest Eigenvalue with the Lanczos Algorithm
inferredcites →https://doi.org/10.1093/imamat/10.3.373openalex-snapshot
Computational Variants of the Lanczos Method for the Eigenproblem
inferredcites →https://doi.org/10.1115/1.3157781openalex-snapshot
The Symmetric Eigenvalue Problem
inferredcites →https://doi.org/10.1137/0717059openalex-snapshot
On the Rates of Convergence of the Lanczos and the Block-Lanczos Methods
inferredcites →https://doi.org/10.1137/0720053openalex-snapshot
Estimating Extremal Eigenvalues and Condition Numbers of Matrices
inferredcites →https://doi.org/10.1137/1.9781611971163openalex-snapshot
The Symmetric Eigenvalue Problem
inferredcites →https://doi.org/10.1214/aoms/1177706645openalex-snapshot
A Note on the Generation of Random Normal Deviates
inferredcites →https://doi.org/10.2307/2003558openalex-snapshot
The Algebraic Eigenvalue Problem
inferredcites →https://doi.org/10.2307/2005448openalex-snapshot
Matrix Eigensystem Routines--EISPACK Guide
inferredcites →https://doi.org/10.2307/2006463openalex-snapshot
Estimating the Largest Eigenvalue of a Positive Definite Matrix
inferredcites →https://doi.org/10.2307/2007757openalex-snapshot
Table of Integrals, Series and Products.
inferredcites →https://doi.org/10.2307/2581380openalex-snapshot
Problem Complexity and Method Efficiency in Optimization

What points at this work

Incoming claims: where this work appears in other papers’ reference lists and arguments.

inferred← citeshttps://doi.org/10.1002/(sici)1099-1506(199805/06)5:3<147::aid-nla128>3.0.co;2-2openalex-snapshot
Estimating a largest eigenvector by Lanczos and polynomial algorithms with a random start
inferred← citeshttps://doi.org/10.1002/cpa.21577openalex-snapshot
Hierarchical Interpolative Factorization for Elliptic Operators: Integral Equations
inferred← citeshttps://doi.org/10.1002/cpa.21582openalex-snapshot
Hierarchical Interpolative Factorization for Elliptic Operators: Differential Equations
inferred← citeshttps://doi.org/10.1002/cpe.5754openalex-snapshot
Reducing the amount of out‐of‐core data access for GPU‐accelerated randomized SVD
inferred← citeshttps://doi.org/10.1002/jcc.21723openalex-snapshot
Bringing about matrix sparsity in linear‐scaling electronic structure calculations
inferred← citeshttps://doi.org/10.1002/nla.2235openalex-snapshot
Spectral condition‐number estimation of large sparse matrices
inferred← citeshttps://doi.org/10.1002/nla.240openalex-snapshot
Lanczos, Householder transformations, and implicit deflation for fast and reliable dominant singular subspace computation
inferred← citeshttps://doi.org/10.1006/jcom.1997.0455openalex-snapshot
On the Randomized Error of Polynomial Methods for Eigenvector and Eigenvalue Estimates
inferred← citeshttps://doi.org/10.1006/jsco.2002.0520openalex-snapshot
Symbolic and Numeric Methods for Exploiting Structure in Constructing Resultant Matrices
inferred← citeshttps://doi.org/10.1007/978-1-4612-2740-3_30openalex-snapshot
Steve Smale and the Geometry of Ill-Conditioning
inferred← citeshttps://doi.org/10.1007/978-3-030-73879-2_22openalex-snapshot
Fast Quantum Subroutines for the Simplex Method
inferred← citeshttps://doi.org/10.1007/978-3-031-33170-1_10openalex-snapshot
Code-Level Formal Verification of Ellipsoidal Invariant Sets for Linear Parameter-Varying Systems
inferred← citeshttps://doi.org/10.1007/978-3-319-30256-0_1openalex-snapshot
Introduction to Scientific Computing
inferred← citeshttps://doi.org/10.1007/978-3-319-30256-0_4openalex-snapshot
Eigenvalue Problems
inferred← citeshttps://doi.org/10.1007/978-3-319-97478-1_9openalex-snapshot
Frank-Wolfe Style Algorithms for Large Scale Optimization
inferred← citeshttps://doi.org/10.1007/978-3-540-78773-0_27openalex-snapshot
Sparse Approximate Solutions to Semidefinite Programs
inferred← citeshttps://doi.org/10.1007/978-3-642-22935-0_42openalex-snapshot
A Deterministic Algorithm for the Frieze-Kannan Regularity Lemma
inferred← citeshttps://doi.org/10.1007/978-3-642-33090-2_44openalex-snapshot
Optimizing over the Growing Spectrahedron
inferred← citeshttps://doi.org/10.1007/978-94-017-3552-0_5openalex-snapshot
Recent Developments in Rank Revealing and Lanczos Methods for TLS-Related Problems
inferred← citeshttps://doi.org/10.1007/978-981-15-2910-8_4openalex-snapshot
Accelerated Algorithms for Nonconvex Optimization
inferred← citeshttps://doi.org/10.1007/bf01731925openalex-snapshot
Computing the field of values and pseudospectra using the Lanczos method with continuation
inferred← citeshttps://doi.org/10.1007/bfb0030174openalex-snapshot
Parallel algorithms for the partial eigensolution of large sparse matrices on novel architecture computers
inferred← citeshttps://doi.org/10.1007/s00034-025-03433-xopenalex-snapshot
An Enhanced Off-Grid Sparse Bayesian Strategy for Direction of Arrival Estimation in Impulsive Noise
inferred← citeshttps://doi.org/10.1007/s00211-021-01250-3openalex-snapshot
Randomized block Krylov methods for approximating extreme eigenvalues
inferred← citeshttps://doi.org/10.1007/s00453-001-0032-8openalex-snapshot
Certification of Numerical Computation of the Sign of the Determinant of a Matrix
inferred← citeshttps://doi.org/10.1007/s10092-020-0356-xopenalex-snapshot
On norm compression inequalities for partitioned block tensors
inferred← citeshttps://doi.org/10.1007/s100920050002openalex-snapshot
Randomized error estimation for eigenvalue approximation
inferred← citeshttps://doi.org/10.1007/s10107-015-0932-zopenalex-snapshot
Sublinear time algorithms for approximate semidefinite programming
inferred← citeshttps://doi.org/10.1007/s10107-015-0933-yopenalex-snapshot
A linear-time algorithm for trust region problems
inferred← citeshttps://doi.org/10.1007/s10107-017-1182-zopenalex-snapshot
Near-optimal stochastic approximation for online principal component estimation
inferred← citeshttps://doi.org/10.1007/s10107-019-01362-7openalex-snapshot
A Newton-CG algorithm with complexity guarantees for smooth unconstrained optimization
inferred← citeshttps://doi.org/10.1007/s10107-019-01405-zopenalex-snapshot
Newton-type methods for non-convex optimization under inexact Hessian information
inferred← citeshttps://doi.org/10.1007/s10107-020-01560-8openalex-snapshot
The generalized trust region subproblem: solution complexity and convex hull results
inferred← citeshttps://doi.org/10.1007/s10107-021-01686-3openalex-snapshot
Convergence rate of block-coordinate maximization Burer–Monteiro method for solving large SDPs
inferred← citeshttps://doi.org/10.1007/s10107-025-02230-3openalex-snapshot
Homogeneous second-order descent framework: a fast alternative to Newton-type methods
inferred← citeshttps://doi.org/10.1007/s10589-021-00274-7openalex-snapshot
An accelerated first-order method with complexity analysis for solving cubic regularization subproblems
inferred← citeshttps://doi.org/10.1007/s10589-024-00603-6openalex-snapshot
A Newton-CG based barrier-augmented Lagrangian method for general nonconvex conic optimization
inferred← citeshttps://doi.org/10.1007/s10589-024-00607-2openalex-snapshot
Nonsmooth projection-free optimization with functional constraints
inferred← citeshttps://doi.org/10.1007/s10915-013-9716-xopenalex-snapshot
Probabilistic Upper Bounds for the Matrix Two-Norm
inferred← citeshttps://doi.org/10.1007/s10915-020-01343-5openalex-snapshot
Hierarchical Interpolative Factorization Preconditioner for Parabolic Equations
inferred← citeshttps://doi.org/10.1007/s10915-025-03069-8openalex-snapshot
Gradient Norm Regularization Second-Order Algorithms for Solving Nonconvex-Strongly Concave Minimax Problems
inferred← citeshttps://doi.org/10.1007/s10957-019-01624-6openalex-snapshot
Combining Stochastic Adaptive Cubic Regularization with Negative Curvature for Nonconvex Optimization
inferred← citeshttps://doi.org/10.1007/s10957-024-02538-8openalex-snapshot
Geodesic Convexity of the Symmetric Eigenvalue Problem and Convergence of Steepest Descent
inferred← citeshttps://doi.org/10.1007/s10994-018-5713-5openalex-snapshot
A distributed Frank–Wolfe framework for learning low-rank matrices with the trace norm
inferred← citeshttps://doi.org/10.1007/s11590-016-1070-0openalex-snapshot
A linear-time algorithm for the trust region subproblem based on hidden convexity
inferred← citeshttps://doi.org/10.1007/s11590-019-01498-7openalex-snapshot
Globally maximizing the sum of squares of quadratic forms over the unit sphere
inferred← citeshttps://doi.org/10.1007/s13278-017-0481-yopenalex-snapshot
Incremental eigenpair computation for graph Laplacian matrices: theory and applications
inferred← citeshttps://doi.org/10.1007/s40305-022-00398-5openalex-snapshot
Cubic Regularization Methods with Second-Order Complexity Guarantee Based on a New Subproblem Reformulation
inferred← citeshttps://doi.org/10.1007/s40314-021-01527-1openalex-snapshot
A linear-time algorithm for minimizing the ratio of quadratic functions with a quadratic constraint
inferred← citeshttps://doi.org/10.1016/0378-4754(89)90072-4openalex-snapshot
Information-based complexity
inferred← citeshttps://doi.org/10.1016/0898-1221(95)00164-topenalex-snapshot
Randomization and the parallel solution of linear algebra problems
inferred← citeshttps://doi.org/10.1016/j.acha.2007.12.002openalex-snapshot
A fast randomized algorithm for the approximation of matrices
inferred← citeshttps://doi.org/10.1016/j.amc.2019.124628openalex-snapshot
Smallest eigenvalue of large Hankel matrices at critical point: Comparing conjecture with parallelised computation
inferred← citeshttps://doi.org/10.1016/j.crma.2015.11.009openalex-snapshot
A note on probably certifiably correct algorithms
inferred← citeshttps://doi.org/10.1016/j.ejco.2021.100015openalex-snapshot
First-Order Methods for Convex Optimization
inferred← citeshttps://doi.org/10.1016/j.engstruct.2018.06.115openalex-snapshot
Nonlinear structural dynamic analysis by a stabilized central difference method
inferred← citeshttps://doi.org/10.1016/j.jcp.2021.110654openalex-snapshot
Approximate inversion of discrete Fourier integral operators
inferred← citeshttps://doi.org/10.1016/j.jcp.2024.112824openalex-snapshot
A compression scheme for domain decomposition method in solving electromagnetic problems
inferred← citeshttps://doi.org/10.1016/j.laa.2010.06.034openalex-snapshot
Bounding the spectrum of large Hermitian matrices
inferred← citeshttps://doi.org/10.1016/j.neucom.2025.130571openalex-snapshot
Multi-order graph based clustering via dynamical low rank tensor approximation
inferred← citeshttps://doi.org/10.1016/j.orl.2021.06.005openalex-snapshot
Complexity of linear minimization and projection on some sets
inferred← citeshttps://doi.org/10.1016/j.orl.2024.107199openalex-snapshot
Worst-case analysis of restarted primal-dual hybrid gradient on totally unimodular linear programs
inferred← citeshttps://doi.org/10.1016/j.patcog.2018.01.028openalex-snapshot
ℓ 2 , 1 − ℓ 1 regularized nonlinear multi-task representation learning based cognitive performance prediction of Alzheimer’s disease
inferred← citeshttps://doi.org/10.1017/s0962492920000021openalex-snapshot
Randomized numerical linear algebra: Foundations and algorithms
inferred← citeshttps://doi.org/10.1023/a:1019112103049openalex-snapshot
UTV Tools: Matlab templates for rank-revealing UTV decompositions
inferred← citeshttps://doi.org/10.1063/1.4862410openalex-snapshot
Unification of algorithms for minimum mode optimization
inferred← citeshttps://doi.org/10.1063/5.0166678openalex-snapshot
A spectrum adaptive kernel polynomial method
inferred← citeshttps://doi.org/10.1073/pnas.0709640104openalex-snapshot
Randomized algorithms for the low-rank approximation of matrices
inferred← citeshttps://doi.org/10.1080/13588265.2022.2131078openalex-snapshot
Alignment of highly resolved time-dependent experimental and simulated crash test data
inferred← citeshttps://doi.org/10.1088/1751-8121/aa5c09openalex-snapshot
Evaluation of spectral zeta-functions with the renormalization group
inferred← citeshttps://doi.org/10.1089/cmb.2009.0059openalex-snapshot
Computing the Stochastic Dynamics of Phosphorylation Networks
inferred← citeshttps://doi.org/10.1090/mcom/3525openalex-snapshot
Spectral norm of a symmetric tensor and its computation
inferred← citeshttps://doi.org/10.1090/s0025-5718-1992-1106984-4openalex-snapshot
The Monte Carlo algorithm with a pseudorandom generator
inferred← citeshttps://doi.org/10.1090/s0273-0979-1992-00240-9openalex-snapshot
Perspectives on information-based complexity
inferred← citeshttps://doi.org/10.1093/bioinformatics/bts592openalex-snapshot
Global network alignment using multiscale spectral signatures
inferred← citeshttps://doi.org/10.1093/imanum/drt069openalex-snapshot
A randomized algorithm for testing nonsingularity of structured matrices with an application to asserting nondefectivity of Segre varieties
inferred← citeshttps://doi.org/10.1103/29qw-bssxopenalex-snapshot
Beating the Natural Grover Bound for Low-Energy Estimation and State Preparation
inferred← citeshttps://doi.org/10.1103/pcvc-734hopenalex-snapshot
Lanczos Algorithm, the Transfer Matrix, and the Signal-to-Noise Problem
inferred← citeshttps://doi.org/10.1103/physreva.102.013321openalex-snapshot
Probing thermalization in quenched integrable and nonintegrable Fermi-Hubbard models
inferred← citeshttps://doi.org/10.1103/physrevb.105.085121openalex-snapshot
Charge dynamics in magnetically disordered Mott insulators
inferred← citeshttps://doi.org/10.1103/physrevresearch.3.043168openalex-snapshot
Dynamic mean-field theory for dense spin systems at infinite temperature
inferred← citeshttps://doi.org/10.1103/zjzt-rv86openalex-snapshot
Lanczos algorithm for lattice QCD matrix elements
inferred← citeshttps://doi.org/10.1109/bigdata.2017.8257977openalex-snapshot
Closed walk sampler: An efficient method for estimating the spectral radius of large graphs
inferred← citeshttps://doi.org/10.1109/cacsd.1996.555258openalex-snapshot
Applications of small-sample statistical condition estimation in control
inferred← citeshttps://doi.org/10.1109/cdc.1993.325784openalex-snapshot
A statistical approach to condition estimation
inferred← citeshttps://doi.org/10.1109/cvpr.2006.129openalex-snapshot
Graph Partitioning by Spectral Rounding: Applications in Image Segmentation and Clustering
inferred← citeshttps://doi.org/10.1109/empdp.1993.336401openalex-snapshot
An algorithm far the parallel computation of subsets of eigenvalues and associated eigenvectors of large symmetric matrices using an array processor
inferred← citeshttps://doi.org/10.1109/focs.2004.1openalex-snapshot
0(\sqrt {\log n)} Approximation to SPARSEST CUT in Õ(n²) Time
inferred← citeshttps://doi.org/10.1109/focs.2006.37openalex-snapshot
Improved Approximation Algorithms for Large Matrices via Random Projections
inferred← citeshttps://doi.org/10.1109/focs.2010.30openalex-snapshot
Fast Approximation Algorithms for Cut-Based Problems in Undirected Graphs
inferred← citeshttps://doi.org/10.1109/icassp49660.2025.10890880openalex-snapshot
Efficient Estimation of Kernel Matrix Spectral Norm using Random Features
inferred← citeshttps://doi.org/10.1109/icde.2016.7498314openalex-snapshot
TOPIC: Toward perfect Influence Graph Summarization
inferred← citeshttps://doi.org/10.1109/icdm54844.2022.00080openalex-snapshot
Rethinking Symmetric Matrix Factorization: A More General and Better Clustering Perspective
inferred← citeshttps://doi.org/10.1109/icus55513.2022.9986982openalex-snapshot
Customized First Order Convex Optimization Algorithm for Powered-Descent Guidance
inferred← citeshttps://doi.org/10.1109/sfcs.2005.35openalex-snapshot
Fast algorithms for approximate semidefinite programming using the multiplicative weights update method
inferred← citeshttps://doi.org/10.1109/tap.2024.3427003openalex-snapshot
A Low-Rank Direct Solver for Nonconformal Domain Decomposition Methods
inferred← citeshttps://doi.org/10.1109/tbdata.2018.2865805openalex-snapshot
Closed Walk Sampler: An Efficient Method for Estimating Eigenvalues of Large Graphs
inferred← citeshttps://doi.org/10.1109/tcyb.2018.2881417openalex-snapshot
Scalable Large-Margin Distance Metric Learning Using Stochastic Gradient Descent
inferred← citeshttps://doi.org/10.1109/tkde.2016.2569096openalex-snapshot
User Preference Learning for Online Social Recommendation
inferred← citeshttps://doi.org/10.1109/tmm.2020.3009501openalex-snapshot
Solving Jigsaw Puzzles via Nonconvex Quadratic Programming With the Projected Power Method
inferred← citeshttps://doi.org/10.1109/tmtt.2024.3386104openalex-snapshot
Convergence Enhancement for Embedded Domain Decomposition Method Through Spectral Radius Reduction
inferred← citeshttps://doi.org/10.1109/tnnls.2023.3326177openalex-snapshot
Stochastic Optimization for Nonconvex Problem With Inexact Hessian Matrix, Gradient, and Function
inferred← citeshttps://doi.org/10.1109/tnse.2019.2913233openalex-snapshot
Spectral Alignment of Graphs
inferred← citeshttps://doi.org/10.1109/tpami.2011.107openalex-snapshot
Angular Embedding: A Robust Quadratic Criterion
inferred← citeshttps://doi.org/10.1109/tpami.2024.3447287openalex-snapshot
A Novel and Effective Method to Directly Solve Spectral Clustering
inferred← citeshttps://doi.org/10.1109/vtcfall.2019.8891264openalex-snapshot
A Low Complexity Greedy Algorithm for Dynamic Subarrays in mmWave MIMO Systems
inferred← citeshttps://doi.org/10.1126/science.243.4895.1142-aopenalex-snapshot
Information-Based Complexity
inferred← citeshttps://doi.org/10.1137/080731049openalex-snapshot
$O(\sqrt{\logn})$ Approximation to SPARSEST CUT in $\tilde{O}(n^2)$ Time
inferred← citeshttps://doi.org/10.1137/080736417openalex-snapshot
A Randomized Algorithm for Principal Component Analysis
inferred← citeshttps://doi.org/10.1137/090771806openalex-snapshot
Finding Structure with Randomness: Probabilistic Algorithms for Constructing Approximate Matrix Decompositions
inferred← citeshttps://doi.org/10.1137/090773714openalex-snapshot
Max Cut and the Smallest Eigenvalue
inferred← citeshttps://doi.org/10.1137/0915003openalex-snapshot
Small-Sample Statistical Condition Estimates for General Matrix Functions
inferred← citeshttps://doi.org/10.1137/100804139openalex-snapshot
An Algorithm for the Principal Component Analysis of Large Data Sets
inferred← citeshttps://doi.org/10.1137/110846373openalex-snapshot
A Deterministic Algorithm for the Frieze–Kannan Regularity Lemma
inferred← citeshttps://doi.org/10.1137/12088728xopenalex-snapshot
A Stochastic Smoothing Algorithm for Semidefinite Programming
inferred← citeshttps://doi.org/10.1137/130938700openalex-snapshot
Subspace Iteration Randomization and Singular Value Problems
inferred← citeshttps://doi.org/10.1137/130947362openalex-snapshot
Convex Relaxations for Permutation Problems
inferred← citeshttps://doi.org/10.1137/140975218openalex-snapshot
Probabilistic Bounds for the Matrix Condition Number with Extended Lanczos Bidiagonalization
inferred← citeshttps://doi.org/10.1137/140992382openalex-snapshot
Conditional Gradient Sliding for Convex Optimization
inferred← citeshttps://doi.org/10.1137/16m1065197openalex-snapshot
A Second-Order Cone Based Approach for Solving the Trust-Region Subproblem and Its Variants
inferred← citeshttps://doi.org/10.1137/16m1091745openalex-snapshot
Structural Convergence Results for Approximation of Dominant Subspaces from Block Krylov Spaces
inferred← citeshttps://doi.org/10.1137/16m1095949openalex-snapshot
A Recursive Skeletonization Factorization Based on Strong Admissibility
inferred← citeshttps://doi.org/10.1137/17m1113898openalex-snapshot
Gradient Descent Finds the Cubic-Regularized Nonconvex Newton Step
inferred← citeshttps://doi.org/10.1137/17m1114296openalex-snapshot
Accelerated Methods for NonConvex Optimization
inferred← citeshttps://doi.org/10.1137/17m1134329openalex-snapshot
Complexity Analysis of Second-Order Line-Search Algorithms for Smooth Nonconvex Optimization
inferred← citeshttps://doi.org/10.1137/18m1164639openalex-snapshot
A Linear-Time Algorithm for Globally Maximizing the Sum of a Generalized Rayleigh Quotient and a Quadratic Form on the Unit Sphere
inferred← citeshttps://doi.org/10.1137/18m1215165openalex-snapshot
A Linear-Time Algorithm for Generalized Trust Region Subproblems
inferred← citeshttps://doi.org/10.1137/19m1237016openalex-snapshot
The Computation of Low Multilinear Rank Approximations of Tensors via Power Scheme and Random Projection
inferred← citeshttps://doi.org/10.1137/19m1244603openalex-snapshot
An Optimal-Storage Approach to Semidefinite Programming Using Approximate Complementarity
inferred← citeshttps://doi.org/10.1137/19m1305045openalex-snapshot
Scalable Semidefinite Programming
inferred← citeshttps://doi.org/10.1137/19m130563xopenalex-snapshot
Trust-Region Newton-CG with Strong Second-Order Complexity Guarantees for Nonconvex Optimization
inferred← citeshttps://doi.org/10.1137/20m1321759openalex-snapshot
First-Order Methods for Nonconvex Quadratic Minimization
inferred← citeshttps://doi.org/10.1137/20m1331470openalex-snapshot
Uniform Error Estimates for the Lanczos Method
inferred← citeshttps://doi.org/10.1137/20m1331718openalex-snapshot
Norm and Trace Estimation with Random Rank-one Vectors
inferred← citeshttps://doi.org/10.1137/20m1358037openalex-snapshot
Memory-Efficient Structured Convex Optimization via Extreme Point Sampling
inferred← citeshttps://doi.org/10.1137/21m1427784openalex-snapshot
Error Bounds for Lanczos-Based Matrix Function Approximation
inferred← citeshttps://doi.org/10.1137/21m1457011openalex-snapshot
A Newton-CG Based Barrier Method for Finding a Second-Order Stationary Point of Nonconvex Conic Optimization with Complexity Guarantees
inferred← citeshttps://doi.org/10.1137/21m1466244openalex-snapshot
Randomized Nyström Preconditioning
inferred← citeshttps://doi.org/10.1137/21m1468073openalex-snapshot
Implicit Regularity and Linear Convergence Rates for the Generalized Trust-Region Subproblem
inferred← citeshttps://doi.org/10.1137/22m1489824openalex-snapshot
A Newton-CG Based Augmented Lagrangian Method for Finding a Second-Order Stationary Point of Nonconvex Equality Constrained Optimization with Complexity Guarantees
inferred← citeshttps://doi.org/10.1137/22m1492325openalex-snapshot
PCA Sparsified
inferred← citeshttps://doi.org/10.1137/22m1492428openalex-snapshot
Worst-Case Complexity of TRACE with Inexact Subproblem Solutions for Nonconvex Smooth Optimization
inferred← citeshttps://doi.org/10.1137/23m1567229openalex-snapshot
A Riemannian Dimension-Reduced Second-Order Method with Application in Sensor Network Localization
inferred← citeshttps://doi.org/10.1137/23m1575330openalex-snapshot
SketchySGD: Reliable Stochastic Optimization via Randomized Curvature Estimates
inferred← citeshttps://doi.org/10.1137/23m1584733openalex-snapshot
Efficient Bounds and Estimates for Canonical Angles in Randomized Subspace Approximations
inferred← citeshttps://doi.org/10.1137/s0895479800366859openalex-snapshot
Computing Probabilistic Bounds for Extreme Eigenvalues of Symmetric Matrices with the Lanczos Method
inferred← citeshttps://doi.org/10.1137/s0895479801390649openalex-snapshot
A Subspace Error Estimate for Linear Systems
inferred← citeshttps://doi.org/10.1137/s0895479892230456openalex-snapshot
Probabilistic Bounds on the Extremal Eigenvalues and Condition Number by the Lanczos Algorithm
inferred← citeshttps://doi.org/10.1137/s0895479893243876openalex-snapshot
Small-Sample Statistical Estimates for Matrix Norms
inferred← citeshttps://doi.org/10.1137/s0895479895296689openalex-snapshot
Estimating an Eigenvector by the Power Method with a Random Start
inferred← citeshttps://doi.org/10.1137/s1064827595282519openalex-snapshot
Statistical Condition Estimation for Linear Systems
inferred← citeshttps://doi.org/10.1145/1536414.1536452openalex-snapshot
Max cut and the smallest eigenvalue
inferred← citeshttps://doi.org/10.1145/2513109.2513116openalex-snapshot
Algorithm 933
inferred← citeshttps://doi.org/10.1145/2661829.2661980openalex-snapshot
Improving Co-Cluster Quality with Application to Product Recommendations
inferred← citeshttps://doi.org/10.1145/3004053openalex-snapshot
Algorithm 971
inferred← citeshttps://doi.org/10.1145/301250.301389openalex-snapshot
The complexity of the matrix eigenproblem
inferred← citeshttps://doi.org/10.1145/3178876.3186118openalex-snapshot
Spectral Algorithms for Temporal Graph Cuts
inferred← citeshttps://doi.org/10.1145/3357713.3384338openalex-snapshot
Positive semidefinite programming: mixed, parallel, and width-independent
inferred← citeshttps://doi.org/10.1145/3446330openalex-snapshot
Near-optimal Distributed Triangle Enumeration via Expander Decompositions
inferred← citeshttps://doi.org/10.1145/3711896.3737134openalex-snapshot
Spectral Survival Analysis
inferred← citeshttps://doi.org/10.1145/3717823.3718308openalex-snapshot
Improved Complexity for Smooth Nonconvex Optimization: A Two-Level Online Learning Approach with Quasi-Newton Methods
inferred← citeshttps://doi.org/10.1145/780542.780562openalex-snapshot
Linear time encodable and list decodable codes
inferred← citeshttps://doi.org/10.1186/s40323-016-0072-xopenalex-snapshot
Identification of nonlinear behavior with clustering techniques in car crash simulations for better model reduction
inferred← citeshttps://doi.org/10.1214/10-ssy018openalex-snapshot
Subsampling Algorithms for Semidefinite Programming
inferred← citeshttps://doi.org/10.1214/21-ejs1873openalex-snapshot
Spectrally-truncated kernel ridge regression and its free lunch
inferred← citeshttps://doi.org/10.1214/23-aap1963openalex-snapshot
Improved estimation of relaxation time in nonreversible Markov chains
inferred← citeshttps://doi.org/10.1287/moor.2023.0132openalex-snapshot
A Homogeneous Second-Order Descent Method for Nonconvex Optimization
inferred← citeshttps://doi.org/10.1287/moor.2023.0356openalex-snapshot
Newton-CG Methods for Nonconvex Unconstrained Optimization with Hölder Continuous Hessian
inferred← citeshttps://doi.org/10.1287/opre.2022.2341openalex-snapshot
Fast Quantum Subroutines for the Simplex Method
inferred← citeshttps://doi.org/10.1561/0400000065openalex-snapshot
Faster Algorithms via Approximation Theory
inferred← citeshttps://doi.org/10.21203/rs.3.rs-10070882/v1openalex-snapshot
Density-Ratio Adaptive Spectral Clustering: A Density-Gated Bridge Between Spectral and Density-Based Clustering
inferred← citeshttps://doi.org/10.21236/ada458932openalex-snapshot
A Randomized Algorithm for the Approximation of Matrices
inferred← citeshttps://doi.org/10.2307/2153037openalex-snapshot
The Monte Carlo Algorithm with a Pseudorandom Generator
inferred← citeshttps://doi.org/10.2514/1.g007218openalex-snapshot
Real-Time Quadrotor Trajectory Optimization with Time-Triggered Corridor Constraints
inferred← citeshttps://doi.org/10.2514/6.2022-0951openalex-snapshot
A Customised First-Order Solver for Real-Time Powered-Descent Guidance
inferred← citeshttps://doi.org/10.32657/10356/54915openalex-snapshot
Sensing, allocation and trading of spectral resources in cognitive radio networks
inferred← citeshttps://doi.org/10.3389/fnins.2016.00017openalex-snapshot
Memory Efficient PCA Methods for Large Group ICA
inferred← citeshttps://doi.org/10.3390/e22091019openalex-snapshot
The Siegel–Klein Disk: Hilbert Geometry of the Siegel Disk Domain
inferred← citeshttps://doi.org/10.3390/math14142539openalex-snapshot
Linear-Time Algorithm for Complex Uniform CDT Subproblem Based on Hidden Convexity
inferred← citeshttps://doi.org/10.3390/rs18132172openalex-snapshot
Anchor-Level Spectral–Spatial Graph Clustering for Hyperspectral Images
inferred← citeshttps://doi.org/10.3929/ethz-a-007050453openalex-snapshot
Sparse Convex Optimization Methods for Machine Learning
inferred← citeshttps://doi.org/10.3929/ethz-a-010377352openalex-snapshot
Convex Optimization with Random Pursuit
inferred← citeshttps://doi.org/10.3929/ethz-b-000421981openalex-snapshot
Optimization for Neural Networks: Quest for Theoretical Understandings
inferred← citeshttps://doi.org/10.3934/mbe.2015.12.609openalex-snapshot
Optimal information dissemination strategy to promote preventivebehaviors in multilayer epidemic networks
inferred← citeshttps://doi.org/10.4086/toc.2006.v002a012openalex-snapshot
inferred← citeshttps://doi.org/10.4230/lipics.itcs.2018.8openalex-snapshot
Spectrum Approximation Beyond Fast Matrix Multiplication: Algorithms and Hardness
inferred← citeshttps://doi.org/10.47172/2965-730x.sdgsreview.v5.n03.pe05206openalex-snapshot
Development of Environmental Education Affective Domain of Learning Framework: a Higher Education Perspective
inferred← citeshttps://doi.org/10.48550/arxiv.0803.1990openalex-snapshot
Subsampling Algorithms for Semidefinite Programming
inferred← citeshttps://doi.org/10.48550/arxiv.0806.1978openalex-snapshot
Max Cut and the Smallest Eigenvalue
inferred← citeshttps://doi.org/10.48550/arxiv.0809.2274openalex-snapshot
A randomized algorithm for principal component analysis
inferred← citeshttps://doi.org/10.48550/arxiv.1007.5510openalex-snapshot
An algorithm for the principal component analysis of large data sets
inferred← citeshttps://doi.org/10.48550/arxiv.1008.1975openalex-snapshot
Fast Approximation Algorithms for Cut-based Problems in Undirected Graphs
inferred← citeshttps://doi.org/10.48550/arxiv.1103.5453openalex-snapshot
Using a Non-Commutative Bernstein Bound to Approximate Some Matrix Algorithms in the Spectral Norm
inferred← citeshttps://doi.org/10.48550/arxiv.1104.2076openalex-snapshot
A Note On Estimating the Spectral Norm of A Matrix Efficiently
inferred← citeshttps://doi.org/10.48550/arxiv.1106.1622openalex-snapshot
Large-Scale Convex Minimization with a Low-Rank Constraint
inferred← citeshttps://doi.org/10.48550/arxiv.1108.1170openalex-snapshot
Convex Optimization without Projection Steps
inferred← citeshttps://doi.org/10.48550/arxiv.1208.5211openalex-snapshot
Almost Optimal Sublinear Time Algorithm for Semidefinite Programming
inferred← citeshttps://doi.org/10.48550/arxiv.1212.4549openalex-snapshot
Condition Estimation by Means of the Power Method
inferred← citeshttps://doi.org/10.48550/arxiv.1212.4560openalex-snapshot
More on the Power of Randomized Matrix Computations
inferred← citeshttps://doi.org/10.48550/arxiv.1309.4882openalex-snapshot
Approximation Theory and the Design of Fast Algorithms
showing the first 200 of 227 · page through all 227
Editorial review for independent work. ICSAC — the Institute for Complexity Science and Advanced Computing — runs a structured editorial panel for researchers publishing outside journals, and publishes on CiteStamp rails. Submission is free and goes through ORCID: icsacinstitute.org/submit.