Establishes exponential upper bound on handicap of sufficient matrices and a rescaling-optimized algorithm for LCPs using ellipsoid method over convex set of near-optimal scalings.
Title resolution pending
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
fields
math.OC 1years
2026 1verdicts
UNVERDICTED 1representative citing papers
citing papers explorer
-
Handicap reduction for linear complementarity problems
Establishes exponential upper bound on handicap of sufficient matrices and a rescaling-optimized algorithm for LCPs using ellipsoid method over convex set of near-optimal scalings.