广义平衡与不动点问题的黏性逼近

本文的目的是在Hilbert空间中引入和研究了一种新的迭代序列,用以寻求具逆一强单调映象的广义平衡问题的解集与无限簇非扩张映象的不动点集的公共元.在适当的条件下,用黏性逼近法证明了逼近于这一公共元的强收敛定理.应用该结论,我们证明了逼近于平衡问题和变分不等式问题的强收敛定理.所得结果改进和推广了文献的相应结果.     

Hilbert空间中广义平衡问题和无限族非扩张映象的不动点问题的强收敛定理

在Hilbert空间中,用Fan-KKM定理导出了广义平衡问题的辅助问题的解的存在性和唯一性,讨论了寻找广义平衡问题和一族非扩张映象的公共不动点集的迭代序列,证明此序列强收敛于这两个集合的公共元.本文结论改进了一些近期结果.     

无限族严格渐近伪压缩映象隐迭代程序的强收敛定理

在Banach空间框架下,对无限族的严格渐近伪压缩映象和无限族的非扩张映象引入了一类新的隐迭代程序,并在适当的条件下,证明了该迭代程序强收敛于这两族映象的公共不动点.结果是新的,它推广和改进了一些人的最新结果.     

可数簇全拟-Φ-渐近非扩张映象和广义混合平衡问题以及极大单调算子的收缩投影迭代算法

先介绍全拟-φ-渐近非扩张映象的概念,然后在具有Kadec—Klee性质的一致光滑、严格凸的Banach空间的框架下,利用混合收缩投影的迭代算法,用以寻求广义混合平衡问题的解集GMEP,可数簇全拟-φ-渐近非扩张映象的不动点集(?)F(S_(i))和极大单调算子的零点集T~(-1)0的公共元.在适当的条件下,证明了逼近于这一公共元的强收敛定理.推广和改进了一些最新结果.     

广义混合平衡问题和一族拟-φ-渐近非扩张映象不动点问题的强收敛定理

本文在Banach空间中讨论了一种混合投影迭代算法,借以寻求广义混合平衡问题和一族拟-φ-渐近非扩张映象的不动点集的公共元,证明了此迭代序列的强收敛定理.文中所得到的结果,推广并改进了最近一些人所发布的新结果.     

广义似平衡问题与有限簇非扩张映象的强收敛定理

在Hilbert空间的框架下,为寻求广义似平衡问题(GELP)的解集与非扩张映象的不动点集的公共元,引入和研究了一种新的混合迭代算法.在一定的条件下,用黏性逼近法证明了迭代序列逼近于这一公共元的某些强收敛定理.所得结果改进和推广了文献的相应结果.     

Banach空间中广义平衡问题和一族相对非扩张映象的强收敛定理

在Banach空间中,用收缩投影的方法证明了广义平衡问题和一族相对非扩张映象的公共不动点的强收敛定理.结论改进了最近一些人的研究结果     

关于变分包含问题和不动点问题的一些结果及应用

基于一个广义迭代算法,考虑了逼近一类拟变分包含问题解集与一族无限多个非扩张映象公共不动点集的某一公共元问题.在实Hilbert空间的框架下,证明了由次广义迭代算法产生的迭代序列强收敛到某一公共元.     

带误差的合成隐迭代新算法

该文参照Banach压缩映象原理合理地引进了一涉及有限族渐进非扩张映象的具误差的合成隐迭代式. 在适当条件下 证得了该迭代序列给出的序列弱收敛与强收敛到有限族渐进非扩张映象的一公共不动点, 并由此得出该合成隐迭代式导出的一非隐迭代算法的弱收敛与强收敛的新定理. 值得一提的是, 这是在未增加任何附加条件的情况下将2006年一文献的主要结果由隐迭代算法改进为非隐的显式迭代算法.     

有限个平衡问题与非扩张映象不动点问题的复合迭代方法

在Hilbert空间中引进并研究一种新的复合粘性迭代算法,借以寻求有限个平衡问题的公共解集与非扩张映象不动点集的一个公共元素.所得结果改进并推广了最近一些人的最新结果.     

Intersecting a simple mixed integer set with a vertex packing set

