Retraction algorithms for solving variational inequalities,pseudomonotone equilibrium problems,and fixed-point problems in Banach spaces

In this paper, using sunny generalized nonexpansive retractions which are different from the metric projection and generalized metric projection in Banach spaces, we present new extragradient and line search algorithms for finding the solution of a J-variational inequality whose constraint set is the common elements of the set of fixed points of a family of generalized nonexpansive mappings and the set of solutions of a pseudomonotone J-equilibrium problem for a J -α-inverse-strongly monotone operator in a Banach space. To prove strong convergence of generated iterates in the extragradient method, we introduce a ? _?-Lipschitz-type condition and assume that the equilibrium bifunction satisfies this condition. This condition is unnecessary when the line search method is used instead of the extragradient method. Using FMINCON optimization toolbox in MATLAB, we give some numerical examples and compare them with several existence results in literature to illustrate the usability of our results.     

Solution of boundary value problems for surfaces of prescribed mean curvature <Emphasis Type="Italic">H</Emphasis> (<Emphasis Type="Italic">x,y, z</Emphasis>) with 1–1 central projection via the continuity method

When we consider surfaces of prescribed mean curvature H with a one-to-one orthogonal projection onto a plane, we have to study the nonparametric H-surface equation. Now the H-surfaces with a one-to-one central projection onto a plane lead to an interesting elliptic differential equation, which has been discovered for the case H = 0 already by T. Radó in 1932. We establish the uniqueness of the Dirichlet problem for this H-surface equation in central projection and develop an estimate for the maximal deviation of large H-surfaces from their boundary values, resembling an inequality by J. Serrin from 1969.We solve the Dirichlet problem for nonvanishing H with compact support via a nonlinear continuity method. Here we introduce conformal parameters into the surface and study the well-known H-surface system. Then we combine these investigations with a differential equation for its unit normal, which has been developed by the author for variable H in 1982. Furthermore, we construct large H-surfaces bounding extreme contours by an approximation.Here we only provide an overview on the relevant proofs; for the more detailed derivations of our results, we refer the readers to the author’s investigations in the Pacific Journal of Mathematics and the Milan Journal of Mathematics.     

Fast separation for the three-index assignment problem

A critical step in a cutting plane algorithm is separation, i.e., establishing whether a given vector x violates an inequality belonging to a specific class. It is customary to express the time complexity of a separation algorithm in the number of variables n. Here, we argue that a separation algorithm may instead process the vector containing the positive components of x,  denoted as supp(x),  which offers a more compact representation, especially if x is sparse; we also propose to express the time complexity in terms of |supp(x)|. Although several well-known separation algorithms exploit the sparsity of x,  we revisit this idea in order to take sparsity explicitly into account in the time-complexity of separation and also design faster algorithms. We apply this approach to two classes of facet-defining inequalities for the three-index assignment problem, and obtain separation algorithms whose time complexity is linear in |supp(x)| instead of n. We indicate that this can be generalized to the axial k-index assignment problem and we show empirically how the separation algorithms exploiting sparsity improve on existing ones by running them on the largest instances reported in the literature.     

Two algorithms for solving single-valued variational inequalities and fixed point problems

In this paper, we suggest two new iterative methods for finding a common element of the solution set of a variational inequality problem and the set of fixed points of a contraction mapping in Hilbert space. We also present weak and strong convergence theorems for these new methods, provided that the fixed point mapping is a θ-strict pseudocontraction and the mapping associated with the variational inequality problem is monotone. The results presented in this paper improve and unify important recent results announced by many authors.     

Construction algorithms for a class of monotone variational inequalities

This paper is devoted to solve the following monotone variational inequality of finding \(x^*\in \mathrm{Fix}(T)\) such that

$$\begin{aligned} \langle Ax^*,x-x^*\rangle \ge 0,\quad \forall x\in \mathrm{Fix}(T), \end{aligned}$$

where A is a monotone operator and \(\mathrm{Fix}(T)\) is the set of fixed points of nonexpansive operator T. For this purpose, we construct an implicit algorithm and prove its convergence hierarchical to the solution of above monotone variational inequality.

     

Strong convergence theorem by a hybrid extragradient-like approximation method for variational inequalities and fixed point problems

The purpose of this paper is to investigate the problem of finding a common element of the set of fixed points F(S) of a nonexpansive mapping S and the set of solutions Ω _A of the variational inequality for a monotone, Lipschitz continuous mapping A. We introduce a hybrid extragradient-like approximation method which is based on the well-known extragradient method and a hybrid (or outer approximation) method. The method produces three sequences which are shown to converge strongly to the same common element of \({F(S)\cap\Omega_{A}}\). As applications, the method provides an algorithm for finding the common fixed point of a nonexpansive mapping and a pseudocontractive mapping, or a common zero of a monotone Lipschitz continuous mapping and a maximal monotone mapping.     

