An Iteratively Reweighted Method for Sparse Optimization on Nonconvex $\ell_{p}$ Ball

Documenti analoghi

• Towards An Efficient Approach for the Nonconvex $\ell_p$ Ball Projection: Algorithm and Analysis
  di: Yang, Xiangyu, et al.
  Pubblicazione: (2021)
• Alternating Iteratively Reweighted $\ell_1$ and Subspace Newton Algorithms for Nonconvex Sparse Optimization
  di: Wang, Hao, et al.
  Pubblicazione: (2024)
• Efficient Low-rank Identification via Accelerated Iteratively Reweighted Nuclear Norm Minimization
  di: Wang, Hao, et al.
  Pubblicazione: (2024)
• Near-Linear Time Projection onto the $\ell_{1,\infty}$ Ball; Application to Sparse Autoencoders
  di: Perez, Guillaume, et al.
  Pubblicazione: (2023)
• On the Convergence of Adaptive Gradient Methods for Nonconvex Optimization
  di: Zhou, Dongruo, et al.
  Pubblicazione: (2018)