Revisiting subgradient method: complexity and convergence beyond Lipschitz continuity

DOI10.1007/S10013-024-00715-WMaRDI QIDQ6913296zbMATH OpenFDO

Authors Xiao Li, Lei Zhao, Daoli Zhu, Anthony Man-Cho So

Publication date 21 October 2025

Published in Vietnam Journal of Mathematics (Search for Journal in Brave)

zbMATH Keywords

iteration complexitysubgradient methodnon-Lipschitz optimization

Mathematics Subject Classification ID

Nonconvex programming, global optimization (90C26) Nonlinear programming (90C30)

This page was built for publication: Revisiting subgradient method: complexity and convergence beyond Lipschitz continuity

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