Search

The problem of finding minima of weakly sequentially lower semicontinuous functions on reflexive Banach spaces is studied by means of convex and nonconvex subdifferentials. Finding a descent direction for a non-stationary point is a question of importance for many optimization algorithms. The existence or non-existence of such a direction is clarified through several theorems and a series of selective examples. For the general problem, a notion called radius of descent is proposed and shown to be useful for the analysis related to descent directions. [ABSTRACT FROM AUTHOR]

In the present paper, we study the finite termination of sequences generated by inexact proximal point algorithms for finding zeroes of a maximal monotone (set-valued) operator $$T$$ on a Hilbert space. Under some mild conditions, we get that a sequence generated by inexact proximal point algorithm stops after a finite number of iterations. Our results extend the corresponding results in Rockafellar (SIAM J Control Optim 14:877-898, ). In particular, for optimization problems, our results improve corresponding results in Ferris (Math Progr 50:359-366, ). As applications, we obtain finite termination of projected gradient method. [ABSTRACT FROM AUTHOR]

In this paper, we study second-order necessary optimality conditions for a discrete optimal control problem with a nonconvex cost function and control constraints. By establishing an abstract result on second-order necessary optimality conditions for a mathematical programming problem, we derive second-order optimality conditions for a discrete optimal control problem. [ABSTRACT FROM AUTHOR]

The aim of this paper is to define a generalized monotone mapping, which is the sum of symmetric cocoercive mapping and symmetric monotone mapping. The resolvent operator associated with generalized monotone mapping is defined and some of its properties are shown. We solve a variational inclusion problem using these new concepts. For illustration, some examples are given. [ABSTRACT FROM AUTHOR]

In this paper, without using any regularity assumptions, we derive a new exact formula for computing the Fréchet coderivative and an exact formula for the Mordukhovich coderivative of normal cone mappings to perturbed polyhedral convex sets. Our development establishes generalizations and complements of the existing results on the topic. An example to illustrate formulae is given. [ABSTRACT FROM AUTHOR]

We deal with a common fixed point problem for a family of quasinonexpansive mappings defined on a Hilbert space with a certain closedness assumption and obtain strongly convergent iterative sequences to a solution to this problem. We propose a new type of iterative scheme for this problem. A feature of this scheme is that we do not use any projections, which in general creates some difficulties in practical calculation of the iterative sequence. We also prove a strong convergence theorem by the shrinking projection method for a family of such mappings. These results can be applied to common zero point problems for families of monotone operators. [ABSTRACT FROM AUTHOR]

This paper is devoted to the study of the stability of the solution map for the parametric convex semi-infinite optimization problem under convex function perturbations in short, PCSI. We establish sufficient conditions for the pseudo-Lipschitz property of the solution map of PCSI under perturbations of both objective function and constraint set. The main result obtained is new even when the problems under consideration reduce to linear semi-infinite optimization. Examples are given to illustrate the obtained results. [ABSTRACT FROM AUTHOR]

This paper studies a general vector optimization problem of finding weakly efficient points for mappings from Hilbert spaces to arbitrary Banach spaces, where the latter are partially ordered by some closed, convex, and pointed cones with nonempty interiors. To find solutions of this vector optimization problem, we introduce an auxiliary variational inequality problem for a monotone and Lipschitz continuous mapping. The approximate proximal method in vector optimization is extended to develop a hybrid approximate proximal method for the general vector optimization problem under consideration by combining an extragradient method to find a solution of the variational inequality problem and an approximate proximal point method for finding a root of a maximal monotone operator. In this hybrid approximate proximal method, the subproblems consist of finding approximate solutions to the variational inequality problem for monotone and Lipschitz continuous mapping, and then finding weakly efficient points for a suitable regularization of the original mapping. We present both absolute and relative versions of our hybrid algorithm in which the subproblems are solved only approximately. The weak convergence of the generated sequence to a weak efficient point is established under quite mild assumptions. In addition, we develop some extensions of our hybrid algorithms for vector optimization by using Bregman-type functions. [ABSTRACT FROM AUTHOR]

