A penalty-based, lifting-free dual algorithm solves quadratic sum-of-squares programs with accelerated-gradient convergence guarantees and a reported average speed advantage over SCS (NSGM 1.40) on 240 regression benchmarks.
Title resolution pending
1 Pith paper cite this work, alongside 42 external citations. Polarity classification is still indexing.
1
Pith paper citing it
42
external citations · OpenAlex
fields
math.OC 1years
2026 1verdicts
CONDITIONAL 1representative citing papers
citing papers explorer
-
Lifting-Free Quadratic Sum-Of-Squares Programming
A penalty-based, lifting-free dual algorithm solves quadratic sum-of-squares programs with accelerated-gradient convergence guarantees and a reported average speed advantage over SCS (NSGM 1.40) on 240 regression benchmarks.