% Key papers for Nonconvex minimax and constrained methods (scime atlas, https://atlas.scime.ai). Authors are not included: add them from the paper pages.

@inproceedings{neurips2018_stochastic_57653,
  title = {{Stochastic Cubic Regularization for Fast Nonconvex Optimization}},
  booktitle = {Advances in Neural Information Processing Systems (NeurIPS)},
  year = {2018},
  url = {https://nips.cc/virtual/2018/poster/11296},
}

@inproceedings{neurips2018_natasha_57415,
  title = {{Natasha 2: Faster Non-Convex Optimization Than SGD}},
  booktitle = {Advances in Neural Information Processing Systems (NeurIPS)},
  year = {2018},
  url = {https://nips.cc/virtual/2018/poster/11275},
}

@inproceedings{neurips2019_efficient_58183,
  title = {{Efficient Algorithms for Smooth Minimax Optimization}},
  booktitle = {Advances in Neural Information Processing Systems (NeurIPS)},
  year = {2019},
  url = {https://nips.cc/virtual/2019/poster/14219},
}

@inproceedings{neurips2018_neon2_57414,
  title = {{NEON2: Finding Local Minima via First-Order Oracles}},
  booktitle = {Advances in Neural Information Processing Systems (NeurIPS)},
  year = {2018},
  url = {https://nips.cc/virtual/2018/poster/11371},
}

@inproceedings{neurips2016_tight_56052,
  title = {{Tight Complexity Bounds for Optimizing Composite Objectives}},
  booktitle = {Advances in Neural Information Processing Systems (NeurIPS)},
  year = {2016},
  url = {https://nips.cc/virtual/2016/poster/7264},
}

@inproceedings{neurips2020_stochastic_60883,
  title = {{Stochastic Recursive Gradient Descent Ascent for Stochastic Nonconvex-Strongly-Concave Minimax Problems}},
  booktitle = {Advances in Neural Information Processing Systems (NeurIPS)},
  year = {2020},
  url = {https://nips.cc/virtual/2020/poster/17610},
}

@inproceedings{icml2019_alternating_37150,
  title = {{Alternating Minimizations Converge to Second-Order Optimal Solutions}},
  booktitle = {International Conference on Machine Learning (ICML)},
  year = {2019},
  url = {https://icml.cc/virtual/2019/poster/3745},
}

@inproceedings{icml2017_natasha_36300,
  title = {{Natasha: Faster Non-Convex Stochastic Optimization via Strongly Non-Convex Parameter}},
  booktitle = {International Conference on Machine Learning (ICML)},
  year = {2017},
  url = {https://icml.cc/virtual/2017/poster/594},
}

@inproceedings{neurips2016_nestt_55888,
  title = {{NESTT: A Nonconvex Primal-Dual Splitting Method for Distributed and Stochastic Optimization}},
  booktitle = {Advances in Neural Information Processing Systems (NeurIPS)},
  year = {2016},
  url = {https://nips.cc/virtual/2016/poster/7062},
}

@inproceedings{icml2017_convex_36465,
  title = {{“Convex Until Proven Guilty”: Dimension-Free Acceleration of Gradient Descent on Non-Convex Functions}},
  booktitle = {International Conference on Machine Learning (ICML)},
  year = {2017},
  url = {https://icml.cc/virtual/2017/poster/831},
}

@inproceedings{icml2017_stochastic_36409,
  title = {{Stochastic Convex Optimization: Faster Local Growth Implies Faster Global Convergence}},
  booktitle = {International Conference on Machine Learning (ICML)},
  year = {2017},
  url = {https://icml.cc/virtual/2017/poster/505},
}

@inproceedings{neurips2019_an_57891,
  title = {{An  Inexact Augmented Lagrangian Framework for Nonconvex Optimization with Nonlinear Constraints}},
  booktitle = {Advances in Neural Information Processing Systems (NeurIPS)},
  year = {2019},
  url = {https://nips.cc/virtual/2019/poster/14323},
}

@inproceedings{icml2016_on_35928,
  title = {{On the Iteration Complexity of Oblivious First-Order Optimization Algorithms}},
  booktitle = {International Conference on Machine Learning (ICML)},
  year = {2016},
  url = {https://proceedings.mlr.press/v48/arjevani16.html},
}

@inproceedings{icml2019_faster_37366,
  title = {{Faster Stochastic Alternating Direction Method of Multipliers for Nonconvex Optimization}},
  booktitle = {International Conference on Machine Learning (ICML)},
  year = {2019},
  url = {https://icml.cc/virtual/2019/poster/3615},
}

@inproceedings{icml2019_lower_37523,
  title = {{Lower Bounds for Smooth Nonconvex Finite-Sum Optimization}},
  booktitle = {International Conference on Machine Learning (ICML)},
  year = {2019},
  url = {https://icml.cc/virtual/2019/poster/4168},
}

@inproceedings{neurips2018_global_57176,
  title = {{Global Convergence of Langevin Dynamics Based Algorithms for Nonconvex Optimization}},
  booktitle = {Advances in Neural Information Processing Systems (NeurIPS)},
  year = {2018},
  url = {https://nips.cc/virtual/2018/poster/11317},
}

@inproceedings{neurips2020_improved_60052,
  title = {{Improved Algorithms for Convex-Concave Minimax Optimization}},
  booktitle = {Advances in Neural Information Processing Systems (NeurIPS)},
  year = {2020},
  url = {https://nips.cc/virtual/2020/poster/17359},
}

@inproceedings{icml2018_gradient_36723,
  title = {{Gradient Primal-Dual Algorithm Converges to Second-Order Stationary Solution for Nonconvex Distributed Optimization Over Networks}},
  booktitle = {International Conference on Machine Learning (ICML)},
  year = {2018},
  url = {https://icml.cc/virtual/2018/poster/2156},
}

@inproceedings{icml2016_faster_35843,
  title = {{Faster Convex Optimization: Simulated Annealing with an Efficient Universal Barrier}},
  booktitle = {International Conference on Machine Learning (ICML)},
  year = {2016},
  url = {https://proceedings.mlr.press/v48/abernethy16.html},
}

@inproceedings{icml2020_the_38840,
  title = {{The Complexity of Finding Stationary Points with Stochastic Gradient Descent}},
  booktitle = {International Conference on Machine Learning (ICML)},
  year = {2020},
  url = {https://icml.cc/virtual/2020/poster/5821},
}

@inproceedings{aaai2025_improved_9520,
  title = {{Improved Rates of Differentially Private Nonconvex-Strongly-Concave Minimax Optimization}},
  booktitle = {AAAI Conference on Artificial Intelligence (AAAI)},
  year = {2025},
  url = {https://ojs.aaai.org/index.php/AAAI/article/view/34410},
}

@inproceedings{aaai2024_decentralized_5611,
  title = {{Decentralized Gradient-Free Methods for Stochastic Non-smooth Non-convex Optimization}},
  booktitle = {AAAI Conference on Artificial Intelligence (AAAI)},
  year = {2024},
  url = {https://ojs.aaai.org/index.php/AAAI/article/view/29697},
}

@inproceedings{aaai2024_minibatch_6641,
  title = {{Minibatch Stochastic Three Points Method for Unconstrained Smooth Minimization}},
  booktitle = {AAAI Conference on Artificial Intelligence (AAAI)},
  year = {2024},
  url = {https://ojs.aaai.org/index.php/AAAI/article/view/30016},
}

@inproceedings{aaai2025_decentralized_8658,
  title = {{Decentralized Projected Riemannian Stochastic Recursive Momentum Method for Nonconvex Optimization}},
  booktitle = {AAAI Conference on Artificial Intelligence (AAAI)},
  year = {2025},
  url = {https://ojs.aaai.org/index.php/AAAI/article/view/33218},
}

@inproceedings{icml2024_barrier_45584,
  title = {{Barrier Algorithms for Constrained Non-Convex Optimization}},
  booktitle = {International Conference on Machine Learning (ICML)},
  year = {2024},
  url = {https://icml.cc/virtual/2024/poster/32868},
}

@inproceedings{neurips2024_private_70788,
  title = {{Private Algorithms for Stochastic Saddle Points and Variational Inequalities: Beyond Euclidean Geometry}},
  booktitle = {Advances in Neural Information Processing Systems (NeurIPS)},
  year = {2024},
  url = {https://neurips.cc/virtual/2024/poster/96341},
}

@inproceedings{neurips2024_achieving_71913,
  title = {{Achieving Near-Optimal Convergence for Distributed Minimax Optimization with Adaptive Stepsizes}},
  booktitle = {Advances in Neural Information Processing Systems (NeurIPS)},
  year = {2024},
  url = {https://neurips.cc/virtual/2024/poster/95391},
}

@inproceedings{neurips2024_stochastic_73518,
  title = {{Stochastic Zeroth-Order Optimization under Strongly Convexity and Lipschitz Hessian: Minimax Sample Complexity}},
  booktitle = {Advances in Neural Information Processing Systems (NeurIPS)},
  year = {2024},
  url = {https://neurips.cc/virtual/2024/poster/93959},
}

@inproceedings{neurips2025_adaptive_79109,
  title = {{Adaptive Riemannian ADMM for Nonsmooth Optimization: Optimal Complexity without Smoothing}},
  booktitle = {Advances in Neural Information Processing Systems (NeurIPS)},
  year = {2025},
  url = {https://openreview.net/forum?id=lni933mlvF},
}

@inproceedings{iclr2024_private_34125,
  title = {{Private Zeroth-Order Nonsmooth Nonconvex Optimization}},
  booktitle = {International Conference on Learning Representations (ICLR)},
  year = {2024},
  url = {https://iclr.cc/virtual/2024/poster/18950},
}

@inproceedings{icml2024_an_44332,
  title = {{An Online Optimization Perspective on First-Order and Zero-Order Decentralized Nonsmooth Nonconvex Stochastic Optimization}},
  booktitle = {International Conference on Machine Learning (ICML)},
  year = {2024},
  url = {https://icml.cc/virtual/2024/poster/34120},
}

@inproceedings{icml2024_dealing_44401,
  title = {{Dealing With Unbounded Gradients in Stochastic Saddle-point Optimization}},
  booktitle = {International Conference on Machine Learning (ICML)},
  year = {2024},
  url = {https://icml.cc/virtual/2024/poster/34051},
}

@inproceedings{icml2024_on_45245,
  title = {{On the Complexity of Finite-Sum Smooth Optimization under the Polyak–Łojasiewicz Condition}},
  booktitle = {International Conference on Machine Learning (ICML)},
  year = {2024},
  url = {https://icml.cc/virtual/2024/poster/33207},
}

@inproceedings{icml2025_on_48952,
  title = {{On Linear Convergence in Smooth Convex-Concave Bilinearly-Coupled Saddle-Point Optimization: Lower Bounds and Optimal Algorithms}},
  booktitle = {International Conference on Machine Learning (ICML)},
  year = {2025},
  url = {https://icml.cc/virtual/2025/poster/43671},
}

@inproceedings{icml2026_lower_49469,
  title = {{Lower Complexity Bounds for Nonconvex-Strongly-Convex Bilevel Optimization with First-Order Oracles}},
  booktitle = {International Conference on Machine Learning (ICML)},
  year = {2026},
  url = {https://openreview.net/forum?id=2m0o0Fdqu6},
}

@inproceedings{icml2026_mossp_49582,
  title = {{MoSSP: A Momentum-Based Single-Loop Stochastic Penalty Method for Nonconvex Constrained DC-regularized Optimization}},
  booktitle = {International Conference on Machine Learning (ICML)},
  year = {2026},
  url = {https://openreview.net/forum?id=3tN36gT4tB},
}

@inproceedings{icml2026_projection_50692,
  title = {{Projection-Free Algorithms for Minimax Problems}},
  booktitle = {International Conference on Machine Learning (ICML)},
  year = {2026},
  url = {https://openreview.net/forum?id=EtAwPLwiX5},
}

@inproceedings{icml2026_near_51328,
  title = {{Near-Optimal Convergence of Accelerated Gradient Methods under Generalized and \$(L\_0,L\_1)\$-Smoothness}},
  booktitle = {International Conference on Machine Learning (ICML)},
  year = {2026},
  url = {https://openreview.net/forum?id=L0T4pmqkMg},
}

@inproceedings{icml2026_finding_52369,
  title = {{Finding Stationary Points by Comparisons}},
  booktitle = {International Conference on Machine Learning (ICML)},
  year = {2026},
  url = {https://openreview.net/forum?id=VFpMpVXDJS},
}

@inproceedings{icml2026_solving_53742,
  title = {{Solving the Offline and Online Min-Max Problem of Non-smooth Submodular-Concave Functions: A Zeroth-Order Approach}},
  booktitle = {International Conference on Machine Learning (ICML)},
  year = {2026},
  url = {https://openreview.net/forum?id=iHSnH96rKH},
}