New algorithms for the split variational inclusion problems and application to split feasibility problems

ABSTRACT

In this paper, we suggest two new iterative methods for finding an element of the solution set of split variational inclusion problem in real Hilbert spaces. Under suitable conditions, we present weak and strong convergence theorems for these methods. We also apply the proposed algorithms to study the split feasibility problem. Finally, we give some numerical results which show that our proposed algorithms are efficient and implementable from the numerical point of view.     

A cyclic iterative method for solving Multiple Sets Split Feasibility Problems in Banach Spaces

In this paper, we construct an iterative scheme and prove strong convergence theorem of the sequence generated to an approximate solution to a multiple sets split feasibility problem in a p-uniformly convex and uniformly smooth real Banach space. Some numerical experiments are given to study the efficiency and implementation of our iteration method. Our result complements the results of F. Wang (A new algorithm for solving the multiple-sets split feasibility problem in Banach spaces, Numerical Functional Anal. Optim. 35 (2014), 99–110), F. Scho¨pfer et al. (An iterative regularization method for the solution of the split feasibility problem in Banach spaces, Inverse Problems 24 (2008), 055008) and many important recent results in this direction.     

Proximal type algorithms involving linesearch and inertial technique for split variational inclusion problem in hilbert spaces with applications

ABSTRACT

In convex optimization, numerous problems in applied sciences can be modelled as the split variational inclusion problem (SVIP). In this connection, we aim to design new and efficient proximal type algorithms which are based on the inertial technique and the linesearches terminology. We then discuss its convergence under some suitable conditions without the assumption on the operator norm. We also apply our main result to the split minimization problem, the split feasibility problem, the relaxed split feasibility problem and the linear inverse problem. Finally, we provide some numerical experiments and comparisons to these problems. The obtained result mainly improves the recent results investigated by Chuang.     

On inertial proximal algorithm for split variational inclusion problems

ABSTRACT

In this paper, a hybrid proximal algorithm with inertial effect is introduced to solve a split variational inclusion problem in real Hilbert spaces. Under mild conditions on the parameters, we establish weak convergence results for the proposed algorithm. Unlike the earlier iterative methods, we do not impose any conditions on the sequence generated by the proposed algorithm. Also, we extend our results to find a common solution of a split variational inclusion problem and a fixed-point problem. Finally, some numerical examples are given to discuss the convergence and superiority of the proposed iterative methods.     

The split common fixed point problem for generalized demimetric mappings in two Banach spaces

ABSTRACT

In this paper, we consider the split common fixed point problem for new demimetric mappings in two Banach spaces. Using the hybrid method, we prove a strong convergence theorem for finding a solution of the split common fixed point problem in two Banach spaces. Furthermore, using the shrinking projection method, we obtain another strong convergence theorem for finding a solution of the problem in two Banach spaces. Using these results, we obtain well-known and new strong convergence theorems in Hilbert spaces and Banach spaces.     

Hybrid Moreau’s Proximal Algorithms and Convergence Theorems for Minimization Problems in Hilbert Spaces with Applications

Abstract

In this paper, motivated by Moreau’s proximal algorithm, we give several algorithms and related weak and strong convergence theorems for minimization problems under suitable conditions. These algorithms and convergence theorems are different from the results in the literatures. Besides, we also study algorithms and convergence theorems for the split feasibility problem in real Hilbert spaces. Finally, we give numerical results for our main results.     

A Distance-2-Spread of the Generalized Hexagon H(3)

In this paper, we construct a distance-2-spread of the known generalized hexagon of order 3 (the split Cayley hexagon H(3)). Furthermore we prove the uniqueness of this distance-2-spread in H(3) and show that its automorphism group is the linear group L₂(13). We remark that a distance-2-spread in any split Cayley hexagon H(q) is a line spread of the underlying polar space Q(6, q) and we construct a line spread of Q(6, 2) that is not a distance-2-spread in any H(2) defined on Q(6, 2).AMS Subject Classification: 51E12.     

On the separation of split cuts and related inequalities

 The split cuts of Cook, Kannan and Schrijver are general-purpose valid inequalities for integer programming which include a variety of other well-known cuts as special cases. To detect violated split cuts, one has to solve the associated separation problem. The complexity of split cut separation was recently cited as an open problem by Cornuéjols & Li CL01. In this paper we settle this question by proving strong 𝒩𝒫-completeness of separation for split cuts. As a by-product we also show 𝒩𝒫-completeness of separation for several other classes of inequalities, including the MIR-inequalities of Nemhauser and Wolsey and some new inequalities which we call balanced split cuts and binary split cuts. We also strengthen 𝒩𝒫-completeness results of Caprara & Fischetti CF96 (for -cuts) and Eisenbrand E99 (for Chvátal-Gomory cuts). To compensate for this bleak picture, we also give a positive result for the Symmetric Travelling Salesman Problem. We show how to separate in polynomial time over a class of split cuts which includes all comb inequalities with a fixed handle. Received: October 23, 2000 / Accepted: October 03, 2001 Published online: September 5, 2002 Key words. cutting planes – separation – complexity – travelling salesman problem – comb inequalities     

Split equilibrium problems for related games and applications to economic theory

ABSTRACT

In this paper we introduce the concept of split Nash equilibrium problems associated with two related noncooperative strategic games. Then we apply the Fan-KKM theorem to prove the existence of solutions to split Nash equilibrium problems of related noncooperative strategic games, in which the strategy sets of the players are nonempty closed and convex subsets in Banach spaces. As an application of this existence to economics, an example is provided that studies the existence of split Nash equilibrium of utilities of two related economies. As applications, we study the existence of split Nash equilibrium in the dual (playing twice) extended Bertrand duopoly model of price competition.     

