Research map / Optimization / Nonconvex and smooth optimization
Randomized Feasibility Methods for Constrained Optimization with Adaptive Step Sizes
Read the paperCheck your idea against 108,967 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
- Step-Size Stability in Stochastic Optimization: A Theoretical Perspective (ICML 2026 · similarity 0.87)
- Adaptive and Optimal Second-order Optimistic Methods for Minimax Optimization (NeurIPS 2024 · similarity 0.87)
- Achieving Near-Optimal Convergence for Distributed Minimax Optimization with Adaptive Stepsizes (NeurIPS 2024 · similarity 0.86)
- Improved Last-Iterate Convergence of Shuffling Gradient Methods for Nonsmooth Convex Optimization (ICML 2025 · similarity 0.85)
- Random Function Descent (NeurIPS 2024 · similarity 0.85)
- An Online Adaptive Sampling Algorithm for Stochastic Difference-of-convex Optimization with Time-varying Distributions (ICML 2025 · similarity 0.85)
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.