This paper deals with the generalized Clarke epiderivative of the extremum (or efficient point) multifunction in parametric vector optimization problems. The formulas for computing and/or estimating the generalized Clarke epiderivative of this extremum multifunction are given in terms of the Clarke tangent cone to the graph of a multifunction or the constraint mapping and/or the Fréchet derivative of the objective function. An application to semi-infinite programming is given. [ABSTRACT FROM AUTHOR]

We consider an iterative scheme for finding a common element of the set of solutions of a pseudomonotone, Lipschitz-continuous variational inequality problem and the set of common fixed points of N nonexpansive mappings. The proposed iterative method combines two well-known schemes: extragradient and approximate proximal methods. We derive a necessary and sufficient condition for weak convergence of the sequences generated by the proposed scheme. [ABSTRACT FROM AUTHOR]

Recently, O’Hara, Pillay and Xu (Nonlinear Anal. 54, 1417–1426, ) considered an iterative approach to finding a nearest common fixed point of infinitely many nonexpansive mappings in a Hilbert space. Very recently, Takahashi and Takahashi (J. Math. Anal. Appl. 331, 506–515, ) introduced an iterative scheme by the viscosity approximation method for finding a common element of the set of solutions of an equilibrium problem and the set of fixed points of a nonexpansive mapping in a Hilbert space. In this paper, motivated by these authors’ iterative schemes, we introduce a new iterative approach to finding a common element of the set of solutions of an equilibrium problem and the set of common fixed points of infinitely many nonexpansive mappings in a Hilbert space. The main result of this work is a strong convergence theorem which improves and extends results from the above mentioned papers. [ABSTRACT FROM AUTHOR]

The purpose of this paper is to introduce and study two hybrid proximal-point algorithms for finding a common element of the set of solutions of an equilibrium problem and the set of solutions to the equation 0∈ Tx for a maximal monotone operator T in a uniformly smooth and uniformly convex Banach space X. Strong and weak convergence results of these two hybrid proximal-point algorithms are established, respectively. [ABSTRACT FROM AUTHOR]

In this paper, the hybrid steepest descent methods are extended to develop new iterative schemes for finding the zeros of bounded, demicontinuous and φ-strongly accretive mappings in uniformly smooth Banach spaces. Two iterative schemes are proposed. Strong convergence results are established and applications to variational inequalities are given. [ABSTRACT FROM AUTHOR]

We introduce an implicit iteration scheme with a perturbed mapping for finding a common element of the set of solutions of an equilibrium problem and the set of common fixed points of finitely many nonexpansive mappings in a Hilbert space. Then, we establish some convergence theorems for this implicit iteration scheme which are connected with results by Xu and Ori (Numer. Funct. Analysis Optim. 22:767–772, ), Zeng and Yao (Nonlinear Analysis, Theory, Methods Appl. 64:2507–2515, ) and Takahashi and Takahashi (J. Math. Analysis Appl. 331:506–515, ). In particular, necessary and sufficient conditions for strong convergence of this implicit iteration scheme are obtained. [ABSTRACT FROM AUTHOR]

We extend some results due to Thanh-Hao (Acta Math. Vietnam. 31: 283-289, 2006) and Noor (J. Optim. Theory Appl. 115:447-452, 2002). The first paper established a convergence theorem for the Tikhonov regularization method (TRM) applied to finite-dimensional pseudomonotone variational inequalities (VIs), answering in the affirmative an open question stated by Facchinei and Pang (Finite- Dimensional Variational Inequalities and Complementarity Problems, Springer, New York, 2003). The second paper discussed the application of the proximal point algorithm (PPA) to pseudomonotone VIs. In this paper, new facts on the convergence of TRM and PPA (both the exact and inexact versions of PPA) for pseudomonotone VIs in Hilbert spaces are obtained and a partial answer to a question stated in (Acta Math. Vietnam. 31:283-289, 2006) is given. As a byproduct, we show that the convergence theorem for inexact PPA applied to infinite-dimensional monotone variational inequalities can be proved without using the theory of maximal monotone operators. [ABSTRACT FROM AUTHOR]

