arXiv:2611.25668v1 Announce Type: new Abstract: Group-penalized regression with correlated predictors requires block updates for which familiar group soft thresholding formulas are generally inapplicable. Although proximal-gradient methods can solve such updates directly, their computational cost depends on the penalty and the design. We develop a norm-equation framework for a Euclidean group penalty combined with a finite, closed, convex, positively homogeneous within-group penalty. Each nonzero block minimizer is characterized by a unique scalar root, evaluated through strongly convex inner problems without enumerating sparsity or fusion patterns. Valid inner subgradients provide computable bounds on the scalar function and the block Karush-Kuhn-Tucker (KKT) error. These bounds allow scalar-search decisions and acceptance of approximate updates without solving every inner problem to high accuracy. Accounting for gradient changes during a cyclic sweep then gives a computable global KKT bound. Combined with standard stochastic-score and restricted-curvature conditions, this bound leads to a regularization-scaled stopping rule under which approximate estimators retain the usual estimation and prediction rates. Experiments with sparse-group and fused sparse-group regression show that computational performance depends strongly on the inner solver, with coordinate-descent and dual implementations offering advantages over direct proximal methods in some highly correlated settings.