A double iteratively reweighted algorithm for solving group sparse nonconvex optimization models

Documents similaires

• A smoothed proximal trust-region algorithm for nonconvex optimization problems with $L^p$-regularization, $p\in (0,1)$
  par: Antil, Harbir, et autres
  Publié: (2025)
• Douglas--Rachford algorithm for control-constrained minimum-energy control problems
  par: Burachik, Regina S., et autres
  Publié: (2022)
• Composite Optimization with Indicator Functions: Stationary Duality and a Semismooth Newton Method
  par: Zhang, Penghe, et autres
  Publié: (2025)
• A relaxed version of Ryu's three-operator splitting method for structured nonconvex optimization
  par: Alcantara, Jan Harold, et autres
  Publié: (2025)
• Calibration for minimal surfaces with free boundary and Cheeger-type problems
  par: Bouchitté, Guy, et autres
  Publié: (2025)