[go: up one dir, main page]
IDEAS home Printed from https://ideas.repec.org/a/inm/ormoor/v48y2023i2p865-884.html
   My bibliography  Save this article

Strong Convexity of Feasible Sets in Off-line and Online Optimization

Author

Listed:
  • Marco Molinaro

    (Computer Science Department, Pontifical Catholic University of Rio de Janeiro, Rio de Janeiro, RJ 22451, Brazil)

Abstract
It is known that the curvature of the feasible set in convex optimization allows for algorithms with better convergence rates, and there is renewed interest in this topic for both off-line and online problems. In this paper, leveraging results on geometry and convex analysis, we further our understanding of the role of curvature in optimization: We first show the equivalence of two notions of curvature, namely, strong convexity and gauge bodies, proving a conjecture of Abernethy et al. As a consequence, this shows that the Frank–Wolfe–type method of Wang and Abernethy has accelerated convergence rate O ( 1 t 2 ) over strongly convex feasible sets without additional assumptions on the (convex) objective function. In online linear optimization, we identify two main properties that help explaining why/when follow the leader (FTL) has only logarithmic regret over strongly convex sets. This allows one to directly recover and slightly extend a recent result of Huang et al., and to show that FTL has logarithmic regret over strongly convex sets whenever the gain vectors are nonnegative. We provide an efficient procedure for approximating convex bodies by strongly convex ones while smoothly trading off approximation error and curvature. This allows one to extend the improved algorithms over strongly convex sets to general convex sets. As a concrete application, we extend results on online linear optimization with hints to general convex sets.

Suggested Citation

  • Marco Molinaro, 2023. "Strong Convexity of Feasible Sets in Off-line and Online Optimization," Mathematics of Operations Research, INFORMS, vol. 48(2), pages 865-884, May.
    • Handle: RePEc:inm:ormoor:v:48:y:2023:i:2:p:865-884
    DOI: 10.1287/moor.2022.1285
    as

    Download full text from publisher

    File URL: http://dx.doi.org/10.1287/moor.2022.1285
    Download Restriction: no
    File URL: https://libkey.io/10.1287/moor.2022.1285?utm_source=ideas
    LibKey link: if access is restricted and if your library uses this service, LibKey will redirect you to where you can use your library subscription to access this item
    ---><---

    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:inm:ormoor:v:48:y:2023:i:2:p:865-884. 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: Chris Asher (email available below). General contact details of provider: https://edirc.repec.org/data/inforea.html .

    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.