On maximal element theorems,variants of Ekeland’s variational principle and their applications

In this paper, we establish several different versions of generalized Ekeland’s variational principle and maximal element theorem for τ$\tau$-functions in ?$?$ complete metric spaces. The equivalence relations between maximal element theorems, generalized Ekeland’s variational principle, generalized Caristi’s (common) fixed point theorems and nonconvex maximal element theorems for maps are also proved. Moreover, we obtain some applications to a nonconvex minimax theorem, nonconvex vectorial equilibrium theorems and convergence theorems in complete metric spaces.     

Generalized Newton’s method based on graphical derivatives

This paper concerns developing a numerical method of the Newton type to solve systems of nonlinear equations described by nonsmooth continuous functions. We propose and justify a new generalized Newton algorithm based on graphical derivatives, which have never been used to derive a Newton-type method for solving nonsmooth equations. Based on advanced techniques of variational analysis and generalized differentiation, we establish the well-posedness of the algorithm, its local superlinear convergence, and its global convergence of the Kantorovich type. Our convergence results hold with no semismoothness and Lipschitzian assumptions, which is illustrated by examples. The algorithm and main results obtained in the paper are compared with well-recognized semismooth and B-differentiable versions of Newton’s method for nonsmooth Lipschitzian equations.     

An LQP-based descent method for structured monotone variational inequalities

This paper proposes a descent method to solve a class of structured monotone variational inequalities. The descent directions are constructed from the iterates generated by a prediction-correction method [B.S. He, Y. Xu, X.M. Yuan, A logarithmic-quadratic proximal prediction-correction method for structured monotone variational inequalities, Comput. Optim. Appl. 35 (2006) 19-46], which is based on the logarithmic-quadratic proximal method. In addition, the optimal step-sizes along these descent directions are identified to accelerate the convergence of the new method. Finally, some numerical results for solving traffic equilibrium problems are reported.     

Strict approximate solutions in set-valued optimization with applications to the approximate Ekeland variational principle

This work deals with strict solutions of set-valued optimization problems under the set optimality criterion. In this context, we introduce a new approximate solution concept and we obtain several properties of these solutions when the error is fixed and also for their limit behavior when the error tends to zero. Then we prove a general existence result, which is applied to obtain approximate Ekeland variational principles.     

Generalized abstract economy and systems of generalized vector quasi-equilibrium problems

The present paper is in two-fold. The first fold is devoted to the existence theory of equilibria for generalized abstract economy with a lower semicontinuous constraint correspondence and a fuzzy constraint correspondence defined on a noncompact/nonparacompact strategy set. In the second fold, we consider systems of generalized vector quasi-equilibrium problems for multivalued maps (for short, SGVQEPs) which contain systems of vector quasi-equilibrium problems, systems of generalized mixed vector quasi-variational inequalities and Debreu-type equilibrium problems for vector valued functions as special cases. By using the results of first fold, we establish some existence results for solutions of SGVQEPs.     

A critical point theorem via the Ekeland variational principle

The aim of this paper is to establish the existence of a local minimum for a continuously Gâteaux differentiable function, possibly unbounded from below, without requiring any weak continuity assumption. Several special cases are also emphasized. Moreover, a novel definition of Palais-Smale condition, which is more general than the usual one, is presented and a mountain pass theorem is pointed out. As a consequence, multiple critical points theorems are then established. Finally, as an example of applications, an elliptic Dirichlet problem with critical exponent is investigated.     

Sensitivity in mixed generalized vector quasiequilibrium problems with moving cones

In this paper, we consider a parametric generalized vector quasiequilibrium problem which is mixed in the sense that several different relations can simultaneously appear in this problem. The moving cones and other data of the problem are assumed to be set-valued maps defined in topological spaces and taking values in topological spaces or topological vector spaces. The main result of this paper gives general verifiable conditions for the solution mapping of this problem to be semicontinuous with respect to a parameter varying in a topological space. The result is proven with the help of notions of cone-semicontinuity of set-valued maps, weaker than the usual concepts of semicontinuity, and an assumption imposed on the set-valued map whose values are the dual cones of the corresponding values of the moving cones.     

Self-adaptive methods for general variational inequalities

It is well known that the general variational inequalities are equivalent to the fixed point problems and the Wiener-Hopf equations. In this paper, we use these alternative equivalent formulations to suggest and analyze some new self-adaptive iterative methods for solving the general variational inequalities. Our results can be viewed as a significant extension of the previously known results for variational inequalities. An example is given to illustrate the efficiency of the proposed method.     

Exact penalty functions and calmness for mathematical programming under nonlinear perturbations

