IDEAS home Printed from https://ideas.repec.org/p/tiu/tiutis/03a65c83-e88f-4723-a50e-287f7820dcbe.html
   My bibliography  Save this paper

Worst-case convergence analysis of inexact gradient and Newton methods through semidefinite programming performance estimation

Author

Listed:
  • de Klerk, Etienne

    (Tilburg University, School of Economics and Management)

  • Glineur, Francois
  • Taylor, Adrien

Abstract

We provide new tools for worst-case performance analysis of the gradient (or steepest descent) method of Cauchy for smooth strongly convex functions, and Newton’s method for selfconcordant functions, including the case of inexact search directions. The analysis uses semidefinite programming performance estimation, as pioneered by Drori and Teboulle [Math. Program., 145 (2014), pp. 451–482], and extends recent performance estimation results for the method of Cauchy by the authors [Optim. Lett., 11 (2017), pp. 1185–1199]. To illustrate the applicability of the tools, we demonstrate a novel complexity analysis of short step interior point methods using inexact search directions. As an example in this framework, we sketch how to give a rigorous worst-case complexity analysis of a recent interior point method by Abernethy and and Hazan [PMLR, 48 (2016), pp. 2520– 2528].
(This abstract was borrowed from another version of this item.)

Suggested Citation

  • de Klerk, Etienne & Glineur, Francois & Taylor, Adrien, 2020. "Worst-case convergence analysis of inexact gradient and Newton methods through semidefinite programming performance estimation," Other publications TiSEM 03a65c83-e88f-4723-a50e-2, Tilburg University, School of Economics and Management.
    • Handle: RePEc:tiu:tiutis:03a65c83-e88f-4723-a50e-287f7820dcbe
    as

    Download full text from publisher

    File URL: https://pure.uvt.nl/ws/portalfiles/portal/41338161/PEP_for_Newton_method_for_SC_barriers_accepted_version_erratum.pdf
    Download Restriction: no
    ---><---

    Other versions of this item:

    Citations

    Citations are extracted by the CitEc Project, subscribe to its RSS feed for this item.
    as


    Cited by:

    1. André Uschmajew & Bart Vandereycken, 2022. "A Note on the Optimal Convergence Rate of Descent Methods with Fixed Step Sizes for Smooth Strongly Convex Functions," Journal of Optimization Theory and Applications, Springer, vol. 194(1), pages 364-373, July.
    2. Abbaszadehpeivasti, Hadi & de Klerk, Etienne & Zamani, Moslem, 2023. "Convergence rate analysis of randomized and cyclic coordinate descent for convex optimization through semidefinite programming," Other publications TiSEM 88512ac0-c26a-4a99-b840-3, Tilburg University, School of Economics and Management.
    3. Roland Hildebrand, 2021. "Optimal step length for the Newton method: case of self-concordant functions," Mathematical Methods of Operations Research, Springer;Gesellschaft für Operations Research (GOR);Nederlands Genootschap voor Besliskunde (NGB), vol. 94(2), pages 253-279, October.
    4. Abbaszadehpeivasti, Hadi & de Klerk, Etienne & Zamani, Moslem, 2022. "The exact worst-case convergence rate of the gradient method with fixed step lengths for L-smooth functions," Other publications TiSEM 061688c6-f97c-4024-bb5b-1, Tilburg University, School of Economics and Management.

    More about this item

    Statistics

    Access and download statistics

    Corrections

    All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:tiu:tiutis:03a65c83-e88f-4723-a50e-287f7820dcbe. See general information about how to correct material in RePEc.

    If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.

    We have no bibliographic references for this item. You can help adding them by using this form .

    If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your RePEc Author Service profile, as there may be some citations waiting for confirmation.

    For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: Richard Broekman (email available below). General contact details of provider: https://www.tilburguniversity.edu/about/schools/economics-and-management/ .

    Please note that corrections may take a couple of weeks to filter through the various RePEc services.

    IDEAS is a RePEc service. RePEc uses bibliographic data supplied by the respective publishers.