Research map / Optimization / Nonconvex and smooth optimization
An Inertial Block Majorization Minimization Framework for Nonsmooth Nonconvex Optimization
Le Thi Khanh Hien, Duy Nhat Phan, Nicolas Gillis
Read the paperCheck your idea against 137,217 papers
AI-extracted. The measured effects below were read by AI from the paper's full text (no summary yet). Numbers and claims can be wrong or missing context, so check the paper before you cite or build on it.
Measured effects reported in the paper
| What was changed | Where | Measured | Effect |
|---|---|---|---|
| use a composite surrogate with closed-form block minimization instead of a proximal gradient step | TITAN · Matrix completion problem (three widely used data sets) | speed: at least 4 times faster | Improved |
Closest papers by meaning
- Inertial Block Proximal Methods for Non-Convex Non-Smooth Optimization (ICML 2020 · similarity 0.93)
- Convergence and complexity of block majorization-minimization for constrained block-Riemannian optimization (JMLR 2026 · similarity 0.89)
- Accelerated Algorithms for Constrained Nonconvex-Nonconcave Min-Max Optimization and Comonotone Inclusion (ICML 2024 · similarity 0.87)
- Double-Step Alternating Extragradient with Increasing Timescale Separation for Finding Local Minimax Points: Provable Improvements (ICML 2024 · similarity 0.86)
- A Bregman Proximal Stochastic Gradient Method with Extrapolation for Nonconvex Nonsmooth Problems (AAAI 2024 · similarity 0.86)
- Moreau Envelope for Nonconvex Bi-Level Optimization: A Single-Loop and Hessian-Free Solution Strategy (ICML 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.
