An unconditional lower bound for the active-set method on the hypercube

2025-02-25

AI Summary

This paper addresses the fundamental open question of whether a polynomial-time pivot rule exists for the simplex method. We establish, for the first time, an unconditional exponential lower bound that applies to *all* pivot rules. Our core approach generalizes the simplex method to nonlinear settings: within the active-set framework, we construct an $n$-variate polynomial objective function of linear degree that forces the active-set method to visit all $2^n$ vertices of the $n$-dimensional hypercube. Leveraging tools from optimization theory, multivariate polynomial design, and combinatorial geometry, we rigorously prove that the worst-case time complexity of this construction is $Omega(2^n)$. Consequently, we obtain an unconditional exponential lower bound valid for *every* pivot rule—irrespective of specific structural assumptions. This is the first tight, rule-agnostic lower bound applicable to the entire class of pivot strategies.

Technology Category

• Constraint Satisfaction and Optimization: Other Foundations of Constraint Satisfaction
• Search and Optimization: Non-convex Optimization
• Reasoning under Uncertainty: Stochastic Optimization

Application Category

• Graph Algorithms and Modeling for the Web: Algorithms and analysis for incomplete, noisy, or partially observed Web-related graphs
• Economics, Online Markets and Human Computation: Incentives in network design for Web infrastructures and ecosystems
• Security and Privacy: Large-scale security measurements

Abstract

The existence of a polynomial-time pivot rule for the simplex method is a fundamental open question in optimization. While many super-polynomial lower bounds exist for individual or very restricted classes of pivot rules, there currently is little hope for an unconditional lower bound that addresses all pivot rules. We approach this question by considering the active-set method as a natural generalization of the simplex method to non-linear objectives. This generalization allows us to prove the first unconditional lower bound for all pivot rules. More precisely, we construct a multivariate polynomial of degree linear in the number of dimensions such that the active-set method started in the origin visits all vertices of the hypercube. We hope that our framework serves as a starting point for a new angle of approach to understanding the complexity of the simplex method.

Problem

• Unconditional lower bound for active-set method
• Generalization of simplex method to non-linear objectives
• Complexity understanding of simplex method

Innovation

• proves unconditional lower bound
• generalizes simplex method
• uses multivariate polynomial construction