We discuss the lower semicontinuity of the set of efficient solutions for parametric generalized systems with monotone bifunctions in real locally convex Hausdorff topological vector spaces. [ABSTRACT FROM AUTHOR]

We introduce the concept of positive proper efficient solutions to the generalized system in this paper. We show that, under some suitable conditions, the set of positive proper efficient solutions is dense in the set of efficient solutions to the generalized system. We discuss also the connectedness of the set of efficient solutions for the generalized system with monotone bifunctions in real locally convex Hausdorff topological vector spaces. [ABSTRACT FROM AUTHOR]

By means of generalized KKM theory, we prove a result on the existence of solutions and we establish general variational principles, that is, vector optimization formulations of set-valued maps for vector generalized systems. A perturbation function is involved in general variational principles. We extend the theory of gap functions for vector variational inequalities to vector generalized systems and we prove that the solution sets of the related vector optimization problems of set-valued maps contain the solution sets of vector generalized systems. A further vector optimization problem is defined in such a way that its solution set coincides with the solution set of a weak vector generalized system. [ABSTRACT FROM AUTHOR]

In this paper, we consider a generalized vector variational-like inequality problem (for short, GVVLIP), which includes generalized vector variational inequalities, vector variational inequalities and classical variational inequalities as special cases. The concepts of generalized C-pseudomonotone-like and generalized H-hemicontinuous-like operators are introduced. Some existence results for GVVLIP are obtained under the assumptions of generalized C-pseudomonotone-like property and generalized H-hemicontinuous-like property. These results appear to be new and interesting. New existence results of the classical variational inequality are also obtained. [ABSTRACT FROM AUTHOR]

We study the following generalized quasivariational inequality problem: given a closed convex set X in a normed space E with the dual E*, a multifunction Φ : X→2E* and a multifunction Г : X→2x, find a point ( ^, Ẑ) ϵ X×E* such that ^ ϵ Г( ^), Ẑ ϵ Φ(^), ⟨Ẑ, ^ -y⟩ ⩽ 0, ∀y ϵ Г( ^).We prove some existence theorems in which Φ may be discontinuous, X may be unbounded, and Г is not assumed to be Hausdorff lower semicontinuous. [ABSTRACT FROM AUTHOR]

In this paper, we investigate the strong convergence of an inexact proximalpoint algorithm. It is known that the proximal-point algorithm converges weakly to a solution of a maximal monotone operator, but fails to converge strongly. Solodov and Svaiter (Math. Program. 87:189–202, 2000) introduced a new proximal-type algorithm to generate a strongly convergent sequence and established a convergence result in Hilbert space. Subsequently, Kamimura and Takahashi (SIAM J. Optim. 13:938–945, 2003) extended the Solodov and Svaiter result to the setting of uniformly convex and uniformly smooth Banach space. On the other hand, Rockafellar (SIAM J. Control Optim. 14:877–898, 1976) gave an inexact proximal-point algorithm which is more practical than the exact one. Our purpose is to extend the Kamimura and Takahashi result to a new inexact proximal-type algorithm. Moreover, this result is applied to the problem of finding the minimizer of a convex function on a uniformly convex and uniformly smooth Banach space. [ABSTRACT FROM AUTHOR]

In this paper, a gap function for a system of vector equilibrium problems is introduced and studied. Some necessary and sufficient conditions for the system of vector equilibrium problems are established. Characterizations of the solutions set for the system of vector equilibrium problems are also derived. Furthermore, some existence results of solutions for the system of vector equilibrium problems are proved. [ABSTRACT FROM AUTHOR]

In this paper, by employing the notion of generalized projection operators and the well-known Fan's lemma, we establish some existence results for the variational inequality problem and the quasivariational inequality problem in reflexive, strictly convex, and smooth Banach spaces. We propose also an iterative method for approximate solutions of the variational inequality problem and we establish some convergence results for this iterative method. [ABSTRACT FROM AUTHOR]