We consider a mixed integer set that results from the intersection of a simple mixed integer set with a vertex packing set from a conflict graph. This set arises as a relaxation of the feasible set of mixed integer problems such as inventory routing problems. We derive families of strong valid inequalities that consider the structures of the simple mixed integer set and the vertex packing set simultaneously.     

The union of a Riesz set and a Lust-Piquard set is a Riesz set

We prove that the union of a Riesz set and a Lust-Piquard set is a Riesz set. This gives as corollaries known results of Y. Katznelson, R.E. Dressler-L. Pigno, and D. Li. Moreover, we give an example of a Rosenthal set which is dense in Z for the Bohr topology.     

Treatment of set order relations by means of a nonlinear scalarization functional: a full characterization

In this paper, we show how a nonlinear scalarization functional can be used in order to characterize several well-known set order relations and which thus plays a key role in set optimization. By means of this functional, we derive characterizations for minimal elements of set-valued optimization problems using a set approach. Our methods do not rely on any convexity assumptions on the considered sets. Furthermore, we develop a derivative-free descent method for set optimization problems without convexity assumptions to verify the usefulness of our results.     

On Weierstrass semigroups and sets: a review with new results

In this work we present a survey of the main results in the theory of Weierstrass semigroups at several points, with special attention to the determination of bounds for the cardinality of its set of gaps. We also review results on applications to the theory of error correcting codes. We then recall a generalization of the concept of Weierstrass semigroup, which is the Weierstrass set associated to a linear system and several points. We finish by presenting new results on this Weierstrass set, including some on the cardinality of its set of gaps.      

Partitions of a Polytope and Mappings of a Point Set to Facets

Three theorems of this paper generalize previous results of the author on conjectures of A. Bezdek and V.V. Proizvolov. They show the existence of mappings from a given point set to the set of facets of a given polytope that satistfy some special conditions. Developing the same technique, some results on convex polytope partitions are presented, two of them dealing with partitions with prescribed measures of parts. Then we prove a corollary on the existence of a possibly nonconvex polytope with a given set of vertices, containing given points in its interior. We also consider problems of the following type: find an assignment of vectors from a given set to the parts of a given convex partition of ℝⁿ so that the shifts of the parts by their corresponding vectors either do not intersect by interior points or cover ℝⁿ     

The recurrence and the gradient-like structure of a flow

In this paper, some new properties of the nonwandering set, the partial order set, the chain recurrent set and the generalized recurrent set of a flow are proved. A new characterization of the gradient-like part of a flow is given. Some results of Conley are generalized.     

Hilbert空间中混合平衡问题与非扩张半群的强收敛定理

在Hilbert空间中引进并研究了一种新的迭代算法,借以寻求混合平衡问题解集与非扩张半群不动点集的一公共元.所得到的结果,推广并改进了最近一些人所发布的新结果.     

Best Uniform Approximation of a Family of Functions Continuous on a Compact Set

We investigate the problem of the best uniform approximation of a function continuous on a compact set. We generalize the principal results of this investigation to the problem of the best simultaneous uniform approximation of a family of functions continuous on a compact set.     

A hybrid approximation method for equilibrium and fixed point problems for a family of infinitely nonexpansive mappings and a monotone mapping

In this paper, we introduce a new iterative scheme for finding a common element of the set of fixed points of a family of infinitely nonexpansive mappings, the set of solutions of an equilibrium problem and the set of solutions of the variational inequality for α-inverse-strongly monotone mapping in the framework of a Hilbert space. Under suitable conditions, some strong convergence theorems for approximating a common element of the above three sets are obtained. Additionally, we utilize our results to study the optimization problem and find a zero of a maximal monotone operator and a strictly pseudocontractive mapping in a real Hilbert space. Our results improve and extend the results announced by many others.     

Strong convergence of a general iterative algorithm for equilibrium problems and variational inequality problems

The purpose of this paper is to study the strong convergence of a general iterative scheme to find a common element of the set of common fixed points of a finite family of nonexpansive mappings, the set of solutions of variation inequalities for a relaxed cocoercive mapping and the set of solutions of an equilibrium problem. Our results extend recent results announced by many others.