𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Gröbner bases in Asymptotic Analysis of Perturbed Polynomial Programs

✍ Scribed by Vladimir Ejov; Jerzy A. Filar

Publisher
Springer
Year
2006
Tongue
English
Weight
187 KB
Volume
64
Category
Article
ISSN
0340-9422

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Analogs of Gröbner Bases in Polynomial R
Analogs of Gröbner Bases in Polynomial Rings over a Ring
✍ LYN J. MILLER 📂 Article 📅 1996 🏛 Elsevier Science 🌐 English ⚖ 617 KB

In this paper we will define analogs of Gröbner bases for R-subalgebras and their ideals in a polynomial ring R[x 1 , . . . , xn] where R is a noetherian integral domain with multiplicative identity and in which we can determine ideal membership and compute syzygies. The main goal is to present and

Asymptotic Analysis of Perturbed Mathema
Asymptotic Analysis of Perturbed Mathematical Programs
✍ Jean-Michel Coulomb; Jerzy A Filar; Witold Szczechla 📂 Article 📅 2000 🏛 Elsevier Science 🌐 English ⚖ 163 KB

We consider a perturbed mathematical programming problem where both the objective and the constraint functions are analytical in both the underlying decision variables and in the perturbation variable/parameter that is denoted by . The following question arises: what is the description of the soluti

Gröbner Bases in Orders of Algebraic Num
Gröbner Bases in Orders of Algebraic Number Fields
✍ David Andrew Smith 📂 Article 📅 2002 🏛 Elsevier Science 🌐 English ⚖ 281 KB

We prove that any order O of any algebraic number field K is a reduction ring. Rather than showing the axioms for a reduction ring hold, we start from scratch by well-ordering O, defining a division algorithm, and demonstrating how to use it in a Buchberger algorithm which computes a Gröbner basis g