ArXivCSExplorer
☆☆Bookmarks🏆RSSHow to UseFAQ
Built with and by Teycir Ben Soltane•
How to Use•FAQ•GitHub•arXiv.org•
Share:

20 results for “Iterative methods”

CS papers only

Hybrid search: Keyword + semantic, ranked by combined score.ⓘ

Want pure semantic search? Try claim verification →

math.NAstat.MLTheoreticalRecentJul 28, 2026

Sequential Preconditioned Conjugate Gradient Method for Linear Statistical Models

Guan-Yu Chen, Dong-Yue Xie, Xi Yang, Zun-Hao Zheng

This paper proposes a randomized iterative method called Sequential Preconditioned Conjugate Gradient Method (SPCG) for large-scale linear statistical models, which significantly reduces computational…

View →
math.OCcs.AIcs.LGTheoreticalRecentJul 23, 2026

Barzilai-Borwein Fails Superlinear Convergence on an Open Set of Quadratics for Every Dimension $n\geq 4$

Dawei Li, Xiaotian Jiang, Mingyi Hong

This paper constructs strictly convex quadratic problems and initial points for which the long Barzilai--Borwein method does not converge root-superlinearly.

View →
cs.AImath.OCRecentJun 1, 2026

Stochastic convergence of parallel asynchronous adaptive first-order methods

Serge Gratton, Philippe L. Toint

The paper analyzes a new class of asynchronous adaptive first-order optimization methods and proves their stochastic convergence rate is O(1/sqrt{t}) for non-convex functions.

View →
cs.MAmath.DSTheoreticalRecentJul 8, 2026

Stability and Convergence of Optimistic Exponential Weights with Asymmetric Step Sizes in Bimatrix Games

Hédi Hadiji, Sarah Sachs

This paper investigates the convergence and stability of equilibria in bimatrix two-player games using the optimistic exponential weights method, allowing step sizes to differ.

View →
cs.LGTheoreticalRecentJul 24, 2026

Complexity Bounds and Approaches to Learning Projected Gradient Descent Solver Iterates

Anjian Li, Ryne Beeson

This paper proposes a data collection strategy using solver iterates to augment datasets for training generative models, improving the efficiency of the data-model-optimization loop in one-sided box-c…

View →
cs.LGcs.AIRecentJun 1, 2026

FOAM: Frequency and Operator Error-Based Adaptive Damping Method for Reducing Staleness-Oriented Error for Shampoo

Kyunghun Nam, Sumyeong Ahn

The paper proposes FOAM, an adaptive damping method that stabilizes the Shampoo optimization algorithm by dynamically controlling damping and eigendecomposition frequency, thereby reducing staleness-i…

View →
cs.AIcs.LGRecentJun 1, 2026

Iteris: Agentic Research Loops for Computational Mathematics

Leheng Chen, Zihao Liu, Wanyi He, Bin Dong

The paper introduces Iteris, an agentic research system, demonstrating its capability to generate numerical evidence, constructions, and proof drafts for open problems in computational mathematics, re…

View →
cs.CCRecentMay 31, 2026

On the Complexity of Recurrence Evaluation

Artem Parfenov, Michael Vyalyi

This paper analyzes the computational complexity of evaluating recurrent functions, showing that the complexity depends heavily on how the input offsets are encoded and the structure of the recurrence…

View →
cs.DCEmpiricalRecentJul 2, 2026

Elasticity in Parallel Sparse Triangular Solve

Raphael S. Steiner, Christos K. Matzoros, Pál András Papp, Toni Böhnlein +1 more

This paper introduces Stale Synchronous Parallel mode of execution for parallel sparse triangular linear system solve and presents a scheduler that achieves geometric-mean speed-ups of 7-30% over Grow…

View →
cs.ITquant-phTheoreticalRecentJun 25, 2026

A Quantum Method of Types

Arick Grootveld

The authors introduce a quantum empirical operator and use it to prove a universal achievability result for composite quantum hypothesis testing.

View →
cs.NEEmpiricalRecentJul 18, 2026

Hybrid Augmented Lagrangian Method for General Constrained Optimization via Evolutionary Algorithms

Lampros Printzios, Konstantinos Chatzilygeroudis

This paper proposes a Hybrid Augmented Lagrangian (HyAL) method that integrates the constraint-handling strengths of the AL framework with the exploratory power of population-based search.

View →
math.NAmath.OCstat.MLTheoreticalRecentJul 18, 2026

A Deep Second-Order Stochastic Residual Method for Fully Nonlinear Parabolic PDEs

Zhenhua Zhao, Jihao Long

Introduce Deep Second-Order Stochastic Residual Method (D2SRM) for high-dimensional, Hessian-dependent fully nonlinear parabolic PDEs, establish well-posedness, and develop population-level convergenc…

View →
math.OCcs.LGcs.NETheoreticalRecentJun 12, 2026

Operator Calculus for Population-Based Optimization: A Mean-Field Convergence Theory

Pekka Malo, Lauri Viitasaari, Patrik Nummi, Antti Suominen +2 more

The paper introduces an operator calculus for population-based optimization methods, establishing a modular Lyapunov principle for their convergence analysis.

View →
cs.CEphysics.comp-phRecentMay 27, 2026

Unified sparse framework for large-scale material point method simulations

Yidong Zhao, Lars Blatny, Xiang Feng, Mikkel M. Juel +2 more

This paper proposes a unified sparse background-grid framework for the Material Point Method (MPM), significantly reducing computational time and memory usage in large-scale simulations where the mate…

View →
cs.DMTheoreticalRecentJun 11, 2026

Fibonacci and Catalan Numbers Meet in Staircase Polyominoes

Jean-Luc Baril, José Luis Ramírez, Samuel Ramírez, Diego Villamizar

This paper derives multivariate generating functions to refine the enumeration of Fibonacci polyominoes.

View →
math.NAcs.NETheoreticalRecentJul 24, 2026

Closed-Loop Generative Selection: Convergence, Memory, and Noisy Oracles

Konstantin Fackeldey, Christof Schütte

This paper develops a convergence theory and runtime bound for closed-loop generative selection in computational drug discovery, showing that elitism makes the search absorbing and proving almost-sure…

View →