In this paper, we establish hardness and approximation results for various Lp-ball constrained homogeneous polynomial optimization problems, where p ∈ [2, ∞]. Specifically, we prove that for any given ...
The field of extension complexity in combinatorial optimisation investigates the minimal structural complexity required to represent polytopes arising from optimisation problems. Central to this ...
Results that may be inaccessible to you are currently showing.
Hide inaccessible results
Feedback