arXiv:2610. 13787v1 Announce Type: cross Abstract: We present new algorithms for stochastic optimization problems in which the objective is neither smooth nor convex, subject to a convex constraint set.
By Gon Buzaglo, Guy Kornowski
arXiv:2607. 07206v1 Announce Type: new Abstract: Adaptive optimizers mix several mechanisms: a metric or preconditioner maps gradients to descent directions, while estimation, memory, step-size control, constraints, stochasticity, target modification, and discretization determine which directions are available and how they are used.
By Zavier Li
arXiv:2610.19652v1 Announce Type: new
Abstract: Recent work has sought to transfer first-order nonconvex optimization guarantees to zeroth-order methods through gradient estimators, typically incurri...
By Yuxuan Xia, Xiao-Tong Yuan
arXiv:2607. 08954v1 Announce Type: cross Abstract: We study nonasymptotic convergence of primal-dual methods for a class of nonconvex constrained optimization problems with a convex-composite structure.
By Linglingzhi Zhu, Jiajin Li
arXiv:2607. 19553v1 Announce Type: cross Abstract: We study online optimization for a broad class of structured non-convex non-smooth problems where each loss is a composition of a difference-of-convex function with a smooth mapping, and the feasible region is defined by constraint functions of the same kind.
By Jingwei Ji, Jong-Shi Pang, Renyuan Xu
arXiv:2609. 23837v1 Announce Type: cross Abstract: We study the complexity of finding $(\delta,\epsilon)$-Goldstein stationary points of nonsmooth nonconvex Lipschitz functions.
By Guy Kornowski
arXiv:2511. 19656v3 Announce Type: replace Abstract: Although upper bound guarantees for bilevel optimization have been widely studied, progress on lower bounds has been limited due to the complexity of the bilevel structure.
By Kaiyi Ji
arXiv:2610. 12328v1 Announce Type: new Abstract: We consider stochastic nonsmooth nonconvex composite optimization, which includes several important problems such as constrained optimization and the regularized training of neural networks.
By Mingyi Li, Taira Tsuchiya, Kenji Yamanishi
arXiv:2610. 13773v1 Announce Type: cross Abstract: Multiple-gradient descent is typically formulated in Euclidean geometry, whereas matrix-aware optimizers use directions induced by other norms.
By El Mahdi Chayti, Alireza Mirrokni, Martin Jaggi
The paper introduces Policy Gradient Penalty (PGP), a single‑loop policy‑space method that enforces convex occupancy‑measure constraints via quadratic‑penalty regularization. PGP constructs pseudo‑rewards to estimate gradients of the penalized objective and uses the classical Policy Gradient Theorem, establishing smoothness and global last‑iterate convergence guarantees for an ε‑optimal constrained entropy value with ε‑bounded constraint violation. The authors validate PGP with ablations on a grid‑world benchmark and demonstrate scalability on two challenging continuous‑control tasks.
By Florian Wolf, Ilyas Fatkhullin, Niao He
arXiv:2504.09409v3 Announce Type: replace-cross
Abstract: In this paper, we study nonconvex constrained stochastic zeroth-order optimization problems with exact constraints and stochastic objective e...
By Qiankun Shi, Han Yuan, Xiao Wang, Hao Wang
The paper introduces D$^3$Opt, a derivative‑free diffusion‑based framework that separates constraint modeling from objective optimization in chance‑constrained programs. It learns a risk‑conditioned diffusion model once on constraint‑filtered decisions, then uses an annealed, particle‑based Feynman–Kac correction to optimize any post‑specified objective without retraining. The method is proven to preserve feasibility and provides an error bound, and experiments show effective optimization across smooth, non‑smooth, and non‑convex objectives, including objective transfer tasks.
By Ziwen Liu, Yan Liu, Congying Han, Tiande Guo, Yao Yan, Weichen Zhao