An iterative algorithm for solving split equilibrium problems and split equality variational inclusions for a class of nonexpansive-type maps

ABSTRACT

In this paper, an iterative algorithm that approximates solutions of split equality fixed point problems (SEFPP) for quasi-φ-nonexpansive maps is constructed. Strong convergence of the sequence generated by this algorithm is established in certain real Banach spaces without imposing any compactness-type condition on either the operators or the space considered. We applied our theorem to solve split equality problem, split equality variational inclusion problem and split equality equilibrium problem. Furthermore, some numerical example is given to demonstrate the implementability of our algorithm. Finally, our theorems improve and complement a host of important recent results.     

The Speciality Lemma, Rank 2 Bundles and Gherardelli-type Theorems for Surfaces in P 4

In the present paper we give a very short and easy proof of the speciality lemma for codimension 2 subvarieties, even those that are reducible or non-reduced, in P ⁿ . Furthermore we give cohomological conditions that force a subcanonical surface in P ⁴ to be a complete intersection and a rank 2 bundle to split, which generalize the classical First Theorem of Gherardelli.     

Strong convergence of two algorithms for the split feasibility problem in Banach spaces

ABSTRACT

In this paper, we consider the split feasibility problem in Banach spaces. By converting it to an equivalent null-point problem, we propose two iterative algorithms, which are new even in Hilbert spaces. The parameter in one algorithm is chosen in such a way that no priori knowledge of the operator norms is required. It is shown that these two algorithms are strongly convergent provided that the involved Banach spaces are smooth and uniformly convex. Finally, we conduct numerical experiments to support the validity of the obtained results.     

Actions in the Category of Precrossed Modules in Lie Algebras

For any object L in the category of precrossed modules in Lie algebras PXLie, we construct the object Act(L), which we call the actor of this object. From this construction, we derive the notions of action, center, semidirect product, derivation, commutator, and abelian precrossed module in PXLie. We show that the notion of action is equivalent to the one given in semi-abelian categories, and Act(L) is the split extension classifier for L. In the case of a crossed module in Lie algebras we show how to recover its actor in the category of crossed modules from its actor in the category of precrossed modules.     

Subregion-Adaptive Integration of Functions Having a Dominant Peak

Abstract

Many statistical multiple integration problems involve integrands that have a dominant peak. In applying numerical methods to solve these problems, statisticians have paid relatively little attention to existing quadrature methods and available software developed in the numerical analysis literature. One reason these methods have been largely overlooked, even though they are known to be more efficient than Monte Carlo for well-behaved problems of low dimensionality, may be that when applied naively they are poorly suited for peaked-integrand problems. In this article we use transformations based on “split t” distributions to allow the integrals to be efficiently computed using a subregion-adaptive numerical integration algorithm. Our split t distributions are modifications of those suggested by Geweke and may also be used to define Monte Carlo importance functions. We then compare our approach to Monte Carlo. In the several examples we examine here, we find subregion-adaptive integration to be substantially more efficient than importance sampling.     

Iterative methods for the split feasibility problem and the fixed point problem in Banach spaces

ABSTRACT

In this work, we suggest modifications of the self-adaptive method for solving the split feasibility problem and the fixed point problem of nonexpansive mappings in the framework of Banach spaces. Without the assumption on the norm of the operator, we prove that the sequences generated by our algorithms weakly and strongly converge to a solution of the problems. The numerical experiments are demonstrated to show the efficiency and the implementation of our algorithms.     

The grothendieck group of the category of modules of finite projective dimension over certain weakly triangular algebras

In this paper we study the category of finitely generated modules of finite projective dimension over a class of weakly triangular algebras, which includes the algebras whose idempotent ideals have finite projective dimension. In particular, we prove that the relations given by the (relative) almost split sequences generate the group of all relations for the Grothendieck group of P ^<∞(Λ) if and only if P ^<∞(Λ) is of finite type. A similar statement is known to hold for the category of all finitely generated modules over an artin algebra, and was proven by C.M.Butler and M. Auslander ( [B] and [A]).     

Splitting methods for second‐order initial value problems

We consider implicit integration methods for the solution of stiff initial value problems for second-order differential equations of the special form y' = f(y). In implicit methods, we are faced with the problem of solving systems of implicit relations. This paper focuses on the construction and analysis of iterative solution methods which are effective in cases where the Jacobian of the right‐hand side of the differential equation can be split into a sum of matrices with a simple structure. These iterative methods consist of the modified Newton method and an iterative linear solver to deal with the linear Newton systems. The linear solver is based on the approximate factorization of the system matrix associated with the linear Newton systems. A number of convergence results are derived for the linear solver in the case where the Jacobian matrix can be split into commuting matrices. Such problems often arise in the spatial discretization of time‐dependent partial differential equations. Furthermore, the stability matrix and the order of accuracy of the integration process are derived in the case of a finite number of iterations. This revised version was published online in August 2006 with corrections to the Cover Date.     

The Structural Nature of the Nerve Functor for n-Groupoids

Given a left exact category B, the construction of the nerve functor _n for n-groupoids in B is related to a certain property of the category S-S i m p l _{n – 1} B of the split (n – 1)-truncated simplicial objects in B, which allows us to define the split n-truncated simplicial objects in B completely internally to S-S i m p l _{n – 1} B and thus to construct intrisincally from it the category S-S i m p l _n B.