Cover Image

Goldstein Stationarity in Lipschitz Constrained Optimization

Fuente: arXiv

Saved in:

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

Similar Items

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

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)

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

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

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

Composing Optimized Stepsize Schedules 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)

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

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

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

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

The Geometry of Constrained Optimization: Constrained Gradient Flows via Reparameterization: A-Stable Implicit Schemes, KKT from Stationarity, and Geometry-Respecting Algorithms
by: Leplat, Valentin
Published: (2025)

Lipschitz minimization and the Goldstein modulus
by: Kong, Siyu, et al.
Published: (2024)

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

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)

H-invariance theory: A complete characterization of minimax optimal fixed-point algorithms
by: Yoon, TaeHo, et al.
Published: (2025)

Optimization-based Constrained Funnel Synthesis for Systems with Lipschitz Nonlinearities via Numerical Optimal Control
by: Kim, Taewan, et al.
Published: (2023)

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

An Elementary Proof of the Near Optimality of LogSumExp Smoothing
by: Samakhoana, Thabo, et al.
Published: (2025)

Some New Insights from Highly Optimized Polyhedral Passages
by: Gosain, Raj, et al.
Published: (2025)

Testing Approximate Stationarity Concepts for Piecewise Affine Functions
by: Tian, Lai, et al.
Published: (2025)

Achieving Directional-Stationarity from a Single Random Direction Step
by: Greenstein, Dan, et al.
Published: (2026)

Piecewise M-Stationarity and Related Algorithms for Mathematical Programs with Complementarity Constraints
by: Wang, Kexin, et al.
Published: (2026)

Adaptive Algorithms for Relatively Lipschitz Continuous Convex Optimization Problems
by: Stonyakin, Fedor, et al.
Published: (2021)

Learning to Adapt: In-Context Learning Beyond Stationarity
by: Qin, Zhen, et al.
Published: (2026)

LIPO+: Frugal Global Optimization for Lipschitz Functions
by: Serré, Gaëtan, et al.
Published: (2024)

Trust Region Methods For Nonconvex Stochastic Optimization Beyond Lipschitz Smoothness
by: Xie, Chenghan, et al.
Published: (2023)

An Adaptive Smoothing Algorithm for Non-Lipschitz Optimization on Manifolds with Complexity Guarantees
by: Wang, Lei, et al.
Published: (2026)

Lipschitz-Free Mirror Descent Methods for Non-Smooth Optimization Problems
by: Yuan, Bowen, et al.
Published: (2025)

Nearly Optimal $L_p$ Risk Minimization
by: Jia, Zhichao, et al.
Published: (2024)

Convergence analysis of nonmonotone proximal gradient methods under local Lipschitz continuity and Kurdyka--Łojasiewicz property
by: Jia, Xiaoxi, et al.
Published: (2024)

Revisiting Randomized Smoothing: Nonsmooth Nonconvex Optimization Beyond Global Lipschitz Continuity
by: Xia, Jingfan, et al.
Published: (2025)

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

On Averaging and Extrapolation for Gradient Descent
by: Luner, Alan, et al.
Published: (2024)

Spurious Stationarity and Hardness Results for Bregman Proximal-Type Algorithms
by: Chen, He, et al.
Published: (2024)

$γ$-Competitiveness: An Approach to Multi-Objective Optimization with High Computation Costs in Lipschitz Functions
by: Latypov, Ilgam, et al.
Published: (2024)

First-Order Algorithms Without Lipschitz Gradient: A Sequential Local Optimization Approach
by: Zhang, Junyu, et al.
Published: (2020)