一个具有半连续Gteaux导数的泛函的Mini Max定理和非线性波动方程的边值问题的解(英文)

In this paper,a mini max theorem was showed mega which the paper proves a new existent and unique result on solution of the boundary value problem for the nonlinear wave equation by using the mini max theorem.     

A mini max theorem for the quasi-convex functional and the solution of the nonlinear beam equation

In this paper, a definition of a kind of quasi-convex functional was proposed and two properties of the quasi-convex functional were proved. A mini max theorem due to Stepan A. Tersian was generalized by using the properties of the quasi-convex functional. The existence and uniqueness of solution of the boundary value problem for the nonlinear beam equation was probed and an existence and uniqueness theorem was presented.     

极值问题与一类具有无限纯策略集的最优混合策略

证明了局部凸线性拓扑空间上实值连续泛函的极大极小定理与极大定理，并由此证明了一类具有无限纯策略集的二人对策中最优混合策略的存在性。该证明对经典情形也适用，而且比传统的证明要简洁。     

Surrogate duality for robust optimization

Robust optimization problems, which have uncertain data, are considered. We prove surrogate duality theorems for robust quasiconvex optimization problems and surrogate min–max duality theorems for robust convex optimization problems. We give necessary and sufficient constraint qualifications for surrogate duality and surrogate min–max duality, and show some examples at which such duality results are used effectively. Moreover, we obtain a surrogate duality theorem and a surrogate min–max duality theorem for semi-definite optimization problems in the face of data uncertainty.     

Spectral properties of matrix polynomials in the max algebra

We consider the spectral properties of matrix polynomials over the max algebra. In particular, we show how the Perron-Frobenius theorem for the max algebra extends to such polynomials and illustrate the relevance of this for multistep difference equations in the max algebra. We also present a number of inequalities for the largest max eigenvalue of a matrix polynomial.     

Double control problems of age-distributed population dynamics

This paper is concerned with some optimal control problems of an age-structured population model controlled by fecundity and culling rates. The first-order necessary optimality conditions of the following four problems are deduced by means of a Dubovitskii–Milyutin functional analysis approach: a problem with fixed horizon and terminal constraint set, a free horizon counterpart, a differential game and a mini–max problem with a non-differentiable objective functional.     

关于单位球面的子流形的一个Pinching定理

设Ｍ是单位球面的一个浸入子流形，ＵＭ＝∪ＵＭｘ是Ｍ的单位切丛.本文研究函数ｆ（ｘ）＝ｍａｘ－Ｂ（ｕ，ｕ）－Ｂ（ｖ，ｖ）２。其中Ｂ是Ｍ的第二基本形式．当Ｍ具平行平均曲率时，我们给出关于第二基本形式的一个Ｐｉｎｃｈｉｎｇ定理．对Ｍ是极小的情形，我们有相同的讨论．     

Note on the path‐matching formula

As a common generalization of matchings and matroid intersections, W.H. Cunningham and J.F. Geelen introduced the notion of path‐matchings. They proved a min‐max formula for the maximum value. Here, we exhibit a simplified version of their min‐max theorem and provide a purely combinatorial proof. © 2002 Wiley Periodicals, Inc. J Graph Theory 41: 110–119, 2002     

Estimates for the Number of Sums and Products and for Exponential Sums in Fields of Prime Order

Our first result is a ‘sum-product’ theorem forsubsets A of the finite field F_p, p prime, providing a lowerbound on max (|A + A|, |A · A|). The second and mainresult provides new bounds on exponential sums     

Torsion Theories and Primaty Decomposition of Modules

In this paper, the author obtains the following result: If R is a left semi-artinian max ring, then the primary decomposition theorem holds for all R-modules if and only if Ext (S_1, S_2) =0 for any non-isomorphic simple modules S_1 and S_2. By mecns of the primary decomposition of modules, the author proves: All torsion theories of \mu are simple type if and only if R is a left semi-artinian max ring and Ext(S_1, S_2)=0 for any non-isomorphic simple modules S_1, S_2.     

The network flows approach for matrices with given row and column sums

We study the set of integral matrices with given row and column sums where each position has a bound on the size of the entry in it. Such matrices correspond to maximum integral flows in certain networks. The well known existence theorem follows from the max flow-min cut theorem. A general network flow result, specialized to our setting, yields a useful interchange theorem which has a number of corollaries. Prompted by another network flow result, new results are obtained for invariant positions i.e. entries which are the same regardless of which matrix is chosen. This leads to a classification of invariant edges in graphs of a given degree sequence, important in the study of split graphs and threshold graphs.     

Generalized skew bisubmodularity: A characterization and a min–max theorem