In the present paper, the effects of nonlinear perturbations of constraint systems are considered over the relationship between calmness and exact penalization, within the context of mathematical programming with equilibrium constraints. Two counterexamples are provided showing that the crucial link between the existence of penalty functions and the property of calmness for perturbed problems is broken in the presence of general perturbations. Then, some properties from variational analysis are singled out, which are able to restore to a certain extent the broken link. Consequently, conditions on the value function associated to perturbed optimization problems are investigated in order to guarantee the occurrence of the above properties.     

On the Newton method for set-valued maps

The Newton method is one of the most powerful tools used to solve systems of nonlinear equations. Its set-valued generalization, considered in this work, allows one to solve also nonlinear equations with geometric constraints and systems of inequalities in a unified manner. The emphasis is given to systems of linear inequalities. The study of the well-posedness of the algorithm and of its convergence is fulfilled in the framework of modern variational analysis.     

A modified inexact implicit method for mixed variational inequalities

In this paper, we suggest and analyze an inexact implicit method with a variable parameter for mixed variational inequalities by using a new inexactness restriction. Under certain conditions, the global convergence of the proposed method is proved. Some preliminary computational results are given to illustrate the efficiency of the new inexactness restriction. The results proved in this paper may be viewed as improvement and refinement of the previously known results.     

Projection methods for a generalized system of nonconvex variational inequalities with different nonlinear operators

In this paper, we introduce and consider a new generalized system of nonconvex variational inequalities with different nonlinear operators. We establish the equivalence between the generalized system of nonconvex variational inequalities and the fixed point problems using the projection technique. This equivalent alternative formulation is used to suggest and analyze a general explicit projection method for solving the generalized system of nonconvex variational inequalities. Our results can be viewed as a refinement and improvement of the previously known results for variational inequalities.     

A superlinearly convergent strongly sub-feasible SSLE-type algorithm with working set for nonlinearly constrained optimization

In this paper, by means of a new efficient identification technique of active constraints and the method of strongly sub-feasible direction, we propose a new sequential system of linear equations (SSLE) algorithm for solving inequality constrained optimization problems, in which the initial point is arbitrary. At each iteration, we first yield the working set by a pivoting operation and a generalized projection; then, three or four reduced linear equations with a same coefficient are solved to obtain the search direction. After a finite number of iterations, the algorithm can produced a feasible iteration point, and it becomes the method of feasible directions. Moreover, after finitely many iterations, the working set becomes independent of the iterates and is essentially the same as the active set of the KKT point. Under some mild conditions, the proposed algorithm is proved to be globally, strongly and superlinearly convergent. Finally, some preliminary numerical experiments are reported to show that the algorithm is practicable and effective.     

A two-stage prediction–correction method for solving monotone variational inequalities

In this paper, we present a two-stage prediction–correction method for solving monotone variational inequalities. The method generates the two predictors which should satisfy two acceptance criteria. We also enhance the method with an adaptive rule to update prediction step size which makes the method more effective. Under mild assumptions, we prove the convergence of the proposed method. Our proposed method based on projection only needs the function values, so it is practical and the computation load is quite tiny. Some numerical experiments were carried out to validate its efficiency and practicality.     

Existence of vector mixed variational inequalities in Banach spaces

The purpose of this paper is to study the solvability for vector mixed variational inequalities (for short, VMVI) in Banach spaces. Utilizing Ky Fan’s Lemma and Nadler’s theorem, we derive the solvability for VMVIs with compositely monotone vector multifunctions. On the other hand, we first introduce the concepts of compositely complete semicontinuity and compositely strong semicontinuity for vector multifunctions. Then we prove the solvability for VMVIs without monotonicity assumption by using these concepts and by applying Brouwer’s fixed point theorem. The results presented in this paper are extensions and improvements of some earlier and recent results in the literature.     

Strong convergence theorem by a new hybrid method for equilibrium problems and variational inequality problems

In this paper, we prove a strong convergence theorem for finding a common element of the set of solutions of an equilibrium problem and the set of the solutions of the variational inequality problem by using a new hybrid method. We obtain a new result for finding a solution of an equilibrium problem and the solutions of the variational inequality problem.     

Self-adaptive projection method for co-coercive variational inequalities

In some real-world problems, the mapping of the variational inequalities does not have any explicit forms and only the function value can be evaluated or observed for given variables. In this case, if the mapping is co-coercive, the basic projection method is applicable. However, in order to determine the step size, the existing basic projection method needs to know the co-coercive modulus in advance. In practice, usually even if the mapping can be characterized co-coercive, it is difficult to evaluate the modulus, and a conservative estimation will lead an extremely slow convergence. In view of this point, this paper presents a self-adaptive projection method without knowing the co-coercive modulus. We also give a real-life example to demonstrate the practicability of the proposed method.     

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.