Unverified50% confidenceFactExact time
The 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.
1
Sources
50%
Confidence
Long-term
Relevance
10/22/2026
First Seen
Sources
Related Entities
Related Claims
Unverified线性规划的主流求解方法包括单纯形法和内点法72% 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).71% similarUnverifiedThe mathematical form of linear programming is the maximization or minimization of a linear objective function subject to a set of linear inequality constraints.70% similarUnverified线性表示假说认为概念以近似线性方式编码在向量空间中，可用向量运算操控语义70% similarUnverifiedPreviously, 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.68% similar
Cite This Claim
Stable URI
https://kongchang.com/claim/1084378API
curl https://kongchang.com/api/v1/knowledge/claims/1084378MCP
get_claim(id=1084378)