On Approximately Star-Shaped Functions and Approximate Vector Variational Inequalities

In this paper, we consider a vector optimization problem involving approximately star-shaped functions. We formulate approximate vector variational inequalities in terms of Fréchet subdifferentials and solve the vector optimization problem. Under the assumptions of approximately straight functions, we establish necessary and sufficient conditions for a solution of approximate vector variational inequality to be an approximate efficient solution of the vector optimization problem. We also consider the corresponding weak versions of the approximate vector variational inequalities and establish various results for approximate weak efficient solutions.     

On minty variational principle for nonsmooth vector optimization problems with approximate convexity

In this paper, we consider a vector optimization problem involving locally Lipschitz approximately convex functions and give several concepts of approximate efficient solutions. We formulate approximate vector variational inequalities of Stampacchia and Minty type and use these inequalities as a tool to characterize an approximate efficient solution of the vector optimization problem.     

On One of Matérn's Hard-core Point Process Models

By means of time discretization, we approximate evolution variational inequalities by the corresponding elliptic variational inequalities. Using ROTHE'S method (method of lines), an approximate solution is constructed by means of direct variational methods. Existence, uniqueness and regularity of solutions as well as convergence of the approximate solutions are proved.     

Iterative algorithms for a new class of extended general nonconvex set-valued variational inequalities

Some new classes of extended general nonconvex set-valued variational inequalities and the extended general Wiener-Hopf inclusions are introduced. By the projection technique, equivalence between the extended general nonconvex set-valued variational inequalities and the fixed point problems as well as the extended general nonconvex Wiener-Hopf inclusions is proved. Then by using this equivalent formulation, we discuss the existence of solutions of the extended general nonconvex set-valued variational inequalities and construct some new perturbed finite step projection iterative algorithms with mixed errors for approximating the solutions of the extended general nonconvex set-valued variational inequalities. We also verify that the approximate solutions obtained by our algorithms converge to the solutions of the extended general nonconvex set-valued variational inequalities. The results presented in this paper extend and improve some known results from the literature.     

General algorithm of random solutions for random nonlinear variational inequalities in banach Spaces *

In this paper, we study a class of random nonlinear variational inequalities in Banach spaces. By applying a random minimax inequahty obtained by Tarafdar and Yuan, some existence uniqueness theorems of random solutions for the random nonhnear variational inequalities are proved. Next, by applying the random auxiliary problem technique, we suggest an innovative iterative algorithm to compute the random approximate solutions of the random nonlinear variational inequahty. Finally, the convergence criteria is also discussed     

Existence and iterative approximation of solutions of some systems of variational inequalities and inclusions

In 1968, Brézis [Ann. Inst. Fourier (Grenoble), 18 (1) (1968) 115-175] initiated the study of the existence theory of a class of variational inequalities later known as variational inclusions, using proximal-point mappings due to Moreau [Bull. Soc. Math. France, 93 (1965) 273-299]. Variational inclusions include variational, quasi-variational, variational-like inequalities as special cases. In 1985, Pang [Math. Prog. 31 (1985) 206-219] showed that a variety of equilibrium models can be uniformly modelled as a variational inequality defined on the product sets equivalent to a system of variational inequalities and discuss the convergence of method of decomposition for system of variational inequalities. Motivated by the recent research work in this directions, we consider some systems of variational (-like) inequalities and inclusions; develop the iterative algorithms for finding the approximate solutions and discuss their convergence criteria. Further, we study the sensitivity analysis of solution of the system of variational inclusions. The techniques and results presented here improve the corresponding techniques and results for the variational inequalities and inclusions in the literature. (© 2008 WILEY-VCH Verlag GmbH & Co. KGaA, Weinheim)     

集值或单值增算子变分不等式的有限维近似

将非线性变分不等式的有限维近似理论用来处理带集值增算子的变分不等式,得到近似解的存在性及收敛性定理。对一种特殊的单值情形,给出了收敛性理论及误差估计。     

A class of gap functions for variational inequalities

