Inhomogeneous polynomial optimization over a convex set: An approximation approach
نویسندگان
چکیده
منابع مشابه
Inhomogeneous polynomial optimization over a convex set: An approximation approach
In this paper, we consider computational methods for optimizing a multivariate inhomogeneous polynomial function over a general convex set. The focus is on the design and analysis of polynomial-time approximation algorithms. The methods are able to deal with optimization models with polynomial objective functions in any fixed degrees. In particular, we first study the problem of maximizing an i...
متن کاملApproximation Methods for Inhomogeneous Polynomial Optimization
In this paper, we consider computational methods for optimizing a multivariate inhomogeneous polynomial function over a compact set. The focus is on the design and analysis of polynomial-time approximation algorithms. The references on approximation algorithms for inhomogeneous polynomial optimization problems are extremely scarce in the literature. To the best of our knowledge, the only result...
متن کامل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...
متن کاملConvex polynomial approximation
Estimating the degree of approximation in the uniform norm, of a convex function on a finite interval, by convex algebraic polynomials, has received wide attention over the last twenty years. However, while much progress has been made especially in recent years by, among others, the authors of this article, separately and jointly, there have been left some interesting open questions. In this pa...
متن کاملProbabilistic Algorithm for Polynomial Optimization over a Real Algebraic Set
Let f, f1, . . . , fs be n-variate polynomials with rational coefficients of maximum degree D and let V be the set of common complex solutions of F = (f1, . . . , fs). We give an algorithm which, up to some regularity assumptions on F, computes an exact representation of the global infimum f? of the restriction of the map x → f (x) to V ∩ Rn, i.e. a univariate polynomial vanishing at f? and an ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Mathematics of Computation
سال: 2014
ISSN: 0025-5718,1088-6842
DOI: 10.1090/s0025-5718-2014-02875-5