In this short note, the objective of which is essentially pedagogical, we show that in the well-known problem which consists of minimizing the rank of a matrix, every admissible point is a local minimizer. Hence, in this problem like in various other ones, only global minimization matters....

The generalized Nash equilibrium is a Nash game, where not only the players’ cost functions, but also the constraints of a player depend on the rival players decisions. We present a globally convergent algorithm that is suited for the computation of a normalized Nash equilibrium in the...

We consider various kinds of solutions to nonsmooth vector equilibrium problems with functional constraints. By using first and second-order approximations as generalized derivatives, we establish both necessary and sufficient optimality conditions. Our first-order conditions are shown to be...

In this paper, we prove both weak and strong convergence theorems for finding a common element of the solution set for a generalized equilibrium problem, the fixed point set of an asymptotically k-strict pseudo-contraction mapping in the intermediate sense, and the solution set of the...

In this paper, we establish new formulae for computing and/or estimating the Fréchet subdifferential of the efficient point multifunction of a parametric vector optimization problem. These formulae are presented in a broad class of conventional vector optimization problems with the presence of...

An implicit algorithm for finding common fixed points of an uncountable family of nonexpansive mappings is proposed. A new inexact iteration method is also proposed for countable family of nonexpansive mappings. Several strong convergence theorems based on our main results are established in the...

We consider a model whereby players compete for a set of shared resources to produce and sell substitute products in the same market, which can be viewed as a generalization of the classical Cournot oligopolistic competition model, or, from a different angle, the Wardrop type routing model. In...

The aim of this paper is to present a stochastic maximum principle for an optimal control problem of switching systems. It presents necessary conditions of optimality in the form of a maximum principle for stochastic switching systems, in which the dynamic of the constituent processes takes the...

In this paper, by virtue of the separation theorem of convex sets, we prove a minimax theorem, a cone saddle point theorem and a Ky Fan minimax theorem for a scalar set-valued mapping under nonconvex assumptions of its domains, respectively. As applications, we obtain an existence result for the...

Our purpose in this paper is to prove strong convergence theorem for finding a common element of the set of common fixed points of a one-parameter nonexpansive semigroup and the set of solutions to a system of equilibrium problems in a real Hilbert space using a new iterative method. Finally, we...