Rate of metastability of an iterative algorithm for quadratic optimization
Optimization and Control
2025-06-16 v1 Logic
Abstract
In this paper, relying on methods from proof mining, we provide a quantitative analysis of a theorem due to Xu, stating that an iteration strongly converges to the solution of a well known quadratic optimization problem. Rates of metastability and some rates of asymptotic regularity were obtained. We get quadratic rates of asymptotic regularity for particular sequences.
Cite
@article{arxiv.2506.11342,
title = {Rate of metastability of an iterative algorithm for quadratic optimization},
author = {Paulo Firmino},
journal= {arXiv preprint arXiv:2506.11342},
year = {2025}
}
Comments
34 pages