共查询到20条相似文献,搜索用时 31 毫秒
1.
Pham Gia Hung 《Nonlinear Analysis: Theory, Methods & Applications》2011,74(17):6121-6129
We extend the Tikhonov regularization method widely used in optimization and monotone variational inequality studies to equilibrium problems. It is shown that the convergence results obtained from the monotone variational inequality remain valid for the monotone equilibrium problem. For pseudomonotone equilibrium problems, the Tikhonov regularized subproblems have a unique solution only in the limit, but any Tikhonov trajectory tends to the solution of the original problem, which is the unique solution of the strongly monotone equilibrium problem defined on the basis of the regularization bifunction. 相似文献
2.
I. P. Ryazantseva 《Differential Equations》2012,48(7):1005-1017
For mixed variational inequalities in a Hilbert space, we consider continuous first-order methods and obtain sufficient conditions
for their strong convergence. If the operator of the problem is not strongly monotone and the functional does not have the
property of strong convexity, then regularized versions of these methods are used for the solution of a mixed variational
inequality. For the case in which the data are given approximately, we prove the strong convergence of the regularized methods
to a normal solution of the original problem. The construction of all methods uses the resolvent of the maximal monotone operator.
We obtain sufficient conditions for the unique solvability of the Cauchy problems determining the considered methods. 相似文献
3.
We examine two central regularization strategies for monotone variational inequalities, the first a direct regularization of the operative monotone mapping, and the second via regularization of the associated dual gap function. A key link in the relationship between the solution sets to these various regularized problems is the idea of exact regularization, which, in turn, is fundamentally associated with the existence of Lagrange multipliers for the regularized variational inequality. A regularization is said to be exact if a solution to the regularized problem is a solution to the unregularized problem for all parameters beyond a certain value. The Lagrange multipliers corresponding to a particular regularization of a variational inequality, on the other hand, are defined via the dual gap function. Our analysis suggests various conceptual, iteratively regularized numerical schemes, for which we provide error bounds, and hence stopping criteria, under the additional assumption that the solution set to the unregularized problem is what we call weakly sharp of order greater than one. 相似文献
4.
For nonsymmetric operators involved in variational inequalities, the strong monotonicity of their possibly multivalued inverse operators (referred to as the Dunn property) appears to be the weakest requirement to ensure convergence of most iterative algorithms of resolution proposed in the literature. This implies the Lipschitz property, and both properties are equivalent for symmetric operators. For Lipschitz operators, the Dunn property is weaker than strong monotonicity, but is stronger than simple monotonicity. Moreover, it is always enforced by the Moreau–Yosida regularization and it is satisfied by the resolvents of monotone operators. Therefore, algorithms should always be applied to this regularized version or they should use resolvents: in a sense, this is what is achieved in proximal and splitting methods among others. However, the operation of regularization itself or the computation of resolvents may be as complex as solving the original variational inequality. In this paper, the concept of progressive regularization is introduced and a convergent algorithm is proposed for solving variational inequalities involving nonsymmetric monotone operators. Essentially, the idea is to use the auxiliary problem principle to perform the regularization operation and, at the same time, to solve the variational inequality in its approximately regularized version; thus, two iteration processes are performed simultaneously, instead of being nested in each other, yielding a global explicit iterative scheme. Parallel and sequential versions of the algorithm are presented. A simple numerical example demonstrates the behavior of these two versions for the case where previously proposed algorithms fail to converge unless regularization or computation of a resolvent is performed at each iteration. Since the auxiliary problem principle is a general framework to obtain decomposition methods, the results presented here extend the class of problems for which decomposition methods can be used. 相似文献
5.
On the Tikhonov regularization of affine pseudomonotone mappings 总被引:1,自引:0,他引:1
Pham Duy Khanh 《Optimization Letters》2014,8(4):1325-1336
The pseudomonotonicity of affine mappings on polyhedral convex sets is characterized in the one-dimensional case and in a higher-dimensional setting. The obtained results allow us to investigate the pseudomonotonicity of the regularized mappings (in the sense of Tikhonov regularization). Among other things, it is shown that there exists a pseudomonotone affine variational inequality problem VI( $K,F$ ) with a nonempty solution set for which the regularized problem VI( $K,F_\varepsilon $ ) is not pseudomonotone for every $\varepsilon \in (0,\frac{1}{2})$ . In addition, we prove that the feasibility of a pseudomonotone linear complementarity problem implies the solution uniqueness of the regularized problem. 相似文献
6.
C. S. Lalitha 《Numerical Functional Analysis & Optimization》2013,34(5-6):548-565
In this paper, we introduce two new classes of generalized monotone set-valued maps, namely relaxed μ–p monotone and relaxed μ–p pseudomonotone. Relations of these classes with some other well-known classes of generalized monotone maps are investigated. Employing these new notions, we derive existence and well-posedness results for a set-valued variational inequality problem. Our results generalize some of the well-known results. A gap function is proposed for the variational inequality problem and a lower error bound is obtained under the assumption of relaxed μ–p pseudomonotonicity. An equivalence relation between the well-posedness of the variational inequality problem and that of a related optimization problem pertaining to the gap function is also presented. 相似文献
7.
Pham Duy Khanh 《Applicable analysis》2013,92(9):1691-1698
This article gives a partial solution for the open question raised by Nguyen Thanh Hao [Tikhonov regularization algorithm for pseudomonotone variational inequalities, Acta Math. Vietnam., 31 (2006), 283–289] about uniqueness of the solution of the regularized problem VI(K,?F ?) of a pseudomonotone variational inequality VI(K,?F) for sufficiently small parameter ??>?0. It is proved that, under certain additional assumptions, the desired solution uniqueness holds for some classes of pseudoaffine variational inequalities and pseudomonotone variational inequalities. 相似文献
8.
In this paper, we study the convergence of proximal methods for solving pseudomonotone (in the sense of Karamardian) variational inequalities. The main result is given in the finite-dimensional case, but we show that we still obtain convergence in an infinite-dimensional Hilbert space under a strong pseudomonotonicity or a pseudo-Dunn assumption on the operator involved in the variational inequality problem. 相似文献
9.
Nguen Byuong 《Ukrainian Mathematical Journal》1991,43(9):1186-1189
For variational inequalities with monotone operators in Banach spaces a regularized perturbed inequality is constructed by means of a strongly monotone linear operator, a general scheme of approximating regularized solutions is investigated, and an example of construction of such a linear operator based on information on the operator of the problem is given.Translated from Urainskii Matematicheskii Zhurnal, Vol. 43, No. 9, pp. 1273–1276, September, 1991. 相似文献
10.
Based on the pressure projection stabilized methods, the semi-discrete finite element approximation to the time-dependent Navier–Stokes equations with nonlinear slip boundary conditions is considered in this paper. Because this class of boundary condition includes the subdifferential property, then the variational formulation is the Navier–Stokes type variational inequality problem. Using the regularization procedure, we obtain a regularized problem and give the error estimate between the solutions of the variational inequality problem and the regularized problem with respect to the regularized parameter \({\varepsilon}\), which means that the solution of the regularized problem converges to the solution of the Navier–Stokes type variational inequality problem as the parameter \({\varepsilon\longrightarrow 0}\). Moreover, some regularized estimates about the solution of the regularized problem are also derived under some assumptions about the physical data. The pressure projection stabilized finite element methods are used to the regularized problem and some optimal error estimates of the finite element approximation solutions are derived. 相似文献
11.
L. C. Ceng B. S. Mordukhovich J. C. Yao 《Journal of Optimization Theory and Applications》2010,146(2):267-303
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. 相似文献
12.
The stable solution of ill-posed non-linear operator equations in Banach space requires regularization. One important approach is based on Tikhonov regularization, in which case a one-parameter family of regularized solutions is obtained. It is crucial to choose the parameter appropriately. Here, a sequential variant of the discrepancy principle is analysed. In many cases, such parameter choice exhibits the feature, called regularization property below, that the chosen parameter tends to zero as the noise tends to zero, but slower than the noise level. Here, we shall show such regularization property under two natural assumptions. First, exact penalization must be excluded, and secondly, the discrepancy principle must stop after a finite number of iterations. We conclude this study with a discussion of some consequences for convergence rates obtained by the discrepancy principle under the validity of some kind of variational inequality, a recent tool for the analysis of inverse problems. 相似文献
13.
Error bounds for proximal point subproblems and associated inexact proximal point algorithms 总被引:1,自引:0,他引:1
We study various error measures for approximate solution of proximal point regularizations of the variational inequality problem,
and of the closely related problem of finding a zero of a maximal monotone operator. A new merit function is proposed for
proximal point subproblems associated with the latter. This merit function is based on Burachik-Iusem-Svaiter’s concept of
ε-enlargement of a maximal monotone operator. For variational inequalities, we establish a precise relationship between the
regularized gap function, which is a natural error measure in this context, and our new merit function. Some error bounds
are derived using both merit functions for the corresponding formulations of the proximal subproblem. We further use the regularized
gap function to devise a new inexact proximal point algorithm for solving monotone variational inequalities. This inexact
proximal point method preserves all the desirable global and local convergence properties of the classical exact/inexact method,
while providing a constructive error tolerance criterion, suitable for further practical applications. The use of other tolerance
rules is also discussed.
Received: April 28, 1999 / Accepted: March 24, 2000?Published online July 20, 2000 相似文献
14.
In this paper, we prove that each monotone variational inequality is equivalent to a two-mapping variational inequality problem. On the basis of this fact, a new class of iterative methods for the solution of nonlinear monotone variational inequality problems is presented. The global convergence of the proposed methods is established under the monotonicity assumption. The conditions concerning the implementability of the algorithms are also discussed. The proposed methods have a close relationship to the Douglas–Rachford operator splitting method for monotone variational inequalities. 相似文献
15.
Dang Van Hieu Le Dung Muu Hoang Ngoc Duong Buu Huu Thai 《Mathematical Methods in the Applied Sciences》2020,43(17):9745-9765
In this paper, we introduce two new numerical methods for solving a variational inequality problem involving a monotone and Lipschitz continuous operator in a Hilbert space. We describe how to incorporate a regularization term depending on a parameter in the projection method and then establish the strong convergence of the resulting iterative regularization projection methods. Unlike known hybrid methods, the strong convergence of the new methods comes from the regularization technique. The first method is designed to work in the case where the Lipschitz constant of cost operator is known, whereas the second one is more easily implemented without this requirement. The reason is because the second method has used a simple computable stepsize rule. The variable stepsizes are generated by the second method at each iteration and based on the previous iterates. These stepsizes are found with only one cheap computation without line-search procedure. Several numerical experiments are implemented to show the computational effectiveness of the new methods over existing methods. 相似文献
16.
Motivated by the work of Facchinei and Kanzow (Ref. 1) on regularization methods for the nonlinear complementarity problem and the work of Ravindran and Gowda (Ref. 2) for the box variational inequality problem, we study regularization methods for the general variational inequality problem. A sufficient condition is given which guarantees that the union of the solution sets of the regularized problems is nonempty and bounded. It is shown that solutions of the regularized problems form a minimizing sequence of the D-gap function under a mild condition. 相似文献
17.
《Optimization》2012,61(9):1841-1854
We introduce a new iteration method for finding a common element of the set of solutions of a variational inequality problem and the set of fixed points of strict pseudocontractions in a real Hilbert space. The weak convergence of the iterative sequences generated by the method is obtained thanks to improve and extend some recent results under the assumptions that the cost mapping associated with the variational inequality problem only is pseudomonotone and not necessarily inverse strongly monotone. Finally, we present some numerical examples to illustrate the behaviour of the proposed algorithm. 相似文献
18.
This paper is concerned with the existence of an optimal control problem for a quasi-linear elliptic obstacle variational inequality in which the obstacle is taken as the control. Firstly, we get some existence results under the assumption of the leading operator of the variational inequality with a monotone type mapping in Section 2. In Section 3, as an application, without the assumption of the monotone type mapping for the leading operator of the variational inequality, we prove that the leading operator of the variational inequality is a monotone type mapping. Existence of the optimal obstacle is proved. The method used here is different from [Y.Y. Zhou, X.Q. Yang, K.L. Teo, The existence results for optimal control problems governed by a variational inequality, J. Math. Anal. Appl. 321 (2006) 595-608]. 相似文献
19.
In this article, we present a-posteriori error estimations in context of optimal control of contact problems; in particular of Signorini’s problem. Due to the contact side-condition, the solution operator of the underlying variational inequality is not differentiable, yet we want to apply Newton’s method. Therefore, the non-smooth problem is regularized by penalization and afterwards discretized by finite elements. We derive optimality systems for the regularized formulation in the continuous as well as in the discrete case. This is done explicitly for Signorini’s contact problem, which covers linear elasticity and linearized surface contact conditions. The latter creates the need for treating trace-operations carefully, especially in contrast to obstacle contact conditions, which exert in the domain. Based on the dual weighted residual method and these optimality systems, we deduce error representations for the regularization, discretization and numerical errors. Those representations are further developed into error estimators. The resulting error estimator for regularization error is defined only in the contact area. Therefore its computational cost is especially low for Signorini’s contact problem. Finally, we utilize the estimators in an adaptive refinement strategy balancing regularization and discretization errors. Numerical results substantiate the theoretical findings. We present different examples concerning Signorini’s problem in two and three dimensions. 相似文献
20.
In this paper we deal with a viscoelastic unilateral contact problem with normal damped response. The process is assumed to be dynamic and frictionless. Normal damping function is modeled by the Clarke subdifferential of a nonconvex and nonsmooth function. First, the variational formulation of this problem is provided in the form of a nonlinear first order variational–hemivariational inequality for the velocity field. Then, based on the surjectivity results for pseudomonotone and maximal monotone operators, we obtain the unique solvability for a new class of abstract evolutionary variational-hemivariational inequalities. Finally, we apply our abstract results to prove the existence of a unique weak solution to the corresponding contact problem. 相似文献