Computational complexity of the original and extended diophantine Frobenius problem

We deduce the law of nonstationary recursion which makes it possible, for given a primitive set A = {a ₁,...,a _k }, k > 2, to construct an algorithm for finding the set of the numbers outside the additive semigroup generated by A. In particular, we obtain a new algorithm for determining the Frobenius numbers g(a ₁,...,a _k ). The computational complexity of these algorithms is estimated in terms of bit operations. We propose a two-stage reduction of the original primitive set to an equivalent primitive set that enables us to improve complexity estimates in the cases when the two-stage reduction leads to a substantial reduction of the order of the initial set.     

A proof of Frankl’s union-closed sets conjecture for dismantlable lattices

For a lattice L, let Princ(L) denote the ordered set of principal congruences of L. In a pioneering paper, G. Grätzer characterized the ordered set Princ(L) of a finite lattice L; here we do the same for a countable lattice. He also showed that every bounded ordered set H is isomorphic to Princ(L) of a bounded lattice L. We prove a related statement: if an ordered set H with a least element is the union of a chain of principal ideals (equivalently, if 0 \({\in}\) H and H has a cofinal chain), then H is isomorphic to Princ(L) of some lattice L.     

Approximation of an optimal control problem in coefficient for variational inequality with anisotropic <Emphasis Type="Italic">p</Emphasis>-Laplacian

We study an optimal control problem for a variational inequality with the so-called anisotropic p-Laplacian in the principle part of this inequality. The coefficients of the anisotropic p-Laplacian, the matrix A(x), we take as a control. The optimal control problem is to minimize the discrepancy between a given distribution \({y_d \in L^{2}(\Omega)}\) and the solutions \({y \in K \subset W^{1,p}_{0}(\Omega)}\) of the corresponding variational inequality. We show that the original problem is well-posed and derive existence of optimal pairs. Since the anisotropic p-Laplacian inherits the degeneracy with respect to unboundedness of the term \({|(A(x)\nabla y, \nabla y)_{\mathbb{R}^N}|^{\frac{p-2}{2}}}\), we introduce a two-parameter model for the relaxation of the original problem. Further we discuss the asymptotic behavior of relaxed solutions and show that some optimal pairs to the original problem can be attained by the solutions of two-parametric approximated optimal control problems.     

Minimization of equilibrium problems,variational inequality problems and fixed point problems

In this paper, we devote to find the solution of the following quadratic minimization problem

$\min_{x\in \Omega}\|x\|^2,$

where Ω is the intersection set of the solution set of some equilibrium problem, the fixed points set of a nonexpansive mapping and the solution set of some variational inequality. In order to solve the above minimization problem, we first construct an implicit algorithm by using the projection method. Further, we suggest an explicit algorithm by discretizing this implicit algorithm. Finally, we prove that the proposed implicit and explicit algorithms converge strongly to a solution of the above minimization problem.

     

Homogenization of variational inequalities for a biharmonic operator with constraints on subsets <Emphasis Type="Italic">ε</Emphasis>-periodically placed along a manifold of large dimension

Behavior of solutions of variational inequalities for a biharmonic operator is studied. These inequalities correspond to one-sided constraints on subsets of a domain Ω placed ε-periodically. All possible behavior types of solutions u _ε of variational inequalities are considered for ε → 0 depending on relations between small parameters, which are the structure period ε and the contraction coefficient a _ε of subsets where one-sided constraints are posed.     

Stability of capture into parametric autoresonance

We consider nonlinear elliptic second-order variational inequalities with degenerate (with respect to the spatial variable) and anisotropic coefficients and L ¹-data. We study the cases where the set of constraints belongs to a certain anisotropic weighted Sobolev space and to a larger function class. In the first case, some new properties of T-solutions and shift T-solutions of the investigated variational inequalities are established. Moreover, the notion of W ^1,1-regular T-solution is introduced, and a theorem of existence and uniqueness of such a solution is proved. In the second case, we introduce the notion of T-solution of the variational inequalities under consideration and establish conditions of existence and uniqueness of such a solution.     

Finite groups with given σ-embedded and σ-n-embedded subgroups

Let G be a finite group and σ = {σ _i |i∈I} be a partition of the set of all primes P. A set H of subgroups of G is said to be a complete Hall σ-set of G if every non-identity member of H is a Hall σ _i -subgroup of G and H contains exactly one Hall σ _i -subgroup of G for every σ _i ∈ σ(G). A subgroup H is said to be σ-permutable if G possesses a complete Hall σ-set H such that HA ^x = A ^x H for all A ∈ H and all x ∈ G. Let H be a subgroup of G. Then we say that: (1) H is σ-embedded in G if there exists a σ-permutable subgroup T of G such that HT = H ^σG and H ∩ T ≤ H _σG , where H _σG is the subgroup of H generated by all those subgroups of H which are σ-permutable in G, and H ^σG is the σ-permutable closure of H, that is, the intersection of all σ-permutable subgroups of G containing H. (2) H is σ-n-embedded in G if there exists a normal subgroup T of G such that HT = H ^G and H ∩ T ≤ H _σG . In this paper, we study the properties of the new embedding subgroups and use them to determine the structure of finite groups.     

