A new inexact gradient descent method with applications to nonsmooth convex optimization.
Saved in:
| Title: | A new inexact gradient descent method with applications to nonsmooth convex optimization. |
|---|---|
| Authors: | Khanh, Pham Duy1 (AUTHOR) pdkhanh182@gmail.com, Mordukhovich, Boris S.2 (AUTHOR) aa1086@wayne.edu, Tran, Dat Ba2 (AUTHOR) |
| Source: | Optimization Methods & Software. Apr2026, Vol. 41 Issue 2, p394-422. 29p. |
| Subjects: | Nonsmooth optimization, Convex programming, Mathematical optimization, Optimization algorithms |
| Abstract: | The paper proposes and develops a novel inexact gradient method (IGD) for minimizing $ {\mathcal {C}}^1 $ C 1 -smooth functions with Lipschitzian gradients, i.e. for problems of $ {\mathcal {C}}^{1,1} $ C 1 , 1 optimization. We show that the sequence of gradients generated by IGD converges to zero. The convergence of iterates to stationary points is guaranteed under the Kurdyka-Łojasiewicz (KL) property of the objective function with convergence rates depending on the KL exponent. The newly developed IGD is applied to designing two novel gradient-based methods of nonsmooth convex optimization such as the inexact proximal point methods (GIPPM) and the inexact augmented Lagrangian method (GIALM) for convex programs with linear equality constraints. These two methods inherit global convergence properties from IGD and are confirmed by numerical experiments to have practical advantages over some well-known algorithms of nonsmooth convex optimization. [ABSTRACT FROM AUTHOR] |
| Copyright of Optimization Methods & Software is the property of Taylor & Francis Ltd 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: | The paper proposes and develops a novel inexact gradient method (IGD) for minimizing $ {\mathcal {C}}^1 $ C 1 -smooth functions with Lipschitzian gradients, i.e. for problems of $ {\mathcal {C}}^{1,1} $ C 1 , 1 optimization. We show that the sequence of gradients generated by IGD converges to zero. The convergence of iterates to stationary points is guaranteed under the Kurdyka-Łojasiewicz (KL) property of the objective function with convergence rates depending on the KL exponent. The newly developed IGD is applied to designing two novel gradient-based methods of nonsmooth convex optimization such as the inexact proximal point methods (GIPPM) and the inexact augmented Lagrangian method (GIALM) for convex programs with linear equality constraints. These two methods inherit global convergence properties from IGD and are confirmed by numerical experiments to have practical advantages over some well-known algorithms of nonsmooth convex optimization. [ABSTRACT FROM AUTHOR] |
|---|---|
| ISSN: | 10556788 |
| DOI: | 10.1080/10556788.2024.2322700 |
