Polynomial spectral-radius lower-bound conjecture for p-CLI methods
Polynomial spectral-radius lower-bound conjecture for p-CLI methods
Let , and let and be polynomials of degree at most satisfying . For a polynomial, let denote the maximum modulus of its roots. Write
Polynomial lower-bound conjecture. There exists such that
This is presented as a reduction of the algorithmic conjecture to a question about polynomials, so it expresses the same proposed obstruction in purely analytic terms. The source gives no evidence that it has been resolved.
Sources & referencesView supporting material
Primary source
Yossi Arjevani, “On Lower and Upper Bounds in Smooth Strongly Convex Optimization - A Unified Approach via Linear Iterative Methods”, arXiv:1410.6387 (2014).
Progress summary
Nothing recorded yet. Refresh searches the literature and the public web for attempts on this problem, and writes the first summary here.
Solutions 0
Sign in to submit a solution.
No solutions have been posted yet.