Gradient sampling methods for nonsmooth optimization

DOI10.1007/978-3-030-34910-3_6MaRDI QIDQ6896196zbMATH OpenFDO

Authors James V. Burke, Frank E. Curtis, A. S. Lewis, Michael L. Overton, Lucas E. A. Simões

Publication date 21 November 2025

Full work available at URL https://doi.org/10.1007/978-3-030-34910-3_6

Mathematics Subject Classification ID

Nonconvex programming, global optimization (90C26) Nonsmooth analysis (49J52) Derivative-free methods and methods using generalized derivatives (90C56)

Cited in

(6)

• Analyzing the speed of convergence in nonsmooth optimization via the Goldstein subdifferential
• Proximal gradient \(\mathcal{VU}\)-method with superlinear convergence for nonsmooth convex optimization
• A constraint dissolving approach for nonsmooth optimization over the Stiefel manifold
• Spectrum-based stability analysis and stabilization of systems with time-periodic delay differential algebraic equations
• Bounding-focused discretization methods for the global optimization of nonconvex semi-infinite programs
• A subspace framework for \(\mathcal{L}_{\infty}\) model reduction

This page was built for publication: Gradient sampling methods for nonsmooth optimization

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6896196)