A Class of Differential Vector Variational Inequalities in Finite Dimensional Spaces

In this paper, we introduce and study a class of differential vector variational inequalities in finite dimensional Euclidean spaces. We establish a relationship between differential vector variational inequalities and differential scalar variational inequalities. Under various conditions, we obtain the existence and linear growth of solutions to the scalar variational inequalities. In particular we prove existence theorems for Carathéodory weak solutions of the differential vector variational inequalities. Furthermore, we give a convergence result on Euler time-dependent procedure for solving the initial-value differential vector variational inequalities.     

Operator-norm inequalities and interpolated trace inequalities

In this article, we investigate some operator-norm inequalities related to some conjectures posed by Hayajneh and Kittaneh that are related to questions of Bourin regarding a special type of inequalities referred to as subadditivity inequalities. While some inequalities are meant to answer these conjectures, other inequalities present reverse-type inequalities for these conjectures. Then, we present some new trace inequalities related to Heinz means inequality and use these inequalities to prove some variants of the aforementioned conjectures.     

Functional inequalities for the Wright functions

In this paper, our aim is to show some mean value inequalities for the Wright function, such as Turán-type inequalities, Lazarevi?-type inequalities, Wilker-type inequalities and Redheffer-type inequalities. Moreover, we prove monotonicity of ratios for sections of series of Wright functions, the result is also closely connected with Turán-type inequalities. In the end of the paper, we present some other inequalities for the Wright function.     

Mixing mixed-integer inequalities

Mixed-integer rounding (MIR) inequalities play a central role in the development of strong cutting planes for mixed-integer programs. In this paper, we investigate how known MIR inequalities can be combined in order to generate new strong valid inequalities.?Given a mixed-integer region S and a collection of valid “base” mixed-integer inequalities, we develop a procedure for generating new valid inequalities for S. The starting point of our procedure is to consider the MIR inequalities related with the base inequalities. For any subset of these MIR inequalities, we generate two new inequalities by combining or “mixing” them. We show that the new inequalities are strong in the sense that they fully describe the convex hull of a special mixed-integer region associated with the base inequalities.?We discuss how the mixing procedure can be used to obtain new classes of strong valid inequalities for various mixed-integer programming problems. In particular, we present examples for production planning, capacitated facility location, capacitated network design, and multiple knapsack problems. We also present preliminary computational results using the mixing procedure to tighten the formulation of some difficult integer programs. Finally we study some extensions of this mixing procedure. Received: April 1998 / Accepted: January 2001?Published online April 12, 2001     

Merit functions for general variational inequalities

In this paper, we consider some classes of merit functions for general variational inequalities. Using these functions, we obtain error bounds for the solution of general variational inequalities under some mild conditions. Since the general variational inequalities include variational inequalities, quasivariational inequalities and complementarity problems as special cases, results proved in this paper hold for these problems. In this respect, results obtained in this paper represent a refinement of previously known results for classical variational inequalities.     

Wasserstein-Divergence transportation inequalities and polynomial concentration inequalities

In this paper, we study Wasserstein-Divergence transportation inequalities which are the generalization of classical transportation inequalities. We present sufficient and necessary conditions for them separately, which coincide in the limit case. Using this kind of inequalities, we establish polynomial concentration inequalities for probability measures with no exponential moments.     

Existence of Solutions to Implicit Vector Variational Inequalities

In this paper, we study a class of implicit vector variational inequalities which contain implicit variational inequalities and generalized quasivariational inequalities as special cases. By employing the Fan–Kakutani fixed-point theorem and the Oettli scalarization procedure, respectively, we establish several existence results for implicit vector variational inequalities.     

Merit functions for general mixed quasi-variational inequalities

In this paper, we present some merit functions for general mixed quasi-variational inequalities, and we obtain the equivalent optimization problems to general mixed quasi-variational inequalities. Since the general mixed quasi-variational inequalities include general variational inequalities, quasi-variational inequalities and nonlinear (implicit) complementarity problems as special cases, our results continue to hold for these problems. In this respect, results obtained in this paper represent an extension of previously known results.     

Best constants in the Hardy-Rellich inequalities and related improvements

We consider Hardy-Rellich inequalities and discuss their possible improvement. The procedure is based on decomposition into spherical harmonics, where in addition various new inequalities are obtained (e.g. Rellich-Sobolev inequalities). We discuss also the optimality of these inequalities in the sense that we establish (in most cases) that the constants appearing there are the best ones. Next, we investigate the polyharmonic operator (Rellich and higher order Rellich inequalities); the difficulties arising in this case come from the fact that (generally) minimizing sequences are no longer expected to consist of radial functions. Finally, the successively use of the Rellich inequalities lead to various new higher order Rellich inequalities.     

一类新的Radon型不等式及其应用

给出一类新的R adon型不等式,它们在代数不等式研究中有着广泛的应用,利用它们可直接得到一大批新的分式型不等式,也可运用它们证明或推广许多不等式.     

Some singular value and unitarily invariant norm inequalities for Hilbert space operators

In this paper, we prove some singular value inequalities for sum and product of operators. Also, we obtain several generalizations of recent inequalities. Moreover, as applications we establish some unitarily invariant norm and trace inequalities for operators which provide refinements of previous results.     

