AdrienTaylor / Unconstrained-Performance-Estimation-Problems-first-order-methods-

This code can be used to reproduce all results from the paper "Smooth strongly convex interpolation and exact worst-case performance of first-order methods" (published in Mathematical Programming). (newer version available in the PESTO toolbox)

Unconstrained-Performance-Estimation-Problems-first-order-methods

This code can be used to reproduce the results from the work:

[1] Taylor, Adrien B., Julien M. Hendrickx, and François Glineur. "Smooth strongly convex interpolation and exact worst-case performance of first-order methods." Mathematical Programming 161.1-2 (2017): 307-345.

Getting started

To use the code, download the repository and execute the demo file.

Note: This code requires YALMIP along with a suitable SDP solver (e.g., Sedumi, SDPT3, Mosek).

Going Further

This code is only meant to reproduce the results from [1]; if the purpose is to use performance estimation problems in other contexts, the reader should instead have a look at the more recent Performance Estimation Toolbox.

Authors

• Adrien Taylor
• Julien Hendrickx
• François Glineur