4 problems

Gao's NP-hardness conjecture. A global optimization problem is NP-hard only if its canonical dual has no solution in ${\cal S}^+_a$.

Let $({\cal P})$ be a properly posed problem satisfying Assumption 1, let $\mathbf f$ be its load vector, and let $({\cal P}^d)$ be the associated canonical dual problem over…

Let $({\cal P})$ be a properly posed problem, and let ${\cal S}^+_c$ denote the positive canonical dual feasible set; write $\operatorname{int}{\cal S}^+_c$ for its interior. Crite…

Let $({\cal P})$ be the primal nonconvex optimization problem and let $({\cal P}^d)$ be its canonical dual problem. The canonical dual problem is called solvable when it has a solu…