Asymptotically Strong Dual of Smooth Nonconvex Problems: A Smooth Shapley-Folkman Perspective
math.OC
Submitted: 2026-01-26
Updated: 2026-11-03
Terminology
Sources
- Lagrangian Dual Sections: A Topological Perspective on Hidden Convexity
- Geoffrion's theorem beyond finiteness and rationality
- Gauges and Accelerated Optimization over Smooth and/or Strongly Convex Sets
Related papers
- An Accelerated Proximal Gradient Method for Bures-Wasserstein Space
- FOMTools: Development and AI-Assisted Code Generation for First-Order Methods
- Lions and Muons: Optimization via Stochastic Frank-Wolfe under Heavy-Tailed Noise
- Dynamic Service Recommendation with Congestion-Dependent Joining: Near-Optimal and Constant-Factor Approximation Algorithms
- Integrating Learning and Optimization for Open Transport Capacity Pooling under Disruption
- Zeroth-Order Gradient Estimators under Decision-Dependent Noise