Research map / Optimization / Nonconvex and smooth optimization
A Unified Discretization Framework for Differential Equation Approach with Lyapunov Arguments for Convex Optimization
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
- Direct Runge-Kutta Discretization Achieves Acceleration (NeurIPS 2018 · similarity 0.87)
- Convergence-Rate-Matching Discretization of Accelerated Optimization Flows Through Opportunistic State-Triggered Control (NeurIPS 2019 · similarity 0.87)
- Fast Gradient-Based Methods with Exponential Rate: A Hybrid Control Framework (ICML 2018 · similarity 0.86)
- Breaking the Convergence Barrier: Optimization via Fixed-Time Convergent Flows (AAAI 2022 · similarity 0.86)
- Finite-Time Convergence in Continuous-Time Optimization (ICML 2020 · similarity 0.86)
- Decentralized Gradient-Free Methods for Stochastic Non-smooth Non-convex Optimization (AAAI 2024 · similarity 0.86)
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.