# On the complexity of finding a local minimizer of a quadratic function over a polytope

@article{Ahmadi2022OnTC, title={On the complexity of finding a local minimizer of a quadratic function over a polytope}, author={Amir Ali Ahmadi and Jeffrey O. Zhang}, journal={Mathematical Programming}, year={2022}, pages={1-10} }

We show that unless P=NP, there cannot be a polynomial-time algorithm that finds a point within Euclidean distance $$c^n$$ c n (for any constant $$c \ge 0$$ c ≥ 0 ) of a local minimizer of an n -variate quadratic function over a polytope. This result (even with $$c=0$$ c = 0 ) answers a question of Pardalos and Vavasis that appeared in 1992 on a list of seven open problems in complexity theory for numerical optimization. Our proof technique also implies that the problem of deciding whether a…

## 10 Citations

### The complexity of gradient descent: CLS = PPAD ∩ PLS

- MathematicsSTOC
- 2021

It is shown that computing a Karush-Kuhn-Tucker point of a continuously differentiable function over the domain [0,1]2 is PPAD ∩ PLS-complete, which is the first natural problem to be shown complete for this class.

### The Complexity of Gradient Descent: CLS = PPAD $\cap$ PLS

- Mathematics
- 2020

It is shown that computing a Karush-Kuhn-Tucker (KKT) point of a continuously differentiable function over the domain [0, 1] is PPAD∩PLS-complete, the first natural problem to be shown complete for this class.

### The Complexity of Gradient Descent: CLS = PPAD ∩ PLS

- MathematicsJournal of the ACM
- 2022

We study search problems that can be solved by performing Gradient Descent on a bounded convex polytopal domain and show that this class is equal to the intersection of two well-known classes: PPAD…

### Computing D-Stationary Points of ρ-Margin Loss SVM

- Computer ScienceAISTATS
- 2022

This paper proposes a highly eﬃcient nonconvex semi-proximal ADMM-based scheme that provably computes d-stationary points and enjoys a local linear convergence rate and reports concrete examples to demonstrate the necessity of the assumptions.

### Polynomial-time sparse measure recovery

- Computer ScienceArXiv
- 2022

This work proposes the ﬁrst poly-time recovery method from carefully designed moments that only requires O(log(1 /( cid:15) ) /(cid: 15) 2 ) computations for (cid):15) -accurate recovery.

### Sum-of-Squares Program and Safe Learning On Maximizing the Region of Attraction of Partially Unknown Systems

- Computer Science, Mathematics2022 13th Asian Control Conference (ASCC)
- 2022

This paper approximates the partially unknown nonlinear systems by using a learned state space with Gaussian Processes and Chebyshev interpolants, and a Sum-of-Squares Programming based approach is proposed to synthesize a controller by searching an optimal control Lyapunov barrier function.

### Finite Convergence of Sum-of-Squares Hierarchies for the Stability Number of a Graph

- MathematicsSIAM J. Optim.
- 2022

We investigate a hierarchy of semidefinite bounds θ(G) for the stability number α(G) of a graph G, based on its copositive programming formulation and introduced by de Klerk and Pasechnik [SIAM J.…

### The Application of Fuzzification for Solving Quadratic Functions

- Computer Science
- 2021

This paper describes an approximation algorithm for solving standard quadratic optimization problems(StQPs) over the standard simplex by using fuzzification technique. We show that the approximate…

### On the rate of convergence of the Difference-of-Convex Algorithm (DCA)

- Mathematics, Computer Science
- 2021

A new linear convergence rate result is derived for the DCA under the assumption of the Polyak- Lojasiewicz inequality, and the novel aspect of the analysis is that it employs semideﬁnite programming performance estimation.

## References

SHOWING 1-10 OF 17 REFERENCES

### Some NP-complete problems in quadratic and nonlinear programming

- Computer Science, MathematicsMath. Program.
- 1987

A special class of indefinite quadratic programs is constructed, with simple constraints and integer data, and it is shown that checking (a) or (b) on this class is NP-complete.

### Approximation of the Stability Number of a Graph via Copositive Programming

- Mathematics, Computer ScienceSIAM J. Optim.
- 2002

This paper shows how the stability number can be computed as the solution of a conic linear program (LP) over the cone of copositive matrices of a graph by solving semidefinite programs (SDPs) of increasing size (lift-and-project method).

### SIGACT News Complexity Theory Column 76: an atypical survey of typical-case heuristic algorithms

- BusinessSIGA
- 2012

This article first discusses how a series of results by Berman, Buhrman, Hartmanis, Homer, Longpré, Ogiwara, Schöning, and Watanabe, from the early 1970s through the early 1990s limited how well heuristic algorithms can do on NP-hard problems.

### Maxima for Graphs and a New Proof of a Theorem of Turán

- MathematicsCanadian Journal of Mathematics
- 1965

Maximum of a square-free quadratic form on a simplex. The following question was suggested by a problem of J. E. MacDonald Jr. (1): Given a graph G with vertices 1, 2, . . . , n. Let S be the simplex…

### On the complexity of detecting convexity over a box

- MathematicsMath. Program.
- 2020

The proof shows that the problem of testing whether all matrices in an interval family are positive semidefinite is strongly NP-hard, and in some sense justifies why convexity detection in nonlinear optimization solvers is limited to quadratic functions or functions with special structure.