Primitive elements in the matroid-minor Hopf algebra

We introduce the matroid-minor coalgebra C, which has labeled matroids as distinguished basis and coproduct given by splitting a matroid into a submatroid and complementary contraction in all possible ways. We introduce two new bases for C; the first of these is related to the distinguished basis by Möbius inversion over the rank-preserving weak order on matroids, the second by Möbius inversion over the suborder excluding matroids that are irreducible with respect to the free product operation. We show that the subset of each of these bases corresponding to the set of irreducible matroids is a basis for the subspace of primitive elements of C. Projecting C onto the matroid-minor Hopf algebra H, we obtain bases for the subspace of primitive elements of H.     

Laguerre deconvolution with unknown matrix operator

In this paper we consider the convolutionmodel Z = X + Y withX of unknown density f, independent of Y, when both random variables are nonnegative. Our goal is to estimate the unknown density f of X from n independent identically distributed observations of Z, when the law of the additive process Y is unknown. When the density of Y is known, a solution to the problem has been proposed in [17]. To make the problem identifiable for unknown density of Y, we assume that we have access to a preliminary sample of the nuisance process Y. The question is to propose a solution to an inverse problem with unknown operator. To that aim, we build a family of projection estimators of f on the Laguerre basis, well-suited for nonnegative random variables. The dimension of the projection space is chosen thanks to a model selection procedure by penalization. At last we prove that the final estimator satisfies an oracle inequality. It can be noted that the study of the mean integrated square risk is based on Bernstein’s type concentration inequalities developed for random matrices in [23].     

The column-sufficiency and row-sufficiency of the linear transformation on Hilbert spaces

Given a real Hilbert space H with a Jordan product and \({\Omega\subset H}\) being the Lorentz cone, \({q\in H}\), and let T : H → H be a bounded linear transformation, the corresponding linear complementarity problem is denoted by LCP(T, Ω, q). In this paper, we introduce the concepts of the column-sufficiency and row-sufficiency of T. In particular, we show that the row-sufficiency of T is equivalent to the existence of the solution of LCP(T, Ω, q) under an operator commutative condition; and that the column-sufficiency along with cross commutative property is equivalent to the convexity of the solution set of LCP(T, Ω, q). In our analysis, the properties of the Jordan product and the Lorentz cone in H are interconnected.     

Approximation of Gaussian Random Fields: General Results and Optimal Wavelet Representation of the Lévy Fractional Motion

We investigate the approximation rate for certain centered Gaussian fields by a general approach. Upper estimates are proved in the context of so–called Hölder operators and lower estimates follow from the eigenvalue behavior of some related self–adjoint integral operator in a suitable L ₂(μ)–space. In particular, we determine the approximation rate for the Lévy fractional Brownian motion X _H with Hurst parameter H∈(0,1), indexed by a self–similar set T?? ^N of Hausdorff dimension D. This rate turns out to be of order n ^?H/D (log?n)^1/2. In the case T=[0,1] ^N we present a concrete wavelet representation of X _H leading to an approximation of X _H with the optimal rate n ^?H/N (log?n)^1/2.     

On control of the prime spectrum of a finite simple group

The set π(G) of all prime divisors of the order of a finite group G is often called its prime spectrum. It is proved that every finite simple nonabelian group G has sections H ₁, …, H _m of some special form such that π(H ₁)∪…∪π(H _m ) = π(G) and m ≤ 5. Moreover, m ≤ 2 if G is an alternating or classical simple group. In all cases, it is possible to choose the sections H _i so that each of them is a simple nonabelian group, a Frobenius group, or (in one case) a dihedral group. If the above equality holds for a finite group G, then we say that the set {H ₁,…,H _m } controls the prime spectrum of G. We also study some parameter c(G) of finite groups G related to the notion of control.     

<Emphasis Type="Italic">r</Emphasis>-Dynamic Chromatic Number of Some Line Graphs

An r-dynamic coloring of a graph G is a proper coloring c of the vertices such that |c(N(v))| ≥ min {r, deg(v)}, for each v ∈ V (G). The r-dynamic chromatic number of a graph G is the smallest k such that G admits an r-dynamic coloring with k colors. In this paper, we obtain the r-dynamic chromatic number of the line graph of helm graphs H_n for all r between minimum and maximum degree of H_n. Moreover, our proofs are constructive, what means that we give also polynomial time algorithms for the appropriate coloring. Finally, as the first, we define an equivalent model for edge coloring.