On the Complexity of Detecting Convexity over a Box

06/16/2018
by   Amir Ali Ahmadi, et al.
0

It has recently been shown that the problem of testing global convexity of polynomials of degree four is strongly NP-hard, answering an open question of N.Z. Shor. This result is minimal in the degree of the polynomial when global convexity is of concern. In a number of applications however, one is interested in testing convexity only over a compact region, most commonly a box (i.e., hyper-rectangle). In this paper, we show that this problem is also strongly NP-hard, in fact for polynomials of degree as low as three. This result is minimal in the degree of the polynomial and in some sense justifies why convexity detection in nonlinear optimization solvers is limited to quadratic functions or functions with special structure. As a byproduct, our proof shows that the problem of testing whether all matrices in an interval family are positive semidefinite is strongly NP-hard. This problem, which was previously shown to be (weakly) NP-hard by Nemirovski, is of independent interest in the theory of robust control.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
03/20/2018

On the Complexity of Testing Attainment of the Optimal Value in Nonlinear Optimization

We prove that unless P=NP, there exists no polynomial time (or even pseu...
research
04/30/2023

The iteration time and the general position number in graph convexities

In this paper, we study two graph convexity parameters: iteration time a...
research
06/13/2020

Special-case Algorithms for Blackbox Radical Membership, Nullstellensatz and Transcendence Degree

Radical membership testing, and the special case of Hilbert's Nullstelle...
research
11/06/2019

Exact Partitioning of High-order Models with a Novel Convex Tensor Cone Relaxation

In this paper we propose the first correct poly-time algorithm for exact...
research
01/28/2018

Algebraic dependencies and PSPACE algorithms in approximative complexity

Testing whether a set f of polynomials has an algebraic dependence is a ...
research
11/01/2017

Inapproximability of the independent set polynomial in the complex plane

We study the complexity of approximating the independent set polynomial ...

Please sign up or login with your details

Forgot password? Click here to reset