Cover Image

Subgame Perfect Methods in Nonsmooth Convex Optimization

Fuente: arXiv

Saved in:

Bibliographic Details
Main Authors:	Grimmer, Benjamin, Wang, Alex L.
Format:	Preprint
Published:	2025
Subjects:	Optimization and Control
Online Access:	Acceder al recurso
Tags:	Add Tag No Tags, Be the first to tag this record!

Similar Items

Beyond Minimax Optimality: A Subgame Perfect Gradient Method
by: Grimmer, Benjamin, et al.
Published: (2024)

A Practical Adaptive Subgame Perfect Gradient Method
by: Luner, Alan, et al.
Published: (2025)

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

Lower Bounds for Linear Minimization Oracle Methods Optimizing over Strongly Convex Sets
by: Grimmer, Benjamin, et al.
Published: (2026)

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

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

The Optimal Smoothings of Sublinear Functions and Convex Cones
by: Samakhoana, Thabo, et al.
Published: (2025)

Composing Optimized Stepsize Schedules for Gradient Descent
by: Grimmer, Benjamin, et al.
Published: (2024)

Inexactly Smooth Performance Estimation and New Optimized Gradient Methods
by: Zoll, Aaron, et al.
Published: (2026)

Scalable Projection-Free Optimization Methods via MultiRadial Duality Theory
by: Samakhoana, Thabo, et al.
Published: (2024)

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

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

Subgradient Methods for Nonsmooth Convex Functions with Adversarial Errors
by: Gösgens, Martijn, et al.
Published: (2025)

Goldstein Stationarity in Lipschitz Constrained Optimization
by: Grimmer, Benjamin, et al.
Published: (2023)

Accelerated Objective Gap and Gradient Norm Convergence for Gradient Descent via Long Steps
by: Grimmer, Benjamin, et al.
Published: (2024)

A Strengthened Conjecture on the Minimax Optimal Constant Stepsize for Gradient Descent
by: Grimmer, Benjamin, et al.
Published: (2024)

Some Unified Theory for Variance Reduced Prox-Linear Methods
by: Wu, Yue, et al.
Published: (2024)

A Universally Optimal Primal-Dual Method for Minimizing Heterogeneous Compositions
by: Zoll, Aaron, et al.
Published: (2025)

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

Gauges and Accelerated Optimization over Smooth and/or Strongly Convex Sets
by: Liu, Ning, et al.
Published: (2023)

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

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

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

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

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

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

A Parameter-Free Restart Scheme with Only a Parallelizable $\log\log(1/ε)$ Overhead
by: Wu, Yue, et al.
Published: (2026)

Clipped Gradient Methods for Nonsmooth Convex Optimization under Heavy-Tailed Noise: A Refined Analysis
by: Liu, Zijian
Published: (2025)

Performance Estimation for Smooth and Strongly Convex Sets
by: Luner, Alan, et al.
Published: (2024)

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

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

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

Coderivative-Based Newton Methods with Wolfe Linesearch for Nonsmooth Optimization
by: Chao, Miantao, et al.
Published: (2024)

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

Coderivative-Based Newton Methods in Structured Nonconvex and Nonsmooth Optimization
by: Khanh, Pham Duy, et al.
Published: (2024)

Provably Faster Gradient Descent via Long Steps
by: Grimmer, Benjamin
Published: (2023)

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

An Adaptive Proximal Point Method for Nonsmooth and Nonconvex Optimization on Hadamard Manifolds
by: Amaral, Vitaliano S., et al.
Published: (2025)

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

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