Recently Auchmuty (1989) has introduced a new class of merit functions, or optimization formulations, for variational inequalities in finite-dimensional space. We develop and generalize Auchmuty's results, and relate his class of merit functions to other works done in this field. Especially, we investigate differentiability and convexity properties, and present characterizations of the set of solutions to variational inequalities. We then present new descent algorithms for variational inequalities within this framework, including approximate solutions of the direction finding and line search problems. The new class of merit functions include the primal and dual gap functions, introduced by Zuhovickii et al. (1969a, 1969b), and the differentiable merit function recently presented by Fukushima (1992); also, the descent algorithm proposed by Fukushima is a special case from the class of descent methods developed in this paper. Through a generalization of Auchmuty's class of merit functions we extend those inherent in the works of Dafermos (1983), Cohen (1988) and Wu et al. (1991); new algorithmic equivalence results, relating these algorithm classes to each other and to Auchmuty's framework, are also given.Corresponding author.     

Solution smoothness of ill-posed equations in Hilbert spaces: four concepts and their cross connections

Numerical solution of ill-posed operator equations requires regularization techniques. The convergence of regularized solutions to the exact solution can be usually guaranteed, but to also obtain estimates for the speed of convergence one has to exploit some kind of smoothness of the exact solution. We consider four such smoothness concepts in a Hilbert space setting: source conditions, approximate source conditions, variational inequalities, and approximate variational inequalities. Besides some new auxiliary results on variational inequalities the equivalence of the last three concepts is shown. In addition, it turns out that the classical concept of source conditions and the modern concept of variational inequalities are connected via Fenchel duality.     

Generalized multivalued nonlinear quasivariational inclusions

In this paper, we introduce and study a few classes of generalized multivalued nonlinear quasivariational inclusions and generalized nonlinear quasivariational inequalities, which include many classes of variational inequalities, quasivariational inequalities and variational inclusions as special cases. Using the resolvent operator technique for maximal monotone mapping, we construct some new iterative algorithms for finding the approximate solutions of these classes of quasivariational inclusions and quasivariational inequalities. We establish the existence of solutions for this generalized nonlinear quasivariational inclusions involving both relaxed Lipschitz and strongly monotone and generalized pseudocontractive mappings and obtain the convergence of iterative sequences generated by the algorithms. Under certain conditions, we derive the existence of a unique solution for the generalized nonlinear quasivariational inequalities and obtain the convergence and stability results of the Noor type perturbed iterative algorithm. The results proved in this paper represent significant refinements and improvements of the previously known results in this area.     

Projection Method Approach for General Regularized Non-convex Variational Inequalities

In this paper, we investigate or analyze non-convex variational inequalities and general non-convex variational inequalities. Two new classes of non-convex variational inequalities, named regularized non-convex variational inequalities and general regularized non-convex variational inequalities, are introduced, and the equivalence between these two classes of non-convex variational inequalities and the fixed point problems are established. A projection iterative method to approximate the solutions of general regularized non-convex variational inequalities is suggested. Meanwhile, the existence and uniqueness of solution for general regularized non-convex variational inequalities is proved, and the convergence analysis of the proposed iterative algorithm under certain conditions is studied.     

On Minty variational principle for nonsmooth vector optimization problems with generalized approximate convexity

In this paper, we consider a nonsmooth vector optimization problem involving locally Lipschitz generalized approximate convex functions and find some relations between approximate convexity and generalized approximate convexity. We establish relationships between vector variational inequalities and nonsmooth vector optimization problem using the generalized approximate convexity as a tool.     

Stopping Problems of Certain Multiplicative Functionals and Optimal Investment with Transaction Costs

Optimal stopping and impulse control problems with certain multiplicative functionals are considered. The stopping problems are solved by showing the unique existence of the solutions of relevant variational inequalities. However, since functions defining the multiplicative costs change the signs, some difficulties arise in solving the variational inequalities. Through gauge transformation we rewrite the variational inequalities in different forms with the obstacles which grow exponentially fast but with positive killing rates. Through the analysis of such variational inequalities we construct optimal stopping times for the problems. Then optimal strategies for impulse control problems on the infinite time horizon with multiplicative cost functionals are constructed from the solutions of the risk-sensitive variational inequalities of "ergodic type" as well. Application to optimal investment with fixed ratio transaction costs is also considered.     