Laeng-Morpurgo-Type Uncertainty Inequalities for the Laguerre Transform

In this work,we prove Clarkson-type and Nash-type inequalities for the Laguerre transform■on M=[0,∞)×R.By combining these inequalities,we show Laeng-Morpurgo-type uncertainty inequalities.We establish also a local-type uncertainty inequalities for the Laguerre transform■,and we deduce a Heisenberg-Pauli-Weyl-type inequality for this transform.     

On several new Hilbert-type inequalities involving means operators

In this paper, we establish several new Hilbert-type inequalities with a homogeneous kernel, involving arithmetic, geometric, and harmonic mean operators in both integral and discrete case. Such inequalities are derived by virtue of some recent results regarding general Hilbert-type inequalities and some well-known classical inequalities. We also prove that the constant factors appearing in established inequalities are the best possible. As an application, we consider some particular settings and compare our results with previously known from the literature.     

On the $${\mathcal {}}$$-free extension complexity of the TSP

It is known that the extension complexity of the TSP polytope for the complete graph \(K_n\) is exponential in n even if the subtour inequalities are excluded. In this article we study the polytopes formed by removing other subsets \({\mathcal {H}}\) of facet-defining inequalities of the TSP polytope. In particular, we consider the case when \({\mathcal {H}}\) is either the set of blossom inequalities or the simple comb inequalities. These inequalities are routinely used in cutting plane algorithms for the TSP. We show that the extension complexity remains exponential even if we exclude these inequalities. In addition we show that the extension complexity of polytope formed by all comb inequalities is exponential. For our proofs, we introduce a subclass of comb inequalities, called (h, t)-uniform inequalities, which may be of independent interest.     

A Unified Treatment of Half-Discrete Hilbert-Type Inequalities with a Homogeneous Kernel

In this paper we provide a unified treatment of half-discrete Hilbert-type inequalities with a general homogeneous kernel. The main results are proved for the case of non-conjugate exponents. A special emphasis is given to determining conditions under which these inequalities include the best possible constants. As an application, we consider some operator expressions closely connected to established inequalities. Finally, we also provide improvements of derived half-discrete inequalities by virtue of the Hermite-Hadamard inequality.     

Some inequalities involving determinants,eigenvalues, and Schur complements in Euclidean Jordan algebras

In this paper, using Schur complements, we prove various inequalities in Euclidean Jordan algebras. Specifically, we study analogues of the inequalities of Fischer, Hadamard, Bergstrom, Oppenheim, and other inequalities related to determinants, eigenvalues, and Schur complements.     

Capacitated facility location: Separation algorithms and computational experience

We consider the polyhedral approach to solving the capacitated facility location problem. The valid inequalities considered are the knapsack cover, flow cover, effective capacity, single depot, and combinatorial inequalities. The flow cover, effective capacity and single depot inequalities form subfamilies of the general family of submodular inequalities. The separation problem based on the family of submodular inequalities is NP-hard in general. For the well known subclass of flow cover inequalities, however, we show that if the client set is fixed, and if all capacities are equal, then the separation problem can be solved in polynomial time. For the flow cover inequalities based on an arbitrary client set and general capacities, and for the effective capacity and single depot inequalities we develop separation heuristics. An important part of these heuristics is based on the result that two specific conditions are necessary for the effective cover inequalities to be facet defining. The way these results are stated indicates precisely how structures that violate the two conditions can be modified to produce stronger inequalities. The family of combinatorial inequalities was originally developed for the uncapacitated facility location problem, but is also valid for the capacitated problem. No computational experience using the combinatorial inequalities has been reported so far. Here we suggest how partial output from the heuristic identifying violated submodular inequalities can be used as input to a heuristic identifying violated combinatorial inequalities. We report on computational results from solving 60 medium size problems. © 1998 The Mathematical Programming Society, Inc. Published by Elsevier Science B.V.     

Lp Brunn-Minkowski型仿射均质积分不等式

经典的仿射均质积分不等式是Brunn-Minkowski理论中一个关键不等式.建立了L_p Brunn-Minkowski型仿射均质积分不等式,定义了L_p Brunn-Minkowski型仿射混合均质积分且推广得到了L_p Brunn-Minkowski型仿射混合均质积分不等式.     

Hemivariational-like inequalities

In this paper, we introduce and consider a new class of variational inequalities, known as the hemivariational-like inequalities. It is shown that the hemivariational-like inequalities include hemivariational inequalities, variational-like inequalities and the classical variational inequalities as special cases. The auxiliary principle is used to suggest and analyze some iterative methods for solving hemivariational-like inequalities under mild conditions. The results obtained in this paper can be considered as a novel application of the auxiliary principle technique.     

On the relative strength of split,triangle and quadrilateral cuts

Integer programs defined by two equations with two free integer variables and nonnegative continuous variables have three types of nontrivial facets: split, triangle or quadrilateral inequalities. In this paper, we compare the strength of these three families of inequalities. In particular we study how well each family approximates the integer hull. We show that, in a well defined sense, triangle inequalities provide a good approximation of the integer hull. The same statement holds for quadrilateral inequalities. On the other hand, the approximation produced by split inequalities may be arbitrarily bad.