Results 91 to 100 of about 270 (155)

Continuity of solution maps of parametric quasiequilibrium problems

open access: yes
Parametric vector quasiequilibrium problems, Solution maps, Lower semicontinuity, Hausdorff lower semicontinuity, Upper semicontinuity, Continuity, Generalized concavity, Generalized pseudomonotonicity, 90C31, 49J40, 49K40,
Lam Anh, Phan Khanh
core   +1 more source

Splitting Methods for Pseudomonotone Mixed Variational Inequalities

open access: yesJournal of Mathematical Analysis and Applications, 2000
The author analyzes some algorithms for solving a monotone mixed variational inequality \(\;\langle Tu,v-u\rangle + \varphi (v)-\varphi(u)\geq 0,\quad\) for all\(\;v\in H\) with a Hilbert space \(H\), a nonlinear operator \(T:H\to H\) and a lower semicontinuous function \(\varphi:H\to R\cup \{+\infty\}.\) The resolvent operator technique is used to ...
openaire   +2 more sources

Auxiliary Problem Method for Mixed Variational-Like Inequalities

open access: yes, 2011
[[abstract]]This paper deals with the convergence of the algorithm built on the auxiliary problem principle for solving a class of pseudomonotone type mixed variational-like inequalities.
L. C. Zeng; L. J. Lin ; J. C. Yao
core  

Hybrid proximal methods for equilibrium problems

open access: yes, 2011
This paper concerns developing two hybrid proximal point methods (PPMs) for finding a common solution of some optimization-related problems. First we construct an algorithm to solve simultaneously an equilibrium problem and a variational inequality ...
Barbara Panicucci   +7 more
core   +1 more source

Extragradient subgradient methods for solving bilevel equilibrium problems. [PDF]

open access: yesJ Inequal Appl, 2018
Yuying T, Dinh BV, Kim DS, Plubtieng S.
europepmc   +1 more source

On duality for generalized pseudomonotonic programming

open access: yesJournal of Numerical Analysis and Approximation Theory, 1991
Summary: We considers a Mond type dual for pseudomonotonic programming with generalized linear constraints. Two duality results are obtained. In order to prove the ``strong duality theorem'' a linearization result for pseudomonotonic programming and the duality property of generalized linear programming are used. The strong duality theorem shows that a
openaire   +3 more sources

Home - About - Disclaimer - Privacy