Skip to content
Preprint

Strong growth and Goldstein subgradients in piecewise smooth optimization

Aug 2026 · 0 citations · 29 references
Mathematics

TL;DR

In the nonconvex case, it is proved that quadratic growth in conjunction with a regularity property for the active gradients suffices, and it is proved that quadratic growth in conjunction with a regularity property for the active gradients suffices.

Abstract

We explore a new growth condition for Lipschitz functions around local minimizers, recently proposed in the context of Goldstein-subgradient-based algorithms and their behavior in practice. On generic examples, these algorithms are often observed to converge approximately linearly. We focus on objectives that are piecewise twice continuously differentiable. In that case, the new growth condition holds when the objective is, in addition, strongly convex. In the nonconvex case, we prove that quadratic growth in conjunction with a regularity property for the active gradients suffices. Computational experiments illustrate the importance of the assumptions.

View source

Similar papers

Preprint Sep 2026

Convergence of a Randomized Newton Method in Nonconvex Optimization

This work analyzes a stochastic Newton optimization scheme for locating the unique global minimizer of a general nonconvex objective function and proves global almost sure convergence.

Edward Huynh, Bjorn Engquist · 0 citations
Preprint Aug 2026

On Nonsmooth and Relatively Weakly Convex Minimization

A model-based minimization method is developed under a relative Lipschitz condition and a framework with convergence guarantees is extended to the setting where the distance generating function and its gradient are accessible only through a stochastic oracle.

Chen Jiang, Jia-Wen Bi, Shu-Zhong Zhang · 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
Open access 2017

About the Gradient Projection Algorithm for a Strongly Convex Function and a Proximally Smooth Set

We consider the gradient projection algorithm for a strongly convex function with the Lipschitz continuous gradient and a proximally smooth (nonconvex in general) set in a real Hilbert space. We prove that the problem of minimization of such function on a proximally smooth set has unique solution if the constant of pro...

M. V. Balashov · 13 citations
Open access 2024

Perturbed Degenerate State-Dependent Sweeping Processes with Convex and Nonconvex Sets

We prove by means of the Moreau-Yosida regularization an existence result for perturbed degenerate state-dependent sweeping processes with convex and nonconvex moving sets. The moving sets vary in a Lipschitz continuous way with respect to the truncated Hausdorff distance. The theoretical results are applied to obtain...

D. Narváez, Emilio Vilches · 2 citations · ⚡1
Open access 2026

The Derivative of a Nonlinear Positively Homogeneous Variational Inequality is a Complementarity Problem

Using advanced concepts and techniques from convex and variational analysis (such as the notion of twice epi-differentiability), we establish, under a set of appropriate conditions (including a polyhedricity assumption), that the solution to a parameterized nonlinear variational inequality associated with a positively...

Samir Adly, L. Bourdin · 0 citations

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