An Inertial Block Proximal Linearized Method with Adaptive Momentum for Nonconvex and Nonsmooth Optimization

arXiv:2608.05502 · math.OC, cs.LG · Submitted 2026-08-06 · Read on arXiv

Weifeng Yang

math.OC, cs.LG

Submitted: 2026-08-06

Code: https://github.com/Weifeng-Yang/IBPL

Project page: https://jundongl.github.io/scikit-feature

License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/

Terminology

• Objective Function — 9× in this paper · explained in 2 episodes
• Sparsity — 4× in this paper · explained in 5 episodes
• Benchmark — 3× in this paper · explained in 2 episodes
• Consistency — 2× in this paper · explained in 3 episodes
• Feature Selection — 2× in this paper · explained in 4 episodes
• Regularization — 2× in this paper · explained in 3 episodes
• Robustness — 2× in this paper · explained in 6 episodes
• Tucker Decomposition — 2× in this paper · explained in 2 episodes
• Adam — 1× in this paper · explained in 3 episodes
• Clustering — 1× in this paper · explained in 2 episodes
• Convergence Guarantees — 1× in this paper · explained in 3 episodes
• Core — 1× in this paper · explained in 2 episodes
• Cosine Similarity — 1× in this paper · explained in 3 episodes
• Dimensionality Reduction — 1× in this paper · explained in 2 episodes
• Generalization — 1× in this paper · explained in 14 episodes
• Papers — 1× in this paper · explained in 3 episodes
• Proximal Alternating Minimization — 1× in this paper

Sources

• An Accelerated Block Proximal Framework with Adaptive Momentum for Nonconvex and Nonsmooth Optimization

Related papers

• Lions and Muons: Optimization via Stochastic Frank-Wolfe under Heavy-Tailed Noise
• Adam-HNAG: A Convergent Reformulation of Adam with Accelerated Rate
• Incremental Learning in Mirror Flows
• Beyond Aggregate Drift: Optimal Client-Specific Windows in Federated Learning
• Lower Bounds for Randomized Linear-Oracle Optimization over Strongly Convex Sets
• Second-Order Optimization with Asynchronous Curvature