Cover Image

A Gradient Sampling Algorithm for Noisy Nonsmooth Optimization

Fuente: arXiv

Saved in:

Bibliographic Details
Main Authors:	Berahas, Albert S., Curtis, Frank E., Zebiane, Lara
Format:	Preprint
Published:	2026
Subjects:	Optimization and Control
Online Access:	Acceder al recurso
Tags:	Add Tag No Tags, Be the first to tag this record!

Similar Items

NonOpt: Nonconvex, Nonsmooth Optimizer
by: Curtis, Frank E., et al.
Published: (2025)

Active-Set Identification in Noisy and Stochastic Optimization
by: Curtis, Frank E., et al.
Published: (2025)

Exploiting Negative Curvature in Conjunction with Adaptive Sampling: Theoretical Results and a Practical Algorithm
by: Berahas, Albert S., et al.
Published: (2024)

Negative Curvature Methods with High-Probability Complexity Guarantees for Stochastic Nonconvex Optimization
by: Berahas, Albert S., et al.
Published: (2026)

Optimistic Noise-Aware Sequential Quadratic Programming for Equality Constrained Optimization with Rank-Deficient Jacobians
by: Berahas, Albert S., et al.
Published: (2025)

Modified Line Search Sequential Quadratic Methods for Equality-Constrained Optimization with Unified Global and Local Convergence Guarantees
by: Berahas, Albert S., et al.
Published: (2024)

A Sequential Quadratic Programming Method with High Probability Complexity Bounds for Nonlinear Equality Constrained Stochastic Optimization
by: Berahas, Albert S., et al.
Published: (2023)

Low-Order Explicit Hessian Imitation Method for Large-Scale Supervised Machine Learning
by: Zhu, Yunlang, et al.
Published: (2026)

Faster Gradient-Free Algorithms for Nonsmooth Nonconvex Stochastic Optimization
by: Chen, Lesi, et al.
Published: (2023)

A Smoothing Consensus-Based Optimization Algorithm for Nonsmooth Nonconvex Optimization
by: Wei, Jiazhen, et al.
Published: (2025)

A line search framework with restarting for noisy optimization problems
by: Berahas, Albert S., et al.
Published: (2025)

A Stochastic-Gradient-based Interior-Point Algorithm for Solving Smooth Bound-Constrained Optimization Problems
by: Curtis, Frank E., et al.
Published: (2023)

A New Inexact Gradient Descent Method with Applications to Nonsmooth Convex Optimization
by: Khanh, Pham Duy, et al.
Published: (2023)

Smoothing Accelerated Proximal Gradient Method with Backtracking for Nonsmooth Multiobjective Optimization
by: Chengzhi, Huang
Published: (2025)

Nonsmooth Nonconvex-Concave Minimax Optimization: Convergence Criteria and Algorithms
by: Shi, Jinyang, et al.
Published: (2026)

High-Resolution Inertial Dynamics with Time-Rescaled Gradients for Nonsmooth Convex Optimization
by: Le, Manh Hung, et al.
Published: (2026)

Zeroth-order Gradient and Quasi-Newton Methods for Nonsmooth Nonconvex Stochastic Optimization
by: Marrinan, Luke, et al.
Published: (2023)

A Nesterov-Accelerated Primal-Dual Splitting Algorithm for Convex Nonsmooth Optimization
by: Condat, Laurent, et al.
Published: (2026)

Progressively Sampled Equality-Constrained Optimization
by: Curtis, Frank E., et al.
Published: (2025)

Second-order Information Promotes Mini-Batch Robustness in Variance-Reduced Gradients
by: Garg, Sachin, et al.
Published: (2024)

Gradient Descent for Convex and Smooth Noisy Optimization
by: Hu, Feifei, et al.
Published: (2024)

Introduction to Nonsmooth Analysis and Optimization
by: Clason, Christian, et al.
Published: (2020)

Smoothing Iterative Consensus-based Optimization Algorithm for Nonsmooth Nonconvex Optimization Problems with Global Optimality
by: Wei, Jiazhen, et al.
Published: (2025)

Speeding Up Nonsmooth Bayesian MCMC Sampling via Inexact Proximal Unadjusted Langevin Algorithm
by: Ghaderi, Susan, et al.
Published: (2026)

Smoothing Accelerated Proximal Gradient Method with Fast Convergence Rate for Nonsmooth Multi-objective Optimization
by: Huang, Chengzhi
Published: (2023)

Single-Loop Deterministic and Stochastic Interior-Point Algorithms for Nonlinearly Constrained Optimization
by: Curtis, Frank E., et al.
Published: (2024)

Decentralized Nonsmooth Nonconvex Optimization with Client Sampling
by: Chen, Xinyan, et al.
Published: (2026)

A Bregman Proximal Stochastic Gradient Method with Extrapolation for Nonconvex Nonsmooth Problems
by: Wang, Qingsong, et al.
Published: (2024)

Improved Last-Iterate Convergence of Shuffling Gradient Methods for Nonsmooth Convex Optimization
by: Liu, Zijian, et al.
Published: (2025)

Nonsmooth Optimization with Zeroth Order Comparison Feedback
by: Bakkali, Taha El, et al.
Published: (2026)

Subgradient Gliding Method for Nonsmooth Convex Optimization
by: Zhu, Zhihan, et al.
Published: (2026)

Subgame Perfect Methods in Nonsmooth Convex Optimization
by: Grimmer, Benjamin, et al.
Published: (2025)

The Stochastic Multi-Proximal Method for Nonsmooth Optimization
by: Condat, Laurent, et al.
Published: (2025)

New Outer Approximation Algorithms for Nonsmooth Convex MINLP Problems
by: Wei, Zhou, et al.
Published: (2026)

Improved Sample Complexity for Private Nonsmooth Nonconvex Optimization
by: Kornowski, Guy, et al.
Published: (2024)

A Single-loop Stochastic Riemannian ADMM for Nonsmooth Optimization
by: Jin, Jiachen, et al.
Published: (2025)

A Hybrid Subgradient Method for Nonsmooth Nonconvex Bilevel Optimization
by: Xiao, Nachuan, et al.
Published: (2025)

A Newton-Like Dynamical System for Nonsmooth and Nonconvex Optimization
by: Garrido, Juan Guillermo, et al.
Published: (2024)

Online Optimization with Unknown Time-Varying Parameters from Noisy Gradient Measurements
by: Tripathi, Shivanshu, et al.
Published: (2026)

Second-Order Subdifferential Optimality Conditions in Nonsmooth Optimization
by: Khanh, Pham Duy, et al.
Published: (2023)