Smooth or Separable? Sparse Block Acceleration for Entropy-Regularized Linear Programs SGQS629QNK

URI	`m2://res/SGQS629QNK`
Kind	preprint
Creators	Irina Podlipnova, Maxim Mashtaler, Artem Agafonov, Yuriy Dorn, Alexander Gasnikov
Date	2026-09-26
MSC	49-XX, 90-XX, 93-XX
Subjects	arxiv math.OC
Scope	in

Expressions

The mentions of the inventory that name this resource. Each name links to the card of its inventory row.

Item	Kind	Where	Source
Exact link	statement	proposition 2.1	arxiv
A coordinate self-bound	statement	lemma H.1	arxiv
Bounds from strict feasibility	statement	proposition J.1	arxiv
$\nu_B$ is optimal up to $\theta$	statement	proposition B.1	arxiv
GRN on the LSE dual	statement	proposition E.1	arxiv
Range--moment bound for signed rows	statement	corollary 3.2	arxiv
Balanced incidence family	statement	proposition I.4	arxiv
One accelerated phase	statement	theorem 4.2	arxiv
Pre-sampling block model	statement	lemma 4.1	arxiv
Restarted ACD	statement	proposition L.1	arxiv
Effective dimension and its crossover	statement	proposition I.1	arxiv
Accuracy and growth contributions	statement	proposition I.3	arxiv
Localized gap and its budget	statement	proposition B.2	arxiv
Exact constants for scaled indicator rows	statement	corollary I.2	arxiv
The SE dual is quasi-self-concordant	statement	proposition 5.2	arxiv
Explicit local radius	statement	lemma H.2	arxiv
Weight admissible under the cancellation identity	statement	proposition B.3	arxiv
Sparse arithmetic work	statement	theorem 4.3	arxiv
Entropy Hessian--gap domination	statement	theorem 3.1	arxiv
Gradient-sensitive square-root aggregation	statement	lemma L.2	arxiv
Global LSE geometry	statement	theorem 5.1	arxiv