Accuracy Certificates for Convex Minimization with Inexact Oracle.
Saved in:
| Title: | Accuracy Certificates for Convex Minimization with Inexact Oracle. |
|---|---|
| Authors: | Gladin, Egor1,2 (AUTHOR) elgladin@hse.ru, Gasnikov, Alexander3,4,5 (AUTHOR) gasnikov@yandex.ru, Dvurechensky, Pavel6 (AUTHOR) pavel.dvurechensky@wias-berlin.de |
| Source: | Journal of Optimization Theory & Applications. Jan2025, Vol. 204 Issue 1, p1-23. 23p. |
| Subjects: | Lagrange problem, Subgradient methods, Algorithms |
| Abstract: | Accuracy certificates for convex minimization problems allow for online verification of the accuracy of approximate solutions and provide a theoretically valid online stopping criterion. When solving the Lagrange dual problem, accuracy certificates produce a simple way to recover an approximate primal solution and estimate its accuracy. In this paper, we generalize accuracy certificates for the setting of an inexact first-order oracle, including the setting of primal and Lagrange dual pair of problems. We further propose an explicit way to construct accuracy certificates for a large class of cutting plane methods based on polytopes. As a by-product, we show that the considered cutting plane methods can be efficiently used with a noisy oracle even though they were originally designed to be equipped with an exact oracle. Finally, we illustrate the work of the proposed certificates in the numerical experiments highlighting that our certificates provide a tight upper bound on the objective residual. [ABSTRACT FROM AUTHOR] |
| Copyright of Journal of Optimization Theory & Applications is the property of Springer Nature and its content may not be copied or emailed to multiple sites without the copyright holder's express written permission. Additionally, content may not be used with any artificial intelligence tools or machine learning technologies. However, users may print, download, or email articles for individual use. This abstract may be abridged. No warranty is given about the accuracy of the copy. Users should refer to the original published version of the material for the full abstract. (Copyright applies to all Abstracts.) | |
| Database: | Engineering Source |
|
Full text is not displayed to guests.
Login for full access.
|
|
| Abstract: | Accuracy certificates for convex minimization problems allow for online verification of the accuracy of approximate solutions and provide a theoretically valid online stopping criterion. When solving the Lagrange dual problem, accuracy certificates produce a simple way to recover an approximate primal solution and estimate its accuracy. In this paper, we generalize accuracy certificates for the setting of an inexact first-order oracle, including the setting of primal and Lagrange dual pair of problems. We further propose an explicit way to construct accuracy certificates for a large class of cutting plane methods based on polytopes. As a by-product, we show that the considered cutting plane methods can be efficiently used with a noisy oracle even though they were originally designed to be equipped with an exact oracle. Finally, we illustrate the work of the proposed certificates in the numerical experiments highlighting that our certificates provide a tight upper bound on the objective residual. [ABSTRACT FROM AUTHOR] |
|---|---|
| ISSN: | 00223239 |
| DOI: | 10.1007/s10957-024-02599-9 |
