On the Link Between Polynomials and Optimization, Part 1

There's a fascinating link between minimization of quadratic functions and polynomials. A link that goes deep and allows to phrase optimization problems in the language of polynomials and vice versa. Using this connection, we can tap into centuries of research in the theory of polynomials and shed new light on …

There's a fascinating link between minimization of quadratic functions and polynomials. A link that goes deep and allows to phrase optimization problems in the language of polynomials and vice versa. Using this connection, we can tap into centuries of research in the theory of polynomials and shed new light on old problems. $$ \def\HH{\boldsymbol a} \def\rr{\boldsymbol r} \def\HH{\boldsymbol A} \def\HH{\boldsymbol H} \def\EE{\mathbb E} \def\II{\boldsymbol I} \def\CC{\boldsymbol C} \def\DD{\boldsymbol D} \def\KK{\boldsymbol K} \def\eeps{\boldsymbol \varepsilon} \def\tr{\text{tr}} \def\LLambda{\

related reading

• Why Momentum Really Worksdistill.pub
• Mathematical optimization - Wikipediaen.wikipedia.org
• bv_cvxbook.pdfweb.stanford.edu
• bv_cvxbook.pdfstanford.edu
• [1605.08101] Global rates of convergence for nonconvex optimization on manifoldsarxiv.org
• eecs127_reader.pdfeecs127.github.io
• Gradient descent - Wikipediaen.wikipedia.org
• Universal Complexity Bounds for Universal Gradient Methods in Nonlinear Optimizationarxiv.org
• Tropical Gradient Descentarxiv.org
• Pen and Paper Exercises in Machine Learningarxiv.org
• SIAG on Optimization Views and News 33(1)siagoptimization.github.io
• A wiggly function and its best approximationschebfun.org