Related papers: The common solutions to pseudomonotone equilibrium…
We study equilibrium problems in Hadamard spaces, which extend variational inequalities and many other problems in nonlinear analysis. In this paper, first we study the existence of solutions of equilibrium problems associated with…
It is well known that the projection method is not convergent for monotone equilibrium problems. Recently Sosa \textit{et al.} in \cite{SS2011} proposed a projection algorithm ensuring convergence for paramonotone equilibrium problems. In…
In this paper, we propose new extragradient algorithms for solving a split equilibrium and nonexpansive mapping SEPNM($C, Q, A, f, g, S, T)$ where $C, Q$ are nonempty closed convex subsets in real Hilbert spaces $\mathcal{H}_1,…
We consider a bilevel problem involving two monotone equilibrium bifunctions and we show that this problem can be solved by a proximal point method with generalized proximal distances. We propose a framework for the convergence analysis of…
In this paper, we introduce a new hybrid algorithm for solving equilibrium problems. The algorithm combines the extragradient method and the hybrid (outer approximation) method. In this algorithm, only an optimization program is solved at…
We consider scalar equilibrium problems governed by a bifunction in a finite-dimensional framework. By using classical arguments in Convex Analysis, we show that under suitable generalized convexity assumptions imposed on the bifunction,…
This work is devoted to establish the strong convergence results of an iterative algorithm generated by the shrinking projection method in Hilbert spaces. The proposed approximation sequence is used to find a common element in the set of…
In this paper we propose a general methodology for solving a broad class of continuous, multifacility location problems, in any dimension and with $\ell_\tau$-norms proposing two different methodologies: 1) by a new second order cone mixed…
We present an algorithm based on continuation techniques that can be applied to solve numerically minimization problems with equality constraints. We focus on problems with a great number of local minima which are hard to obtain by local…
Submodular functions allow to model many real-world optimisation problems. This paper introduces approaches for computing diverse sets of high quality solutions for submodular optimisation problems. We first present diversifying greedy…
This paper introduces a subgradient extragradient algorithm with a conjugate gradient-type direction to solve pseudomonotone variational inequality problems in Hilbert spaces. The algorithm features a self-adaptive strategy that eliminates…
In this article we present first an algorithm for calculating the determining equations associated with so-called ``nonclassical method'' of symmetry reductions (a la Bluman and Cole) for systems of partial differentail equations. This…
In this paper we propose two strongly convergent parallel hybrid iterative methods for finding a common element of the set of fixed points of a family of quasi $\phi$-asymptotically nonexpansive mappings $\{F(S_j)\}_{j=1}^N$, the set of…
A system of two operator equations is considered - one of pseudomonotone type and the other of strongly monotone type - both being strongly coupled. Conditions are given that allow to reduce the solvability of this system to a single…
We attempt to provide an algorithm for approximating a solution of the quasiconvex equilibrium problem that was proved to exist by K. Fan 1972. The proposed algorithm is an iterative procedure, where the search direction at each iteration…
In this paper, we introduce a new iterative method to find a common solution of a generalized mixed equilibrium problem, a variational inequality problem and a hierarchical fixed point problem for a demicontinuous nearly nonexpansive…
In this paper, we generalize the classical extragradient algorithm for solving variational inequality problems by utilizing nonzero normal vectors of the feasible set. In particular, conceptual algorithms are proposed with two different…
We describe, study, and experiment with an algorithm for finding all solutions of systems of polynomial equations using homotopy continuation and monodromy. This algorithm follows a framework developed in previous work and can operate in…
A block decomposition method is proposed for minimizing a (possibly non-convex) continuously differentiable function subject to one linear equality constraint and simple bounds on the variables. The proposed method iteratively selects a…
We consider continuous linear programs over a continuous finite time horizon $T$, with a constant coefficient matrix, linear right hand side functions and linear cost coefficient functions, where we search for optimal solutions in the space…