The problem of robust state feedback design for a linear dynamical system with uncertain (interval) parameters is considered. The designed state feedback controller has to place all the coefficients of the closed loop system characteristic polynomial within assigned closed loop interval characteristic polynomial. A condition is derived using certain known facts about matrix minors and its chara...

In this paper we consider a well known class of valid inequalities for the p-median and the uncapacitated facility location polytopes, the odd cycle inequalities. It is known that their separation problem is polynomially solvable. We give a new polynomial separation algorithm based on a reduction from the original graph. Then, we define a nontrivial class of graphs, where the odd cycle inequali...

The celebrated Turán inequalities P 2 n(x) − Pn−1(x)Pn+1(x) ≥ 0, x ∈ [−1, 1], n ≥ 1, where Pn(x) denotes the Legendre polynomial of degree n, are extended to inequalities for sums of products of four classical orthogonal polynomials. The proof is based on an extension of the inequalities γ2 n − γn−1γn+1 ≥ 0, n ≥ 1, which hold for the Maclaurin coefficients of the real entire function ψ in the L...

A separation algorithm is a procedure for generating cutting planes. Up to now, only a few polynomial-time separation algorithms were known for the Boolean quadric and cut polytopes. These polytopes arise in connection with zero-one quadratic programming and the maxcut problem, respectively. We present a new algorithm, which separates over a class of valid inequalities that includes all odd bic...

Various important weighted polynomial inequalities, such as Bernstein, Marcinkiewicz, Nikolskii, Schur, Remez, etc. inequalities, have been proved recently by Giuseppe Mastroianni and Vilmos Totik under minimal assumptions on the weights. In most of the cases this minimal assumption is the doubling condition. Here, based on a recently proved Bernstein-type inequality by D.S. Lubinsky, we establ...

This paper derives exponential concentration inequalities and polynomial moment inequalities for the spectral norm of a random matrix. The analysis requires a matrix extension of the scalar concentration theory developed by Sourav Chatterjee using Stein’s method of exchangeable pairs. When applied to a sum of independent random matrices, this approach yields matrix generalizations of the classi...

We consider the polyhedral approach to solving the capacitated facility location problem. The valid inequalities considered are the knapsack, ow cover, e ective capacity, single depot, and combinatorial inequalities. The ow cover, e ective capacity, and single depot inequalities form subfamilies of the general family of submodular inequalities. The separation problem based on the family of subm...

The paper is concerned with best constants in Markov-type inequalities between the norm of a higher derivative of a polynomial and the norm of the polynomial itself. The norm of the polynomial is taken in L2 with the Gegenbauer weight corresponding to a parameter α , while the derivative is measured in L2 with the Gegenbauer weight for a parameter β . Under the assumption that β −α is an intege...

Given a graph G = (V,E) with nonnegative weights on the edges, the maximum induced bipartite subgraph problem (MIBSP for short) is to find a maximum weight bipartite subgraph (W,E[W ]) of G. Here E[W ] is the edge set induced by W . An edge subset F ⊆ E is called independent if there is an induced bipartite subgraph of G whose edge set contains F . Otherwise, it is called dependent. In this pap...

We present algorithmic and complexity results concerning computations with one and two real algebraic numbers, as well as real solving of univariate polynomials and bivariate polynomial systems with integer coefficients using Sturm-Habicht sequences. Our main results, in the univariate case, concern the problems of real root isolation (Th. 19) and simultaneous inequalities (Cor. 26) and in the ...