Huber, Krokhin, and Powell (2013) introduced a concept of skew bisubmodularity, as a generalization of bisubmodularity, in their complexity dichotomy theorem for valued constraint satisfaction problems over the three-value domain. In this paper we consider a natural generalization of the concept of skew bisubmodularity and show a connection between the generalized skew bisubmodularity and a convex extension over rectangles. We also analyze the dual polyhedra, called skew bisubmodular polyhedra, associated with generalized skew bisubmodular functions and derive a min–max theorem that characterizes the minimum value of a generalized skew bisubmodular function in terms of a minimum-norm point in the associated skew bisubmodular polyhedron.     

On weighted multiway cuts in trees

A min—max theorem is developed for the multiway cut problem of edge-weighted trees. We present a polynomial time algorithm to construct an optimal dual solution, if edge weights come in unary representation. Applications to biology also require some more complex edge weights. We describe a dynamic programming type algorithm for this more general problem from biology and show that our min—max theorem does not apply to it.Corresponding author.Research of the author was supported by the A. v. Humboldt-Stiftung and the U.S. Office of Naval Research under the contract N-0014-91-J-1385.     

On the maximum modulus of polynomials not vanishing inside the unit circle

A well-known theorem of Ankeney and Rivlin states that if p(z) is a polynomial of degree n, such that p(z)≠0 for |z|<1, then . In this paper we improve this bound.     

A max version of the generalized spectral radius theorem

Let Ψ be a bounded set of n × n nonnegative matrices in max algebra. In this paper we propose the notions of the max algebra version of the generalized spectral radius μ(Ψ) of Ψ, and the max algebra version of the joint spectral radius η(Ψ) of Ψ. The max algebra version of the generalized spectral radius theorem μ(Ψ) = η(Ψ) is established. We propose the relationship between the generalized spectral radius ρ(Ψ) of Ψ (in the sense of Daubechies and Lagarias) and its max algebra version μ(Ψ). Moreover, a generalization of Elsner and van den Driessche’s lemma is presented as well.     

精确罚函数和极小极大问题

在这篇文章中我们研究了对于不等式约束的非线性规划问题如何根据极小极大问题的鞍点来找精确罚问题的解。对于一个具有不等式约束的非线性规划问题,通过罚函数,我们构造出一个极小极大问题,应用交换“极小”或“极大”次序的策略,证明了罚问题的鞍点定理。研究结果显示极小极大问题的鞍点是精确罚问题的解。     

Inequalities for the derivative of a polynomial

Let P(z) be a polynomial of degreen which does not vanish in ¦z¦ <k, wherek > 0. Fork ≤ 1, it is known that

$$\mathop {\max }\limits_{|z| = 1} |P'(z)| \leqslant \frac{n}{{1 + k^n }}\mathop {\max }\limits_{|z| = 1} |P(z)|$$

, provided ¦P’(z)¦ and ¦Q’(z)¦ become maximum at the same point on ¦z¦ = 1, where\(Q(z) = z^n \overline {P(1/\bar z)} \). In this paper we obtain certain refinements of this result. We also present a refinement of a generalization of the theorem of Tu?an.

     

Hypersurface with Constant Main Curvature Symmetric Functions

ＨｙｐｅｒｓｕｒｆａｃｅｗｉｔｈＣｏｎｓｔａｎｔＭａｉｎＣｕｒｖａｔｕｒｅＳｙｍｍｅｔｒｉｃＦｕｎｃｔｉｏｎｓ￥ＷｕＢａｏｑｉａｎｇ；ＳｏｎｇＨｏｎｇｚａｏ（ＸｕｚｈｏｕＴｅａｃｈｅｒｓＣｏｌｌｅｇｅ，２２１００９）（ＨｅｎａｎＵｎｉｖｅｒｓｉｔｙ，...     

Methods for knowledge reduction in inconsistent ordered information systems

Knowledge reduction is one of the most important problems in the study of rough set theory. However, in real-world, most of information systems are based on dominance relations in stead of the classical equivalence relation because of various factors. The ordering of properties of attributes plays a crucial role in those systems. To acquire brief decision rules from the systems, knowledge reductions are needed. The main objective of this paper is to deal with this problem. The distribution reduction and maximum distribution reduction are proposed in inconsistent ordered information systems. Moreover, properties and relationship between them are discussed. Furthermore, judgment theorem and discernibility matrix are obtained, from which an approach to knowledge reductions can be provided in inconsistent ordered information systems.     

有限域上由一组对角多项式确定的簇中的点

设F_q为有限域,f_i(x)=a_(i1)x_1~(d_(i1))+…+a_(in)x_n~(d_(in))+c_i(i=1,…,m)为F_q上一组对角多项式,用N(V)表示由f_i(i=1,…,m)确定的簇中的F_q．有理点的个数．通过应用Adolphson和Sperber所引进的牛顿多面体方法,证明了ord_qN(V)≥[1/d_1+…+1/d_n]-m,其中d_i=max{d_(1i),…,d_(mi)}．该结果在许多情形下可以改进Ax- Katz定理,并推广了Wan在m=1时得到的一个定理,而且我们对Wan的定理给出了一个不同的证明．