Convex Approximation of Some Kind of Convex Functions

Suppose that f(x)∈C~2[0,1] is a convex function.we concern the approxi-mation degree of f(x)by convex algebraic Polynomials.Among the other things,it is a very important question whether we have convex polynomials of degree nsuch that     

Kuelbs–Li Inequalities and Metric Entropy of Convex Hulls

Let T be a precompact subset of a Hilbert space. We make use of a precise link between the absolutely convex hull $\operatorname{aco}(T)$ and the reproducing kernel Hilbert space of a Gaussian random variable constructed from T. Firstly, we avail ourselves of it for optimality considerations concerning the well-known Kuelbs–Li inequalities. Secondly, this enables us to apply small deviation results to the problem of estimating the metric entropy of $\operatorname{aco}(T)$ in dependence of the metric entropy of T.     

Around the Proof of the Legendre–Cauchy Lemma on Convex Polygons

We briefly describe the history of the proofs of the well-known Cauchy lemma on comparison of the distances between the endpoints of two convex open polygons on a plane or sphere, present a rather analytical proof, and explain why the traditional constructions lead in general to inevitable appearance of nonstrictly convex open polygons. We also consider bendings one to the other of two isometric open or closed convex isometric polygons.     

Generalized Knaster–Kuratowski–Mazurkiewicz Theorem Without Convex Hull

In this paper, a new notion of Knaster–Kuratowski–Mazurkiewicz mapping is introduced and a generalized Knaster–Kuratowski–Mazurkiewicz theorem is proved. As applications, some existence theorems of solutions for (vector) Ky Fan minimax inequality, Ky Fan section theorem, variational relation problems, n-person noncooperative game, and n-person noncooperative multiobjective game are obtained.     

Approximation of Convex Bodies by ConvexBodies

For the affine distance d(C,D) between two convex bodies C, D(?) Rn, which reduces to the Banach-Mazur distance for symmetric convex bodies, the bounds of d(C, D) have been studied for many years. Some well known estimates for the upper-bounds are as follows: F. John proved d(C, D) < n1/2 if one is an ellipsoid and another is symmetric, d(C, D) < n if both are symmetric, and from F. John's result and d(C1,C2) < d(C1,C3)d(C2,C3) one has d(C,D) < n2 for general convex bodies; M. Lassak proved d(C, D) < (2n - 1) if one of them is symmetric. In this paper we get an estimate which includes all the results above as special cases and refines some of them in terms of measures of asymmetry for convex bodies.     

Duality of Unary Convex Functions Programming

Most nonliner programming problems consist of functions which are sums of unary,convexfunctions of linear fuctions.In this paper.we derive the duality forms of the unary oonvex optimization,and these technuqucs are applied to the geometric programming and minimum discrimination informationproblems.     

Aperture-Angle and Hausdorff-Approximation of Convex Figures

The aperture angle α(x,Q) of a point x ∉ Q in the plane with respect to a convex polygon Q is the angle of the smallest cone with apex x that contains Q. The aperture angle approximation error of a compact convex set C in the plane with respect to an inscribed convex polygon Q⊂C is the minimum aperture angle of any x∈C∖Q with respect to Q. We show that for any compact convex set C in the plane and any k>2, there is an inscribed convex k-gon Q⊂C with aperture angle approximation error . This bound is optimal, and settles a conjecture by Fekete from the early 1990s. The same proof technique can be used to prove a conjecture by Brass: If a polygon P admits no approximation by a sub-k-gon (the convex hull of k vertices of P) with Hausdorff distance σ, but all subpolygons of P (the convex hull of some vertices of P) admit such an approximation, then P is a (k+1)-gon. This implies the following result: For any k>2 and any convex polygon P of perimeter at most 1 there is a sub-k-gon Q of P such that the Hausdorff-distance of P and Q is at most  . This research was supported by the Korea Research Foundation Grant funded by the Korean Government (MOEHRD) (KRF-2006-311-D00763). NICTA is funded through the Australian Government’s Backing Australia’s Ability initiative, in part through the Australian Research Council.     

Locally Farkas–Minkowski Systems in Convex Semi-Infinite Programming

A pair of constraint qualifications in convex semi-infinite programming, namely the locally Farkas–Minkowski constraint qualification and generalized Slater constraint qualification, are studied in the paper. We analyze the relationship between them, as well as the behavior of the so-called active and sup-active mappings, accounting for the tightness of the constraint system at each point of the variables space. The generalized Slater constraint qualification guarantees a regular behavior of the supremum function (defined as supremum of the infinitely many functions involved in the constraint system), giving rise to the well-known Valadier formula.     

Perturbation of the Moore–Penrose Metric Generalized Inverse in Reflexive Strictly Convex Banach Spaces

Let X,Y be reflexive strictly convex Banach spaces,let T,δT:X→Y be bounded linear operators with closed range R(T).Put T=T+δT.In this paper,by using the concept of quasiadditivity and the so called generalized Neumman lemma,we will give some error estimates of the bounds of |T~M|.By using a relation between the concepts of the reduced minimum module and the gap of two subspaces,some new existence characterization of the Moore-Penrose metric generalized inverse T~M of the perturbed operator T will be also given.     

