Skip to content
Preprint

Asymptotic Analysis of Gradient Mapping-type Stationarity Measure for the Sum of Nonconvex Nonsmooth Functions and Applications to Proximal Gradient-type Algorithms

Sep 2026 · 0 citations · 80 references
Mathematics

TL;DR

It is shown that Fr\'echet or proximal stationarity can be characterized through asymptotic vanishing of the proposed measure along some convergent sequence and analogous asymptotic results for a smoothing-based variant of the measure are established.

Abstract

We propose a gradient mapping-type stationarity measure for the sum of two possibly nonsmooth nonconvex functions. Under suitable regularity assumptions, we show that Fr\'echet or proximal stationarity can be characterized through asymptotic vanishing of the proposed measure along some convergent sequence. We also establish analogous asymptotic results for a smoothing-based variant of the measure, which enables us to combine the proposed framework with smoothing techniques developed for nonsmooth optimization. As an application of our analysis of the stationarity measure, we provide an affirmative answer to an open question raised by [Olikier-Waldspurger, SIAM J. Optim., 2025] on whether every cluster point of a sequence generated by a proximal gradient method is a proximal stationary point under local Lipschitz smoothness of one component of the cost function. As a second application, we propose a proximal variable smoothing algorithm with a nonmonotone linesearch for minimizing the sum of two nonsmooth nonconvex functions under lower regularity of one component and prox-regularity of the other. For the proposed algorithm, we show that every cluster point of a subsequence such that the stationarity measure vanishes is a Fr\'echet stationary point.

View source

Similar papers

Sep 2026

A Gauss–Seidel Type Inertial Proximal Stochastic Alternating Direction Method of Multipliers for Nonconvex Finite Sum Optimization

This paper establishes that every bounded sequence generated by Gi-PSADMM with the variance-reduced stochastic gradient estimator converges globally to a critical point in expectation and derives the convergence rate of Gi-PSADMM that depends on the KL exponent.

Jia Hu, Shi-Chen Liao, Cong-Ying Han et al. · 0 citations
Preprint Sep 2026

Projected Subgradient Methods for a Class of Nonsmooth and Nonconvex Optimization Problems

We investigate the optimization problem of minimizing a nonsmooth function that satisfies a nonsmooth version of the descent lemma over a nonempty and closed but not necessarily convex set. The objective function belongs to the class of upper-$\mathcal{C}^2$ functions, whereas the constraints may promote a sparse or lo...

Christian Kanzow, Jannis Krüger, Leo Lehmann · 0 citations

Global convergence of a coderivative-based regularized Newton method with damping for nonsmooth optimization

A globally convergent regularized Newton method with positive definite regularization for solving nonsmooth optimization problems that replaces the identity matrix in traditional algorithms with a general positive-definite symmetric matrix to regularize the generalized Hessian.

Wei Ouyang, Zhenghong Tan, JiangxingZhu · 0 citations
#machine learning Preprint Sep 2026

Polyak-Type Extragradient Methods for Monotone Root-Finding Problems

We study Polyak-type step-size selection for extragradient methods for solving deterministic and stochastic monotone root-finding problems. We show that the known projection-type correction for deterministic extragradient arises from minimizing an upper bound on the distance to a solution, paralleling the classical Pol...

Taeho Yoon, Sayantan Choudhury, Ezra Greenberg et al. · 1 citation
Open access Sep 2026

On convergence rates of stochastic gradient descent for linear inverse problems

Stochastic gradient methods have gained increasing attention for solving large-scale inverse problems due to their computational efficiency. However, their theoretical justification in the context of ill-posed problems remains underdeveloped, particularly regarding convergence rate analysis, where existing results...

Qi-Nian Jin, Xi-Liang Lu, Lin Tian · 0 citations

We use cookies to run the site and, with your consent, for analytics and to show ads. See our Cookie Policy.