A Probabilistic Symbolic Algorithm to Find the Minimum of a Polynomial Function on a Basic Closed Semialgebraic Set
نویسندگان
چکیده
We consider the problem of computing the minimum of a polynomial function g on a basic closed semialgebraic set E ⊂ R. We present a probabilistic symbolic algorithm to find a finite set of sample points of the subset E of E where the minimum of g is attained, provided that E is non-empty and has at least one compact connected component.
منابع مشابه
On the minimum of a polynomial function on a basic closed semialgebraic set and applications
We give an explicit upper bound for the algebraic degree and an explicit lower bound for the absolute value of the minimum of a polynomial function on a compact connected component of a basic closed semialgebraic set when this minimum is not zero. As an application, we obtain a lower bound for the separation of two disjoint connected components of basic closed semialgebraic sets, when at least ...
متن کاملSymbolic computation of the Duggal transform
Following the results of cite{Med}, regarding the Aluthge transform of polynomial matrices, the symbolic computation of the Duggal transform of a polynomial matrix $A$ is developed in this paper, using the polar decomposition and the singular value decomposition of $A$. Thereat, the polynomial singular value decomposition method is utilized, which is an iterative algorithm with numerical charac...
متن کاملPolynomials non-negative on strips and half-strips
An expression f = σ+ τ(x− x) is an immediate witness to the positivity condition on f . In general, one wants to characterize polynomials f which are positive, or nonnegative, on a semialgebraic set K ⊆ R in terms of sums of squares and the polynomials used to define K. Representation theorems of this type have a long and illustrious history, going back at least to Hilbert. There has been much ...
متن کاملThe Minimum Universal Cost Flow in an Infeasible Flow Network
In this paper the concept of the Minimum Universal Cost Flow (MUCF) for an infeasible flow network is introduced. A new mathematical model in which the objective function includes the total costs of changing arc capacities and sending flow is built and analyzed. A polynomial time algorithm is presented to find the MUCF.
متن کاملMulti-granulation fuzzy probabilistic rough sets and their corresponding three-way decisions over two universes
This article introduces a general framework of multi-granulation fuzzy probabilistic roughsets (MG-FPRSs) models in multi-granulation fuzzy probabilistic approximation space over twouniverses. Four types of MG-FPRSs are established, by the four different conditional probabilitiesof fuzzy event. For different constraints on parameters, we obtain four kinds of each type MG-FPRSs...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- Discrete & Computational Geometry
دوره 52 شماره
صفحات -
تاریخ انتشار 2014