Hardness and Approximation Results forLp-Ball Constrained Homogeneous Polynomial Optimization Problems
نویسندگان
چکیده
منابع مشابه
Hardness and Approximation Results for Lp-Ball Constrained Homogeneous Polynomial Optimization Problems
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 d ≥ 3 and p ∈ [2,∞], both the problem of optimizing a degree–d homogeneous polynomial over the Lp–ball and the problem of optimizing a degree–d multilinear form (regardless of its super–symmetry) o...
متن کاملDeterministic approximation algorithms for sphere constrained homogeneous polynomial optimization problems
Due to their fundamental nature and numerous applications, sphere constrained polynomial optimization problems have received a lot of attention lately. In this paper, we consider three such problems: (i) maximizing a homogeneous polynomial over the sphere; (ii) maximizing a multilinear form over a Cartesian product of spheres; and (iii) maximizing a multiquadratic form over a Cartesian product ...
متن کاملDegree-Constrained Subgraph Problems: Hardness and Approximation Results
A general instance of a Degree-Constrained Subgraph problem consists of an edge-weighted or vertex-weighted graph G and the objective is to find an optimal weighted subgraph, subject to certain degree constraints on the vertices of the subgraph. This paper considers two natural Degree-Constrained Subgraph problems and studies their behavior in terms of approximation algorithms. These problems t...
متن کاملGeneral Constrained Polynomial Optimization: an Approximation Approach
In this paper, we consider approximation algorithms for optimizing a generic multi-variate (inhomogeneous) polynomial function, subject to some fairly general constraints. The focus is on the design and analysis of polynomial-time approximation algorithms. First, we study the problem of maximizing a polynomial function over the Euclidean ball. A polynomialtime approximation algorithm is propose...
متن کاملConstrained LCS: Hardness and Approximation
The problem of finding the longest common subsequence (LCS) of two given strings A1 and A2 is a well-studied problem. The constrained longest common subsequence (C-LCS) for three strings A1, A2 and B1 is the longest common subsequence of A1 and A2 that contains B1 as a subsequence. The fastest algorithm solving the C-LCS problem has a time complexity of O(m1m2n1) where m1, m2 and n1 are the len...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Mathematics of Operations Research
سال: 2014
ISSN: 0364-765X,1526-5471
DOI: 10.1287/moor.2014.0644