In this article we present a new and efficient method for solving equilibrium problems on polyhedra. The method is based on
an interior-quadratic proximal term which replaces the usual quadratic proximal term. This leads to an interior proximal type
algorithm. Each iteration consists in a prediction step followed by a correction step as in the extragradient method. In a
first algorithm each of these steps is obtained by solving an unconstrained minimization problem, while in a second algorithm
the correction step is replaced by an Armijo-backtracking linesearch followed by an hyperplane projection step. We prove that
our algorithms are convergent under mild assumptions: pseudomonotonicity for the two algorithms and a Lipschitz property for
the first one. Finally we present some numerical experiments to illustrate the behavior of the proposed algorithms. 相似文献
In this paper, we introduce and study some low computational cost numerical methods for finding a solution of a variational inequality problem over the solution set of an equilibrium problem in a real Hilbert space. The strong convergence of the iterative sequences generated by the proposed algorithms is obtained by combining viscosity-type approximations with projected subgradient techniques. First a general scheme is proposed, and afterwards two practical realizations of it are studied depending on the characteristics of the feasible set. When this set is described by convex inequalities, the projections onto the feasible set are replaced by projections onto half-spaces with the consequence that most iterates are outside the feasible domain. On the other hand, when the projections onto the feasible set can be easily computed, the method generates feasible points and can be considered as a generalization of Maingé’s method to equilibrium problem constraints. In both cases, the strong convergence of the sequences generated by the proposed algorithms is proven. 相似文献
This paper presents an algorithm for minimizing a function of one variable which uses function, but not derivative, values at five-points to generate each iterate. It employs quadratic and polyhedral approximations together with a safeguard. The basic method without the safeguard exhibits a type of better than linear convergence for certain piecewise twice continuously differentiable functions. The safeguard guarantees convergence to a stationary point for very general functions and preserves the better than linear convergence of the basic method.This paper is dedicated to Phil Wolfe on the occasion of his 65th birthday.Research sponsored by the Institut National de Recherche en Informatique et Automatique, Rocquencourt, France, and by the Air Force Office of Scientific Research, Air Force System Command, USAF, under Grant Number AFOSR-83-0210.Research sponsored, in part, by the Institut National de Recherche en Informatique et Automatique, Rocquencourt, France. 相似文献
We apply the Banach contraction-mapping fixed-point principle for solving multivalued strongly monotone variational inequalities. Then, we couple this algorithm with the proximal-point method for solving monotone multivalued variational inequalities. We prove the convergence rate of this algorithm and report some computational results.This work was completed during the stay of the second author at the Department of Mathematics, University of Namur, Namur, Belgium, 2003. 相似文献
We investigate the global exponential stability of equilibrium solutions of a projected dynamical system for variational inequalities. Under strong pseudomonotonicity and Lipschitz continuity assumptions, we prove that the dynamical system has a unique equilibrium solution. Moreover, this solution is globally exponentially stable. Some examples are given to analyze the effectiveness of the theoretical results. The numerical results confirm that the trajectory of the dynamical system globally exponentially converges to the unique solution of the considered variational inequality. The results established in this paper improve and extend some recent works. 相似文献
We consider a generalized equilibrium problem involving DC functions which is called (GEP). For this problem we establish
two new dual formulations based on Toland-Fenchel-Lagrange duality for DC programming problems. The first one allows us to
obtain a unified dual analysis for many interesting problems. So, this dual coincides with the dual problem proposed by Martinez-Legaz
and Sosa (J Glob Optim 25:311–319, 2006) for equilibrium problems in the sense of Blum and Oettli. Furthermore it is equivalent
to Mosco’s dual problem (Mosco in J Math Anal Appl 40:202–206, 1972) when applied to a variational inequality problem. The
second dual problem generalizes to our problem another dual scheme that has been recently introduced by Jacinto and Scheimberg
(Optimization 57:795–805, 2008) for convex equilibrium problems. Through these schemes, as by products, we obtain new optimality
conditions for (GEP) and also, gap functions for (GEP), which cover the ones in Antangerel et al. (J Oper Res 24:353–371,
2007, Pac J Optim 2:667–678, 2006) for variational inequalities and standard convex equilibrium problems. These results, in
turn, when applied to DC and convex optimization problems with convex constraints (considered as special cases of (GEP)) lead
to Toland-Fenchel-Lagrange duality for DC problems in Dinh et al. (Optimization 1–20, 2008, J Convex Anal 15:235–262, 2008),
Fenchel-Lagrange and Lagrange dualities for convex problems as in Antangerel et al. (Pac J Optim 2:667–678, 2006), Bot and
Wanka (Nonlinear Anal to appear), Jeyakumar et al. (Applied Mathematics research report AMR04/8, 2004). Besides, as consequences
of the main results, we obtain some new optimality conditions for DC and convex problems. 相似文献
The paper proposes two new iterative methods for solving pseudomonotone equilibrium problems involving fixed point problems for quasi-\(\phi \)-nonexpansive mappings in Banach spaces. The proposed algorithms combine the extended extragradient method or the linesearch method with the Halpern iteration. The strong convergence theorems are established under standard assumptions imposed on equilibrium bifunctions and mappings. The results in this paper have generalized and enriched existing algorithms for equilibrium problems in Banach spaces. 相似文献
In recent years, the so-called auxiliary problem principle has been used to derive many iterative type algorithms for solving optimal control, mathematical programming, and variational inequality problems. In the present paper, we use this principle in conjunction with the epiconvergence theory to introduce and study a general family of perturbation methods for solving nonlinear variational inequalities over a product space of reflexive Banach spaces. We do not assume that the monotone operator involved in our general variational inequality problem is of potential type. Several known iterative algorithms, which can be obtained from our theory, are also discussed.This work was completed while the second author was visiting the Department of Mathematics of the University of Washington, Seattle, Washington under financial support from the Belgian Fonds National de la Recherche Scientifique, Grant FNRS: B8/5-JS-9. 549. 相似文献
To improve xylanase productivity fromPenicillium canescens 10–10c culture, an optimization of oxygen supply is required. Because the strain is sensitive to shear forces, leading to lower xylanase productivity as to morphological alteration, vigorous mixing is not desired. The influence of turbine design, agitation speed, and air flow rate on K1a (global mass transfer coefficient, h-1) and enzyme production is discussed. K1a values increased with agitation speed and air flow rate, whatever the impeller, in our assay conditions. Agitation had more influence on K1a values than air flow, when a disk-mounted blade’s impeller (DT) is used; an opposite result was obtained with a hub-mounted pitched blade’s impeller (PBT). Xylanase production appeared as a function of specific power (W/m3), and an optimum was found in 20 and 100 L STRs fitted with DT impellers. On the other hand, the use of a hub-mounted pitched blade impeller (PBT8), instead of a disk-mounted blade impeller (DT4), reduced the lag time of hemicellulase production and increased xylanase productivity 1.3-fold.