Research map / Optimization / Nonconvex and smooth optimization
A Generalized Method for Binary Optimization: Convergence Analysis and Applications
Huan Xiong, Mengyang Yu, Li Liu, Fan Zhu, Jie Qin, Fumin Shen, Ling Shao
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 Matrix Splitting Method for Composite Function Minimization (CVPR 2017 · similarity 0.86)
- Large-Scale Binary Quadratic Optimization Using Semidefinite Relaxation and Applications (TPAMI 2016 · similarity 0.86)
- Convergence of Alternating Gradient Descent for Matrix Factorization (NeurIPS 2023 · similarity 0.86)
- A Fast Binary Quadratic Programming Solver Based on Stochastic Neighborhood Search (TPAMI 2020 · similarity 0.86)
- Moreau Envelope for Nonconvex Bi-Level Optimization: A Single-Loop and Hessian-Free Solution Strategy (ICML 2024 · similarity 0.85)
- Constrained Bi-Level Optimization: Proximal Lagrangian Value Function Approach and Hessian-free Algorithm (ICLR 2024 · similarity 0.84)
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.