Möbius Polynomials of Face Posets of Convex Polytopes

The Möbius polynomial is an invariant of ranked posets, closely related to the Möbius function. In this paper, we study the Möbius polynomial of face posets of convex polytopes. We present formulas for computing the Möbius polynomial of the face poset of a pyramid or a prism over an existing polytope, or of the gluing of two or more polytopes in terms of the Möbius polynomials of the original polytopes. We also present general formulas for calculating Möbius polynomials of face posets of simplicial polytopes and of Eulerian posets in terms of their f-vectors and some additional constraints.     

Zero Duality Gap for Convex Programs: A Generalization of the Clark–Duffin Theorem

This article uses classical notions of convex analysis over Euclidean spaces, like Gale & Klee’s boundary rays and asymptotes of a convex set, or the inner aperture directions defined by Larman and Brøndsted for the same class of sets, to provide a generalization of the Clark–Duffin Theorem. On this ground, we are able to characterize objective functions and, respectively, feasible sets for which the duality gap is always zero, regardless of the value of the constraints and, respectively, of the objective function.     

A Characterization of a p Uniformly Convex Space

V.I.Istrtescu introduces the following notions:A Banach space E is said to be p-uniformly convex (p≥2)if the modulus of convexity of E satisfies the inequality for some positive constant C.A Banach space E is said to be q-uniformly smooth (1相似文献   

Contraction Flow by Certain Curvature of Convex Hypersurfaces

In the following mixed tensors on the hypersurface M Rn+1 under consideration willbe denoted by T={ Tijkl} ,the induced metric by g={ gij} and the second fundamentalform by A={ hij} .We always sum overrepeated indices from1 to n and use brackets forthe inner product on M:〈Tijk,Sijk〉 =gisgjαgkβTijk Ssαβ,　 | T| 2 =〈Tijk,Tijk〉.Setrkl =gkαhαl,Sm(λ1 ,… ,λn) = i1<… 相似文献   

Convex symmetrization and Pólya–Szegö inequality

We prove a Pólya–Szegö inequality involving a convex symmetrization of functions and we investigate the equality case.     

Convex Normalizations in Lift-and-Project Methods for 0–1 Programming

Branch-and-Cut algorithms for general 0–1 mixed integer programs can be successfully implemented by using Lift-and-Project (L&P) methods to generate cuts. L&P cuts are drawn from a cone of valid inequalities that is unbounded and, thus, needs to be truncated, or normalized. We consider general normalizations defined by arbitrary closed convex sets and derive dual problems for generating L&P cuts. This unified theoretical framework generalizes and covers a wide group of already known normalizations. We also give conditions for proving finite convergence of the cutting plane procedure that results from using such general L&P cuts.     

A Non-commutative Yosida–Hewitt Theorem and Convex Sets of Measurable Operators Closed Locally in Measure

We present a non-commutative extension of the classical Yosida–Hewitt decomposition of a finitely additive measure into its σ-additive and singular parts. Several applications are given to the characterisation of bounded convex sets in Banach spaces of measurable operators which are closed locally in measure.     

The Projection onto a Direct Product of Convex Cones

ＴｈｅＰｒｏｊｅｃｔｉｏｎｏｎｔｏａＤｉｒｅｃｔｒｏｄｕｃｔｏｆＣｏｎｖｅｘＣｏｎｅｓＬｉｕＷｅｉ（刘维）ａｎｄＳｈｉＮｉｎｇｚｈｏｎｇ（史宁中）（ＤｅｐａｒｔｍｅｎｔｏｆＭａｔｈｅｍａｔｉｃｓ，ＮｏｒｔｈｅａｓｔＮｏｒｍａｌＵｎｉｖｅｒｓｉｔｙ，Ｃ...     

Fixed Points of Cone Maps in Locally Convex Spaces

Guo [1] gives some fixed point theorems of cone maps in Banacb space. Here we generalize the main resnlts of [1] to a locally convex space. We remark that the approach in [1] is not applicable in our paper. Throughout this paper. X is a Hausdorff locally convex topological vector space over the field of real numbers, K is a closed convex subset     

Barker–Larman Problem for Convex Polygons in the Hyperbolic Plane

We solve an analogue of the Barker–Larman problem for convex polygons in the hyperbolic plane.     

Duality Theorems of Multiobjective Programming for a Class of Generalized Convex Functions

1.DefinitionsDefinition1.AfunctionalF(x)inthespaceVCE"issaidtobeasublinearfunctionalifforx,yeV,andor20,Inparticular,F(0)=0.Letop(x)beadifferentiablerealfunctiononasetCCEd.ForagivensublinearfunctionFandafunctionp:CxC-EIIp(x,u)/0(x/u),themoregeneralgeneralizedconvexfunctioncanbedefinedasthefollwing:Definition2.op(x)issaidtobe(F,p)--invarialltconvexfunctiononCifforxl,xZECDefinition3.op(x)issaidtobe(F,P)--invariantquasiconvexfunctiononCifforal,xZECthatis,Definition4.op(x)issaidtobe(F,…