In this paper, we are interested in the existence of solutions for a class of noncoercive variational inequalities involving a p-Laplacian type operator. Our approach is based essentially on equilibrium problems and arguments from recession analysis. Our results are of two types: the first is obtained in a monotone framework; the second is obtained without a monotonicity assumption. [ABSTRACT FROM AUTHOR]

Assume that F is a nonlinear operator on a real Hilbert space H which is η-strongly monotone and κ-Lipschitzian on a nonempty closed convex subset C of H. Assume also that C is the intersection of the fixed-point sets of a finite number of nonexpansive mappings on H. We construct an iterative algorithm with variable parameters which generates a sequence {Xn} from an arbitrary initial point X0 ϵ H. The sequence {Xn} is shown to converge in norm to the unique solution u∗ of the variational inequality ⟨F(u∗), v - u∗⟩ ⩾ 0, ∀v ϵ C. [ABSTRACT FROM AUTHOR]

In this paper, we study a class of general monotone equilibrium problems in a real Hilbert space which involves a monotone differentiable bifunction. For such a bifunction, a skew-symmetric type property with respect to the partial gradients is established. We suggest to solve this class of equilibrium problems with the modified combined relaxation method involving an auxiliary procedure. We prove the existence and uniqueness of the solution to the auxiliary variational inequality in the auxiliary procedure. Further, we prove also the weak convergence of the modified combined relaxation method by virtue of the monotonicity and the skew-symmetric type property. [ABSTRACT FROM AUTHOR]

This paper introduces an iterative method for finding approximate solutions of a set-valued mixed quasivariational inequality in the setting of a Banach space. Existence of a solution of this rather general problem and the convergence of the proposed iterative method to a solution are established. [ABSTRACT FROM AUTHOR]

In this paper, we consider an implicit quasivariational inequality without continuity assumptions in normed spaces. The main result (Theorem 2.1) provides an infinite-dimensional version of Theorem 3.2 in Ref. 1. To achieve such a goal, we employ Theorem 3.2 in Ref. 1 and the technique of Cubiotti in Ref. 2. In particular, Theorem 3.1 covers a recent result of Cubiotti (Theorem 3.1 of Ref. 2) as a special case. [ABSTRACT FROM AUTHOR]

By applying the maximal element theorems on product of G-convex spaces due to the first author, some equilibrium existence theorems for generalized games with fuzzy constraint correspondences are proved in G-convex spaces. As applications, some existence theorems of solutions for the system of generalized vector quasiequilibrium problems are established in noncompact product of G-convex spaces. Our results improve and generalize some recent results in the literature to product of G-convex spaces. [ABSTRACT FROM AUTHOR]

In this paper, we introduce mathematical programs with vector optimization constraints. For these problems, we establish two models in both the weak Pareto solution and Pareto solution setting. Some new existence results are obtained under rather weak conditions. We establish also equivalences between mathematical programs with vector optimization constraints and mathematical programs with vector variational inequality constraints. [ABSTRACT FROM AUTHOR]

We consider a general class of equilibrium problems which involve a single-valued mapping and a nonsmooth bifunction. Such mixed equilibrium problems are solved with a combined relaxation method using an auxiliary iteration of a splitting-type method for constructing a separating hyperplane. We prove the convergence of the method under the assumption that the dual of the mixed equilibrium problem is solvable. Convergence rates are also derived. [ABSTRACT FROM AUTHOR]

The auxiliary principle technique is extended to study the generalized strongly nonlinear mixed variational-like inequality problem for set-valued mappings without compact values. We establish first the existence of a solution of the related auxiliary problem. Then, the iterative algorithm for solving that problem is given by using this existence result. Moreover, the existence of a solution of the original problem and the convergence of iterative sequences generated by the algorithm are both derived. [ABSTRACT FROM AUTHOR]

Let Z and X be Hausdorff real topological vector spaces and let Lb(X, Z) be the space of continuous linear mappings from X into Z equipped with the topology of bounded convergence. In this paper, we define the (S)+ condition for operators from a nonempty subset of X into Lb(X, Z) and derive some existence results for vector variational inequalities with operators of the class (S)+. Some applications to vector complementarity problems are given. [ABSTRACT FROM AUTHOR]