Solve one constrained chart with assembled shared-control normal equations.
A positive diagonal congruence scales the original symmetric Gram problem and
its feasible box. The original projected-gradient mapping, not a transformed
residual, determines numerical termination. Each accelerated step
projects unknown coefficients onto the declared box; objective increase
restarts momentum. No geometry is sampled or tessellated here.
Solve one constrained chart with assembled shared-control normal equations. A positive diagonal congruence scales the original symmetric Gram problem and its feasible box. The original projected-gradient mapping, not a transformed residual, determines numerical termination. Each accelerated step projects unknown coefficients onto the declared box; objective increase restarts momentum. No geometry is sampled or tessellated here.