Research map / Optimization / Nonconvex and smooth optimization
On Constraints in First-Order Optimization: A View from Non-Smooth Dynamical Systems
Michael Muehlebach, Michael I. Jordan
Read the paperCheck your idea against 137,217 papers
AI-extracted summary. Written by AI from the paper's title only (no summary yet). Numbers and claims can be wrong or missing context, so check the paper before you cite or build on it.
Closest papers by meaning
- A Richer Theory of Convex Constrained Optimization with Reduced Projections and Improved Rates (ICML 2017 · similarity 0.90)
- Efficiently Escaping Saddle Points under Generalized Smoothness via Self-Bounding Regularity (NeurIPS 2025 · similarity 0.89)
- Breaking the Convergence Barrier: Optimization via Fixed-Time Convergent Flows (AAAI 2022 · similarity 0.89)
- Directional Smoothness and Gradient Methods: Convergence and Adaptivity (NeurIPS 2024 · similarity 0.89)
- Adaptive and Optimal Second-order Optimistic Methods for Minimax Optimization (NeurIPS 2024 · similarity 0.88)
- Revisiting Frank-Wolfe for Structured Nonconvex Optimization (NeurIPS 2025 · similarity 0.88)
Writing a paper in this area? scime draft is a free LaTeX editor with AI included, real-time co-authors and a check of your references and venue rules before you submit. It also imports OpenAI Prism projects.