广义混合隐拟h变分不等式的解的存在性与算法

本文在Hilbert空间中,引入了一类广义混合隐拟h变分不等式.运用变分原理,给出了广义混合隐拟h变分不等式逼近解的迭代算法,证明了这类变分不等式解的存在性定理,同时,得到迭代序列的收敛性.并改进和推广了[6~8]一些已知结果.     

Applications of Generalized Variational and Quasivariational Inequalities with Operator Solutions in a TVS

In a recent paper, Domokos and Kolumbán introduced variational inequalities with operator solutions to provide a unified approach to several kinds of variational inequalities and vector variational inequalities in Banach spaces. Inspired by their work, in a former paper, we extended the scheme of vector variational inequalities with operator solutions from the single-valued case to the multivalued one and provided some applications to generalized vector variational inequalities and generalized quasivector variational inequalities in normed spaces. As a continuation of the former work, in this paper, we further extend those results to more general and tangible cases in the context of Hausdorff topological vector spaces or locally convex spaces. This work was supported by KOSEF Grant R01-2003-000-10825-0.     

Merit functions for general variational inequalities

In this paper, we consider some classes of merit functions for general variational inequalities. Using these functions, we obtain error bounds for the solution of general variational inequalities under some mild conditions. Since the general variational inequalities include variational inequalities, quasivariational inequalities and complementarity problems as special cases, results proved in this paper hold for these problems. In this respect, results obtained in this paper represent a refinement of previously known results for classical variational inequalities.     

Relationships between interval-valued vector optimization problems and vector variational inequalities

In this paper, we study some relationships between interval-valued vector optimization problems and vector variational inequalities under the assumptions of LU-convex smooth and non-smooth objective functions. We identify the weakly efficient points of the interval-valued vector optimization problems and the solutions of the weak vector variational inequalities under smooth and non-smooth LU-convexity assumptions.     

一般多值混合隐拟变分不等式的解的存在性与算法

引入了实Hilbert空间中一类新的一般多值混合隐拟变分不等式.它概括了丁协平教授引入与研究过的熟知的广义混合隐拟变分不等式类成特例.运用辅助变分原理技巧来解这类一般多值混合隐拟变分不等式.首先,定义了具真凸下半连续的二元泛函的新的辅助变分不等式,并选取了一适当的泛函,使得其唯一的最小值点等价于此辅助变分不等式的解.其次,利用此辅助变分不等式,构造了用于计算一般多值混合隐拟变分不等式逼近解的新的迭代算法.在此,等价性保证了算法能够生成一列逼近解.最后,证明了一般多值混合隐拟变分不等式解的存在性与逼近解的收敛性.而且,给算法提供了新的收敛判据.因此,结果对M.A.Noor提出的公开问题给出了一个肯定答案,并推广和改进了关于各种变分不等式与补问题的早期与最近的结果,包括最近文献中涉及单值与集值映象的有关混合变分不等式、混合拟变不等式与拟补问题的相应结果.     

Convergence of the Approximation Scheme to American Option Pricing via the Discrete Morse Semiflow

We consider the approximation scheme to the American call option via the discrete Morse semiflow, which is a minimizing scheme of a time semi-discretized variational functional. In this paper we obtain a rate of convergence of approximate solutions and the convergence of approximate free boundaries. We mainly apply the theory of variational inequalities and that of viscosity solutions to prove our results.     

Direct Numerical Algorithm for Constrained Variational Problems

We propose a direct treatment for the numerical simulation of optimal solutions for vector, one-dimensional variational problems under pointwise constraints in the form of several inequalities. It is an iterative procedure to approximate the optimal solutions of such variational problems that rely on our ability to e?ciently approximate the optimal solutions of variational problems without restrictions, except possibly for end point constraints. One main advantage is that there is no need to control the free boundary, or the contact set, during the iterative process where constraints are active. In addition to proving some convergence results, the scheme is illustrated through several typical situations.