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

03/20/2018
by   Amir Ali Ahmadi, et al.
0

We prove that unless P=NP, there exists no polynomial time (or even pseudo-polynomial time) algorithm that can test whether the optimal value of a nonlinear optimization problem where the objective and constraints are given by low-degree polynomials is attained. If the degrees of these polynomials are fixed, our results along with previously-known "Frank-Wolfe type" theorems imply that exactly one of two cases can occur: either the optimal value is attained on every instance, or it is strongly NP-hard to distinguish attainment from non-attainment. We also show that testing for some well-known sufficient conditions for attainment of the optimal value, such as coercivity of the objective function and closedness and boundedness of the feasible set, is strongly NP-hard. As a byproduct, our proofs imply that testing the Archimedean property of a quadratic module is strongly NP-hard, a property that is of independent interest to the convergence of the Lasserre hierarchy. Finally, we give semidefinite programming (SDP)-based sufficient conditions for attainment of the optimal value, in particular a new characterization of coercive polynomials that lends itself to an SDP hierarchy.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
08/27/2020

Complexity Aspects of Fundamental Questions in Polynomial Optimization

In this thesis, we settle the computational complexity of some fundament...
research
06/16/2018

On the Complexity of Detecting Convexity over a Box

It has recently been shown that the problem of testing global convexity ...
research
05/12/2018

Optimal switching sequence for switched linear systems

We study a discrete optimization problem over a dynamical system that co...
research
06/23/2021

Bailouts in Financial Networks

We consider networks of banks with assets and liabilities. Some banks ma...
research
10/02/2019

Doubly-Efficient Pseudo-Deterministic Proofs

In [20] Goldwasser, Grossman and Holden introduced pseudo-deterministic ...
research
07/11/2020

On the complexity of binary polynomial optimization over acyclic hypergraphs

In this work we consider binary polynomial optimization, which is the pr...
research
11/20/2018

Minimum Guesswork with an Unreliable Oracle

We study a guessing game where Alice holds a discrete random variable X,...

Please sign up or login with your details

Forgot password? Click here to reset