Minimizing blossoms under symmetric linear constraints

Ait-Haddou, Rachid ; Biard, Luc ; Slawinski, M.

HAL, hal-01089017 / Harvested from HAL

Résumé

In this paper, we show that there exists a close dependence between the control polygon of a polynomial and the minimum of its blossom under symmetric linear constraints. We consider a given minimization problem P, for which a unique solution will be a point γ on the Bézier curve. For the minimization function f, two sufficient conditions exist that ensure the uniqueness of the solution, namely, the concavity of the control polygon of the polynomial and the characteristics of the Polya frequency-control polygon where the minimum coincides with a critical point of the polynomial. The use of the blossoming theory provides us with a useful geometrical interpretation of the minimization problem. In addition, this minimization approach leads us to a new method of discovering inequalities about the elementary symmetric polynomials.

Détail

Publié le : 2002-06-01
Classification:  ACM: G.: Mathematics of Computing/G.1: NUMERICAL ANALYSIS/G.1.6: Optimization/G.1.6.6: Linear programming,  ACM: G.: Mathematics of Computing/G.1: NUMERICAL ANALYSIS/G.1.2: Approximation/G.1.2.10: Spline and piecewise polynomial approximation,  ACM: G.: Mathematics of Computing/G.2: DISCRETE MATHEMATICS,  ACM: I.: Computing Methodologies/I.3: COMPUTER GRAPHICS/I.3.5: Computational Geometry and Object Modeling/I.3.5.2: Curve, surface, solid, and object representations,  [MATH.MATH-DG]Mathematics [math]/Differential Geometry [math.DG],  [INFO.INFO-CG]Computer Science [cs]/Computational Geometry [cs.CG]