Unverified50% confidenceFactExact time
Previously, the best known algorithms for the fixed-point problem of ℓ∞ contraction maps were exponential-time algorithms based on the simplex method, or polynomial-time algorithms for special structures.
1
Sources
50%
Confidence
Long-term
Relevance
10/22/2026
First Seen
Sources
Related Entities
Related Claims
UnverifiedThe paper "A Quasipolynomial Algorithm for ℓ∞ Contractions" proposes an algorithm that can compute an ε-approximate fixed point of any non-expansive map under the d-dimensional ℓ∞ norm in quasipolynomial time.80% similarUnverifiedThe perceptron convergence theorem proves that if the data is linearly separable, the algorithm is guaranteed to find the correct classification hyperplane within a finite number of steps70% similarUnverifiedThe introduction of the monotone operator endows what might otherwise be a non-convex optimization problem with favorable mathematical structure, thereby ensuring the algorithm's computational efficiency.70% similarUnverifiedLinear programming relaxation is a standard bound-estimation technique in combinatorial optimization: after relaxing integer variables to continuous variables, the problem becomes a linear program solvable in polynomial time, and its optimal value gives an upper bound on the optimal value of the original integer problem (for maximization problems).69% similarUnverifiedThe core of the new method lies in exploiting linear structure in existing BO algorithms: under certain conditions the Gaussian process surrogate model can be transformed into a linear model, reducing computational complexity from cubic to linear or quadratic.68% similar
Cite This Claim
Stable URI
https://kongchang.com/claim/1083948API
curl https://kongchang.com/api/v1/knowledge/claims/1083948MCP
get_claim(id=1083948)