Imagen de Portada

Subgradient Methods for Nonsmooth Convex Functions with Adversarial Errors

Fuente: arXiv

Guardado en:

Detalles Bibliográficos
Autores principales:	Gösgens, Martijn, Van Parys, Bart P. G.
Formato:	Preprint
Publicado:	2025
Materias:	Optimization and Control
Acceso en línea:	Acceder al recurso
Etiquetas:	Agregar Etiqueta Sin Etiquetas, Sea el primero en etiquetar este registro!

Ejemplares similares

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

Fixed-Point Delayed Subgradient Methods for Nonsmooth Convex Optimization Problems
por: Pankoon, Ontima, et al.
Publicado: (2026)

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

Stochastic Bregman Subgradient Methods for Nonsmooth Nonconvex Optimization Problems
por: Ding, Kuangyu, et al.
Publicado: (2024)

Subgradient Splitting Methods for Nonsmooth Fractional Programming with Fixed-Point Constraints
por: Prangprakhon, Mootta, et al.
Publicado: (2025)

Convergence of Decentralized Stochastic Subgradient-based Methods for Nonsmooth Nonconvex functions
por: Zhang, Siyuan, et al.
Publicado: (2024)

On the Complexity of Finding Small Subgradients in Nonsmooth Optimization
por: Kornowski, Guy, et al.
Publicado: (2022)

Policy Optimization in Robust Control: Weak Convexity and Subgradient Methods
por: Watanabe, Yuto, et al.
Publicado: (2025)

Federated Incremental Subgradient Method for Convex Bilevel Optimization Problems
por: Boontawee, Sudkobfa, et al.
Publicado: (2026)

Learning Decision-Focused Uncertainty Sets in Robust Optimization
por: Wang, Irina, et al.
Publicado: (2023)

Sparse Classification: a scalable discrete optimization perspective
por: Bertsimas, Dimitris, et al.
Publicado: (2017)

Exterior-point Optimization for Sparse and Low-rank Optimization
por: Gupta, Shuvomoy Das, et al.
Publicado: (2020)

Learning and Decision-Making with Data: Optimal Formulations and Phase Transitions
por: Bennouna, Amine, et al.
Publicado: (2021)

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

Stochastic Subgradient Methods with Guaranteed Global Stability in Nonsmooth Nonconvex Optimization
por: Xiao, Nachuan, et al.
Publicado: (2023)

Energy-optimal Timetable Design for Sustainable Metro Railway Networks
por: Gupta, Shuvomoy Das, et al.
Publicado: (2023)

Efficient Data-Driven Optimization with Noisy Data
por: Van Parys, Bart P. G.
Publicado: (2021)

From Distributional Robustness to Robust Statistics: A Confidence Sets Perspective
por: Chan, Gabriel, et al.
Publicado: (2024)

Globalized Adversarial Regret Optimization: Robust Decisions with Uncalibrated Predictions
por: Kurtz, Jannis, et al.
Publicado: (2026)

Subgradient Regularization: A Descent-Oriented Subgradient Method for Nonsmooth Optimization
por: Li, Hanyang, et al.
Publicado: (2025)

Mean Robust Optimization
por: Wang, Irina, et al.
Publicado: (2022)

Optimal Subgradient Methods for Lipschitz Convex Optimization with Error Bounds
por: Wang, Alex L.
Publicado: (2025)

New Characterizations of Nonsmooth Convex Functions via Generalized Derivatives
por: Phat, Vo Thanh
Publicado: (2026)

Some Primal-Dual Theory for Subgradient Methods for Strongly Convex Optimization
por: Grimmer, Benjamin, et al.
Publicado: (2023)

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

Penalty-Based Smoothing of Convex Nonsmooth Supremum Functions with Accelerated Inertial Dynamics
por: Adly, Samir, et al.
Publicado: (2026)

Stochastic Approximation Proximal Subgradient Method for Stochastic Convex-Concave Minimax Optimization
por: Dai, Yu-Hong, et al.
Publicado: (2024)

Projected Subgradient Ascent for Convex Maximization
por: Felzenszwalb, Pedro, et al.
Publicado: (2025)

An Inexact Proximal Framework for Nonsmooth Riemannian Difference-of-Convex Optimization
por: Jiang, Bo, et al.
Publicado: (2025)

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

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

Stochastic Optimization with Optimal Importance Sampling
por: Aolaritei, Liviu, et al.
Publicado: (2025)

Faster Stochastic ADMM for Nonsmooth Composite Convex Optimization in Hilbert Space
por: Deng, Weihua, et al.
Publicado: (2026)

A Unified Analysis on the Subgradient Upper Bounds for the Subgradient Methods Minimizing Composite Nonconvex, Nonsmooth and Non-Lipschitz Functions
por: Zhu, Daoli, et al.
Publicado: (2023)

Escaping Saddle Points for Nonsmooth Weakly Convex Functions via Perturbed Proximal Algorithms
por: Huang, Minhui, et al.
Publicado: (2021)

Locally Linear Convergence for Nonsmooth Convex Optimization via Coupled Smoothing and Momentum
por: Baghbadorani, Reza Rahimi, et al.
Publicado: (2025)

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

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

First-Order Methods for Nonsmooth Nonconvex Functional Constrained Optimization with or without Slater Points
por: Jia, Zhichao, et al.
Publicado: (2022)

The Fastest Known First-Order Method for Minimizing Twice Continuously Differentiable Smooth Strongly Convex Functions
por: Van Scoy, Bryan, et al.
Publicado: (2025)