A dynamic system model for solving convex nonlinear optimization problems

This paper proposes a feedback neural network model for solving convex nonlinear programming (CNLP) problems. Under the condition that the objective function is convex and all constraint functions are strictly convex or that the objective function is strictly convex and the constraint function is convex, the proposed neural network is proved to be stable in the sense of Lyapunov and globally convergent to an exact optimal solution of the original problem. The validity and transient behavior of the neural network are demonstrated by using some examples.     

格的凸子格格与幂格

研究格的凸子格的性质,建立格的非空凸子格组成的幂格与幂格的联系,证明在同构意义下,分配格的幂格都是它的非空凸子格组成的幂格的子格。     

On permutation polytopes

In this paper we lay the foundations for the study of permutation polytopes: the convex hull of a group of permutation matrices.We clarify the relevant notions of equivalence, prove a product theorem, and discuss centrally symmetric permutation polytopes. We provide a number of combinatorial properties of (faces of) permutation polytopes. As an application, we classify ?4-dimensional permutation polytopes and the corresponding permutation groups. Classification results and further examples are made available online.We conclude with several questions suggested by a general finiteness result.     

对数凸模糊映射

利用模糊数的表示定理,本文证明了对数凸模糊映射一些基本性质,并纠正了S.N anda和K.K ar对数凸模糊映射定义的不合理性和其证明中的错误。     

On the number of connected convex subgraphs of a connected acyclic digraph

A digraph D is connected if the underlying undirected graph of D is connected. A subgraph H of an acyclic digraph D is convex if there is no directed path between vertices of H which contains an arc not in H. We find the minimum and maximum possible number of connected convex subgraphs in a connected acyclic digraph of order n. Connected convex subgraphs of connected acyclic digraphs are of interest in the area of modern embedded processors technology.     

To split or not to split: Capital allocation with convex risk measures

Convex risk measures were introduced by Deprez and Gerber [Deprez, O., Gerber, H.U., 1985. On convex principles of premium calculation. Insurance: Math. Econom. 4 (3), 179-189]. Here the problem of allocating risk capital to subportfolios is addressed, when convex risk measures are used. The Aumann-Shapley value is proposed as an appropriate allocation mechanism. Distortion-exponential measures are discussed extensively and explicit capital allocation formulas are obtained for the case that the risk measure belongs to this family. Finally the implications of capital allocation with a convex risk measure for the stability of portfolios are discussed. It is demonstrated that using a convex risk measure for capital allocation can produce an incentive for infinite fragmentation of portfolios.     

Extreme point axioms for closure spaces

A pair (X,τ) of a finite set X and a closure operator τ:2^X→2^X is called a closure space. The class of closure spaces includes matroids as well as antimatroids. Associated with a closure space (X,τ), the extreme point operator ex:2^X→2^X is defined as ex(A)={p|p∈A,p∉τ(A-{p})}. We give characterizations of extreme point operators of closure spaces, matroids and antimatroids, respectively.     

Singularity conditions for the non-existence of a common quadratic Lyapunov function for pairs of third order linear time invariant dynamic systems

The condition that a finite collection of stable matrices {A₁, … , A_M} has no common quadratic Lyapunov function (CQLF) is formulated as a hierarchy of singularity conditions for block matrices involving a number of unknown parameters. These conditions are applied to the case of two stable 3 × 3 matrices, where they are used to derive necessary and sufficient conditions for the non-existence of a CQLF.     

Students’ conceptual understanding of a function and its derivative in an experimental calculus course

Calculus has been witnessing fundamental changes in its curriculum, with an increased emphasis on visualization. This mode for representing mathematical concepts is gaining more strength due to the advances in computer technology and the development of dynamical mathematical software. This paper focuses on the understanding of the function and its derivative as viewed by students of a reformed Calculus 1 course offered in two experimental sections at the Lebanese American University in Beirut, Lebanon. Results have shown that the general approach adopted in the course proved to be unpopular for a great majority of the students, but rewarding for others. Interviews conducted with some students and a study of their performance on very specific exam questions reveal that for most students, the algebraic representation of a function still dominated their thinking; however, these students showed an almost complete understanding of the derivative, particularly the idea of the instantaneous rate of change and/or the slope of a curve at a given point. Furthermore, very few of these students referred to the mechanical methods for finding derivatives.     

Growth theorems and coefficient bounds for univalent holomorphic mappings which have parametric representation

Let B be the unit ball in Cn with respect to an arbitrary norm and let f(z,t) be a g-Loewner chain such that e−tf(z,t)−z has a zero of order k+1 at z=0. In this paper, we obtain growth and covering theorems for . Moreover, we consider coefficient bounds and examples of mappings in .