Cover Image

Analyzing the speed of convergence in nonsmooth optimization via the Goldstein subdifferential with application to descent methods

Fuente: arXiv

Saved in:

Bibliographic Details
Main Author:	Gebken, Bennet
Format:	Preprint
Published:	2024
Subjects:	Optimization and Control 90C30, 90C56, 49J52
Online Access:	Acceder al recurso
Tags:	Add Tag No Tags, Be the first to tag this record!

Similar Items

Using second-order information in gradient sampling methods for nonsmooth optimization
by: Gebken, Bennet
Published: (2022)

A note on the convergence of deterministic gradient sampling in nonsmooth optimization
by: Gebken, Bennet
Published: (2023)

On second-order optimality conditions for $C^{1,1}$ optimization problems via Lagrangian functions
by: An, Duong Thi Viet, et al.
Published: (2024)

Revisiting the Geometrically Decaying Step Size: Linear Convergence for Smooth or Non-Smooth Functions
by: Kim, Jihun
Published: (2025)

An interior-point trust-region method for nonsmooth regularized bound-constrained optimization
by: Leconte, Geoffroy, et al.
Published: (2024)

Commutation principles for nonsmooth variational problems on Euclidean Jordan algebras
by: Jeong, Juyoung, et al.
Published: (2024)

Adaptive direct search algorithms for constrained optimization
by: Audet, Charles, et al.
Published: (2025)

Non-subdifferentiability optimality and mean value theorems via new relative subdifferentials
by: Thinh, Vo Duc, et al.
Published: (2024)

Tilt stability of Ky-Fan $κ$-norm composite optimization
by: Liu, Yulan, et al.
Published: (2024)

Technical results on the convergence of quasi-Newton methods for nonsmooth optimization
by: Gebken, Bennet
Published: (2025)

Stationarity in nonsmooth optimization between geometrical motivation and topological relevance
by: Shikhman, Vladimir
Published: (2024)

On the existence and the stability of solutions in nonconvex vector optimization
by: Van Nghi, Tran, et al.
Published: (2025)

MGProx: A nonsmooth multigrid proximal gradient method with adaptive restriction for strongly convex optimization
by: Ang, Andersen, et al.
Published: (2023)

Isolated calmness of perturbation mappings in generalized nonlinear programming and local superlinear convergence of Newton-type methods
by: Benko, Matúš, et al.
Published: (2024)

Block-coordinate and incremental aggregated proximal gradient methods for nonsmooth nonconvex problems
by: Latafat, Puya, et al.
Published: (2019)

Complexity of trust-region methods with unbounded Hessian approximations for smooth and nonsmooth optimization
by: Leconte, Geoffroy, et al.
Published: (2023)

A truncated epsilon-subdifferential method for global DC optimization
by: Bagirov, Adil M., et al.
Published: (2025)

Moreau envelope and proximal-point methods under the lens of high-order regularization
by: Kabgani, Alireza, et al.
Published: (2025)

On approximate Pareto solutions in nonsmooth interval-valued multiobjective optimization with data uncertainty in constraints
by: Quan, Vu Hong, et al.
Published: (2025)

Second-Order Optimality Conditions for Sparse Differentiable Optimization Problems via Limiting Second-Order Subdifferentials
by: Huyen, Luu Thi Thu, et al.
Published: (2026)

Optimization Problems with Difference of Tangentially Convex Functions under Uncertainty
by: Mashkoorzadeh, Feryal, et al.
Published: (2026)

Finding directional stationary points of DC programs
by: Thi, Hoai An Le, et al.
Published: (2026)

On the directional asymptotic approach in optimization theory
by: Benko, Matúš, et al.
Published: (2024)

Directional Subdifferentials at Infinity and Its Applications
by: Kien, Le Ngoc, et al.
Published: (2025)

Approximate directional stationarity and associated qualification conditions
by: Käming, Isabella, et al.
Published: (2026)

On second-order Karush--Kuhn--Tucker optimality conditions for $C^{1,1}$ vector optimization problems
by: Van Tuyen, Nguyen
Published: (2025)

Nonmonotone subgradient methods based on a local descent lemma
by: Aragón-Artacho, Francisco J., et al.
Published: (2025)

Variational properties of the abstract subdifferential operator
by: Millàn, Reinier Diàz, et al.
Published: (2022)

A new problem qualification based on approximate KKT conditions for Lipschitzian optimization with application to bilevel programming
by: Käming, Isabella, et al.
Published: (2024)

Optimality conditions at infinity for nonsmooth minimax programming
by: Van Tuyen, Nguyen, et al.
Published: (2024)

A Bregman forward-backward linesearch algorithm for nonconvex composite optimization: superlinear convergence to nonisolated local minima
by: Ahookhosh, Masoud, et al.
Published: (2019)

(Adaptive) Scaled gradient methods beyond locally Holder smoothness: Lyapunov analysis, convergence rate and complexity
by: Ghaderi, Susan, et al.
Published: (2025)

A penalty barrier framework for nonconvex constrained optimization
by: De Marchi, Alberto, et al.
Published: (2024)

Projected subgradient methods for paraconvex optimization: Application to robust low-rank matrix recovery
by: Rahimi, Morteza, et al.
Published: (2024)

Clarke's tangent cones, subgradients, optimality conditions and the Lipschitzness at infinity
by: Nguyen, Minh Tung, et al.
Published: (2022)

Local properties and augmented Lagrangians in fully nonconvex composite optimization
by: De Marchi, Alberto, et al.
Published: (2023)

An interior proximal gradient method for nonconvex optimization
by: De Marchi, Alberto, et al.
Published: (2022)

PANOC-lite: A simpler and more efficient algorithm for composite minimization
by: Bodard, Alexander, et al.
Published: (2026)

ItsDEAL: Inexact two-level smoothing descent algorithms for weakly convex optimization
by: Kabgani, Alireza, et al.
Published: (2025)

Approximate optimality conditions and sensitivity analysis in nearly convex optimization
by: Van Tuyen, Nguyen, et al.
Published: (2024)