Weekly research briefing
A highly selective weekly digest with two independent sections: up to seven peer-reviewed research articles from Springer Nature, Elsevier, Taylor & Francis, SIAM, and Wiley, followed by a curated arXiv preprint shortlist. Priority topics include unconstrained optimization, gradient and conjugate-gradient methods, quasi-Newton methods, line search, global and convergence-rate analysis, nonconvex optimization, nonlinear equations and nonlinear least squares, monotone operator equations, logistic regression, machine-learning optimization, and signal processing. These topics guide ranking rather than act as hard exclusions. Each issue reports main result claims and what to read first.
Two peer-reviewed Springer Nature articles plus seven separately curated arXiv preprints, with publisher and preprint results clearly distinguished.
Read issue 5 →Four selected papers, led by a decentralized objective-function-free trust-region method with centralized-order complexity guarantees.
Read issue 4 →Five substantive papers, including a negative resolution of a long-standing global-convergence question for classical DFP.
Read issue 3 →Four core selections and one strategic read on optimization-driven progress in matrix multiplication.
Read issue 2 →The inaugural shortlist: five methodologically substantial contributions across Krylov methods, optimization, nonlinear least squares, and structured KKT systems.
Read issue 1 →