Equivalence of Two Nondegeneracy Conditions for Semidefinite Programs

Nondegeneracy assumptions are often needed in order to prove the local fast convergence of suitable algorithms as well as in the sensitivity analysis for semidefinite programs. One of the more standard nondegeneracy conditions is the geometric condition used by Alizadeh et al. (Math. Program. 77:111–128, 1997). On the other hand, Kanzow and Nagel (SIAM J. Optim. 15:654–672, 2005) recently introduced an algebraic condition that was used in order to prove, for the first time, the local quadratic convergence of a suitable algorithm for the solution of semidefinite programs without using the strict complementarity assumption. The aim of this paper is to show that these two nondegeneracy conditions are equivalent.     

Wijsman and Hit-and-Miss Topologies of Quasi-Metric Spaces

The relationship between the Wijsman topology and (proximal) hit-and-miss topologies is studied in the realm of quasi-metric spaces. We establish the equivalence between these hypertopologies in terms of Urysohn families of sets. Our results generalize well-known theorems and provide easier proofs. In particular, we prove that for a quasi-pseudo-metrizable space (X,T) the Vietoris topology on the set P ₀(X) of all nonempty subsets of X is the supremum of all Wijsman topologies associated with quasi-pseudo-metrics compatible with T. We also show that for a quasi-pseudo-metric space (X,d) the Hausdorff extended quasi-pseudo-metric is compatible with the Wijsman topology on P ₀(X) if and only if d ^–1 is hereditarily precompact.     

A General Duality Scheme for Nonconvex Minimization Problems with a Strict Inequality Constraint

We establish a duality formula for the problem Minimize f(x)+g(x) for h(x)+k(x)<0 where g, k are extended-real-valued convex functions and f, h belong to the class of functions that can be written as the lower envelope of an arbitrary family of convex functions. Applications in d.c. and Lipschitzian optimization are given.     

3一致 C-超图的最小边数

混合超图是含有两类超边的超图,一类称为C-超边,一类称为D-超边,它们的区别主要体现在染色要求上．混合超图的染色,要求每一C-超边至少有两个点染相同的颜色,而每一D-超边至少有两个点染不同的颜色．所用的最大颜色数称为对应混合超图的上色数,所用的最小颜色数称为对应混合超图的下色数．上、下色数与边数有密切关系．作者在文献[2]中证明了具有最小上色数的3一致C-超图边数的一个下界为‘n(n-2)/3’,其中n为对应混合超图的顶点数．该文证明当n=2k 1时,该下界是可以达到的．     

基于模糊蕴涵的分配性方程

研究函数方程组I(x,T(y,z))=T(I(x,y),I(x,z)),I(x,y)=I(N(y),N(x))的解,其中T:[0,1]2→[0,1]是一个严格三角模,I:[0,1]2→[0,1]是一个模糊蕴涵算子和N:[0,1]→[0,1]是一个强否定.在I除了在点(0,0),(1,1)不连续的假设下,获得了满足这个函数方程组解的完全刻画.     

C n -almost automorphic solutions for partial neutral functional differential equations

In this work, we study the existence of C ⁿ -almost periodic solutions and C ⁿ -almost automorphic solutions (n?≥?1), for partial neutral functional differential equations. We prove that the existence of a bounded integral solution on ?⁺ implies the existence of C ⁿ -almost periodic and C ⁿ -almost automorphic strict solutions. When the exponential dichotomy holds for the homogeneous linear equation, we show the uniqueness of C ⁿ -almost periodic and C ⁿ -almost automorphic strict solutions.     

On Incidence Algebras of Combinatorial Inverse Monoids

We study the incidence algebra of the reduced standard division category of a combinatorial bisimple inverse monoid [with (E(S), ≤) locally finite], and we describe semigroups of poset type (i.e., a combinatorial inverse semigroup for which the corresponding Möbius category is a poset) as being combinatorial strict inverse semigroups. Up to isomorphism, the only Möbius-division categories are the reduced standard division categories of combinatorial inverse monoids.     

On fuzzy almost continuous convergence in fuzzy function spaces

In this paper, we study the fuzzy almost continuous convergence of fuzzy nets on the set FAC(X, Y) of all fuzzy almost continuous functions of a fuzzy topological space X into another Y. Also, we introduce the notions of fuzzy splitting and fuzzy jointly continuous topologies on the set FAC(X, Y) and study some of its basic properties.     

Multi-agent system model with mixed coupling topologies for pattern formation and formation splitting

In this article, a new type of multi-agent system model with mixed coupling topologies is proposed for realizing pattern formations with specific geometric shapes and formation splitting. The interactions among individual agents are assumed to be universally repulsive and selectively attractive. By designing the form of attractive coupling matrix, one can obtain a variety of formations with specific shapes in the system through self-assembly of agents. Both symmetric coupling case and asymmetric coupling case are considered. Analysis and simulation results show symmetric ones result in convergent dynamics to steady-state formations, whereas, for asymmetric case, the system exhibits complex dynamic behaviours, including collective rotation and chaotic motion. By breaking the graph defined by attractive couplings into disjoint subgraphs, one can make the formation of agents to split into small sizes. The results are relevant for the design of coordination and cooperative control for multi-agent systems.