Research map / Optimization / Nonconvex and smooth optimization
An Inexact Projected Regularized Newton Method for Fused Zero-norms Regularization Problems
Yuqia Wu, Shaohua Pan, Xiaoqi Yang
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
- Modular Proximal Optimization for Multidimensional Total-Variation Regularization (JMLR 2018 · similarity 0.88)
- An Alternating Proximal Splitting Method with Global Convergence for Nonconvex Structured Sparsity Optimization (AAAI 2016 · similarity 0.87)
- Semismooth Newton Algorithm for Efficient Projections onto $\ell_1, ∞$-norm Ball (ICML 2020 · similarity 0.87)
- Inexact Newton-type Methods for Optimisation with Nonnegativity Constraints (ICML 2024 · similarity 0.86)
- Split LBI: An Iterative Regularization Path with Structural Sparsity (NeurIPS 2016 · similarity 0.86)
- A Regularized Newton Method for Nonconvex Optimization with Global and Local Complexity Guarantees (NeurIPS 2025 · 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.
