Goldstein stationarity in Lipschitz constrained optimization

DOI10.1007/S11590-024-02158-1MaRDI QIDQ6968758zbMATH OpenFDO

Authors Benjamin Grimmer, Zhichao Jia

Publication date 24 June 2025

Published in Optimization Letters (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/S11590-024-02158-1

zbMATH Keywords

constrained optimizationconstraint qualificationGoldstein stationaritynonsmooth nonconvex optimizationsubgradient methods

Mathematics Subject Classification ID

Numerical methods in optimal control (49Mxx) Numerical methods for mathematical programming, optimization and variational techniques (65Kxx) Mathematical programming (90Cxx)

Cites work

• A sequential quadratic programming algorithm for nonconvex, nonsmooth constrained optimization
• An effective nonsmooth optimization algorithm for locally Lipschitz functions
• Optimization of lipschitz continuous functions
• Stochastic first-order methods for convex and nonconvex functional constrained optimization
• The cost of nonconvexity in deterministic nonsmooth optimization

Cited in

(3)

• Inexact zeroth-order nonsmooth and nonconvex stochastic composite optimization and applications
• A SPIDER-type stochastic subgradient method for expectation-constrained nonconvex nonsmooth optimization
• Lipschitz minimization and the Goldstein modulus

This page was built for publication: Goldstein stationarity in Lipschitz constrained optimization

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