Two-Stage Stochastic Variational Inequality Arising from Stochastic Programming

We consider a two-stage stochastic variational inequality arising from a general convex two-stage stochastic programming problem, where the random variables have continuous distributions. The equivalence between the two problems is shown under some moderate conditions, and the monotonicity of the two-stage stochastic variational inequality is discussed under additional conditions. We provide a discretization scheme with convergence results and employ the progressive hedging method with double parameterization to solve the discretized stochastic variational inequality. As an application, we show how the water resources management problem under uncertainty can be transformed from a two-stage stochastic programming problem to a two-stage stochastic variational inequality, and how to solve it, using the discretization scheme and the progressive hedging method with double parameterization.

     

Mesh-independent convergence of penalty methods applied to optimal control with partial differential equations

In this paper, optimal control problems with elliptic state equations and constraints on controls are considered. Also state constraints are briefly discussed. Barrier-penalty methods are applied to treat the occurring restrictions. In the case of finite-dimensional optimization problems, the considered methods have a linear rate of convergence in dependence of the penalty parameter. However, in the case of infinite-dimensional problems, as studied in this article, the direct application of finite-dimensional theory, as given in Grossmann and Zadlo [A general class of penalty/barrier path-following Newton methods for nonlinear programming, Optimization 54 (2005), pp. 161–190], would lead to mesh-dependent order one estimates that deteriorate if the discretization is refined. In this article a first rigorous proof is given for inequality constrained problems that in the case of quadratic penalties a mesh-independence principle holds, i.e. the first-order convergence estimate holds for the continuous problem as well as for discretized problems independently of the discretization step size. The penalty techniques rest upon the control approximate reduction as discussed, e.g. in Grossmann et al. [C. Grossmann, H. Kunz, and R. Meischner, Elliptic control by penalty techniques with control reduction, in System Modeling and Optimization, IFIP Advances in Information and Communication Technology, Vol. 312, Springer, Berlin, 2009, pp. 251–267; M. Hinze, A variational discretization concept in control constrained optimization: the linear-quadratic case, Comput. Optim. Appl. 30 (2005), pp. 45–61]. For the discretization conforming linear element discretization is applied. Some numerical examples illustrate and confirm the theoretical results.     

Smoothing and newton's method for a discontinuous variational equation of stefan type ∗

An important way to treat discontinuous variational equations consists in its embedding into a family of continuous ones. In the present paper for this purpose a smooth penalty technique is applied. Convergence bounds are derived for the approximation of the original solution by solutions of the generated smoothed problems. The focus of the papers is to analyze a semi-discretization via Rothe's method and to establish Convergence bounds for Newton's method applied to it depending on discretization and smoothing parameters. The subproblems at each time level can be considered as nonsmooth convex variational problems of obstacle type     

Stability for semilinear elliptic variational inequalities depending on the gradient

In this work we give a result concerning the continuous dependence on the data for weak solutions of a class of semilinear elliptic variational inequalities (P_n) with a nonlinear term depending on the gradient of the solution. This paper can be seen as the second part of the work Matzeu and Servadei (2010) [9], in the sense that here we give a stability result for the C^1,α-weak solutions of problem (P_n) found in Matzeu and Servadei (2010) [9] through variational techniques. To be precise, we show that the solutions of (P_n), found with the arguments of Matzeu and Servadei (2010) [9], converge to a solution of the limiting problem (P), under suitable convergence assumptions on the data.     

Inverse problems for multi-valued quasi variational inequalities and noncoercive variational inequalities with noisy data

ABSTRACT

We study the inverse problem of identifying a variable parameter in variational and quasi-variational inequalities. We consider a quasi-variational inequality involving a multi-valued monotone map and give a new existence result. We then formulate the inverse problem as an optimization problem and prove its solvability. We also conduct a thorough study of the inverse problem of parameter identification in noncoercive variational inequalities which appear commonly in applied models. We study the inverse problem by posing optimization problems using the output least-squares and the modified output least-squares. Using regularization, penalization, and smoothing, we obtain a single-valued parameter-to-selection map and study its differentiability. We consider optimization problems using the output least-squares and the modified output least-squares for the regularized, penalized and smoothened variational inequality. We give existence results, convergence analysis, and optimality conditions. We provide applications and numerical examples to justify the proposed framework.     

Multiplicity results for interfaces of Ginzburg-Landau-Allen-Cahn equations in periodic media

The Ginzburg-Landau-Allen-Cahn equation is a variational model for phase coexistence and for other physical problems. It contains a term given by a kinetic part of elliptic type plus a double-well potential. We assume that the functional depends on the space variables in a periodic way.We show that given a plane with rational normal, there are minimal solutions, satisfying the following properties. These solutions are asymptotic to the pure phases and are separated by an interface. The convergence to the pure phases is exponentially fast. The interface lies at a finite distance M from the chosen plane, where M is a universal constant. Furthermore, these solutions satisfy some monotonicity properties with respect to integer translations (namely, integer translations are always comparable to the function).We then show that all the interfaces of the global periodic minimizers satisfy similar monotonicity and plane-like properties.We also consider the case of possibly irrationally oriented planes. We show that either there is a one parameter family of minimizers whose graphs provide a field of extremals or there are at least two solutions, one which is a minimizer and another one which is not. These solutions also have interfaces bounded by a universal constant, they enjoy monotonicity properties with respect to integer translations and the nonminimal solutions are trapped inside a gap of the lamination induced by the minimizers.     

Contingent derivatives and regularization for noncoercive inverse problems

Abstract

We study the inverse problem of parameter identification in noncoercive variational problems that commonly appear in applied models. We examine the differentiability of the set-valued parameter-to-solution map using the first-order and the second-order contingent derivatives. We explore the inverse problem using the output least-squares and the modified output least-squares objectives. By regularizing the noncoercive variational problem, we obtain a single-valued regularized parameter-to-solution map and investigate its smoothness and boundedness. We also consider optimization problems using the output least-squares and the modified output least-squares objectives for the regularized variational problem. We give a complete convergence analysis showing that for the output least-squares and the modified output least-squares, the regularized minimization problems approximate the original optimization problems suitably. We also provide the first-order and the second-order adjoint method for the computation of the first-order and the second-order derivatives of the output least-squares objective. We provide discrete formulas for the gradient and the Hessian calculation and present numerical results.     

Local mesh refinement for the discretization of Neumann boundary control problems on polyhedra

This paper deals with optimal control problems constrained by linear elliptic partial differential equations. The case where the right‐hand side of the Neumann boundary is controlled, is studied. The variational discretization concept for these problems is applied, and discretization error estimates are derived. On polyhedral domains, one has to deal with edge and corner singularities, which reduce the convergence rate of the discrete solutions, that is, one cannot expect convergence order two for linear finite elements on quasi‐uniform meshes in general. As a remedy, a local mesh refinement strategy is presented, and a priori bounds for the refinement parameters are derived such that convergence with optimal rate is guaranteed. As a by‐product, finite element error estimates in the H¹(Ω)‐norm, L²(Ω)‐norm and L²(Γ)‐norm for the boundary value problem are obtained, where the latter one turned out to be the main challenge. Copyright © 2015 John Wiley & Sons, Ltd.     

On the proximal point method for equilibrium problems in Hilbert spaces

We analyse a proximal point method for equilibrium problems in Hilbert spaces, improving upon previously known convergence results. We prove global weak convergence of the generated sequence to a solution of the problem, assuming existence of solutions and rather mild monotonicity properties of the bifunction which defines the equilibrium problem, and we establish existence of solutions of the proximal subproblems. We also present a new reformulation of equilibrium problems as variational inequalities ones.     

Stefan problems with nonlinear diffusion and convection

We consider a class of Stefan-type problems having a convection term and a pseudomonotone nonlinear diffusion operator. Assuming data in L¹, we prove existence, uniqueness and stability in the framework of renormalized solutions. Existence is established from compactness and monotonicity arguments which yield stability of solutions with respect to L¹ convergence of the data. Uniqueness is proved through a classical L¹-contraction principle, obtained by a refinement of the doubling variable technique which allows us to extend previous results to a more general class of nonlinear possibly degenerate operators.     

Existence theorem and algorithm for a general implicit variational inequality in Banach space

By using the generalized f-projection operator, the existence theorem of solutions for the general implicit variational inequality GIVI(T-ξ,K) is proved without assuming the monotonicity of operators in reflexive and smooth Banach space. An iterative algorithm for approximating solution of the general implicit variational inequality is suggested also, and the convergence for this iterative scheme is shown. These theorems extend the corresponding results of Wu and Huang [K.Q. Wu, N.J. Huang, Comput. Math. Appl. 54 (2007) 399–406], Wu and Huang [K.Q. Wu, N.J. Huang, Bull. Austral. Math. Soc. 73 (2006) 307–317], Zeng and Yao [L.C. Zeng, J.C. Yao, J. Optimiz. Theory Appl. 132 (2) (2007) 321–337] and Li [J. Li, J. Math. Anal. Appl. 306 (2005) 55–71].     

A class of smoothing functions for nonlinear and mixed complementarity problems

We propose a class of parametric smooth functions that approximate the fundamental plus function, (x)₊=max{0, x}, by twice integrating a probability density function. This leads to classes of smooth parametric nonlinear equation approximations of nonlinear and mixed complementarity problems (NCPs and MCPs). For any solvable NCP or MCP, existence of an arbitrarily accurate solution to the smooth nonlinear equations as well as the NCP or MCP, is established for sufficiently large value of a smoothing parameter . Newton-based algorithms are proposed for the smooth problem. For strongly monotone NCPs, global convergence and local quadratic convergence are established. For solvable monotone NCPs, each accumulation point of the proposed algorithms solves the smooth problem. Exact solutions of our smooth nonlinear equation for various values of the parameter , generate an interior path, which is different from the central path for interior point method. Computational results for 52 test problems compare favorably with these for another Newton-based method. The smooth technique is capable of solving efficiently the test problems solved by Dirkse and Ferris [6], Harker and Xiao [11] and Pang & Gabriel [28].This material is based on research supported by Air Force Office of Scientific Research Grant F49620-94-1-0036 and National Science Foundation Grant CCR-9322479.     

Hybrid iterative scheme by a relaxed extragradient method for solutions of equilibrium problems and a general system of variational inequalities with application to optimization

In this paper, we introduce a new iterative process for finding the common element of the set of fixed points of a nonexpansive mapping, the set of solutions of an equilibrium problem and the solutions of the variational inequality problem for two inverse-strongly monotone mappings. We introduce a new viscosity relaxed extragradient approximation method which is based on the so-called relaxed extragradient method and the viscosity approximation method. We show that the sequence converges strongly to a common element of the above three sets under some parametric controlling conditions. Moreover, using the above theorem, we can apply to finding solutions of a general system of variational inequality and a zero of a maximal monotone operator in a real Hilbert space. The results of this paper extended, improved and connected with the results of Ceng et al., [L.-C. Ceng, C.-Y. Wang, J.-C. Yao, Strong convergence theorems by a relaxed extragradient method for a general system of variational inequalities, Math. Meth. Oper. Res. 67 (2008), 375–390], Plubtieng and Punpaeng, [S. Plubtieng, R. Punpaeng, A new iterative method for equilibrium problems and fixed point problems of nonexpansive mappings and monotone mappings, Appl. Math. Comput. 197 (2) (2008) 548–558] Su et al., [Y. Su, et al., An iterative method of solution for equilibrium and optimization problems, Nonlinear Anal. 69 (8) (2008) 2709–2719], Li and Song [Liwei Li, W. Song, A hybrid of the extragradient method and proximal point algorithm for inverse strongly monotone operators and maximal monotone operators in Banach spaces, Nonlinear Anal.: Hybrid Syst. 1 (3) (2007), 398-413] and many others.     

A viscosity of extragradient approximation method for finding equilibrium problems, variational inequalities and fixed point problems for nonexpansive mappings

In this paper, we investigate the problem for finding the set of solutions for equilibrium problems, the set of solutions of the variational inequalities for k-Lipschitz continuous mappings and fixed point problems for nonexpansive mappings in a Hilbert space. We introduce a new viscosity extragradient approximation method which is based on the so-called viscosity approximation method and extragradient method. We show that the sequence converges strongly to a common element of the above three sets under some parameters controlling conditions. Finally, we utilize our results to study some convergence problems for finding the zeros of maximal monotone operators. Our results are generalization and extension of the results of Kumam [P. Kumam, Strong convergence theorems by an extragradient method for solving variational inequalities and equilibrium problems in a Hilbert space, Turk. J. Math. 33 (2009) 85–98], Wangkeeree [R. Wangkeeree, An extragradient approximation method for equilibrium problems and fixed point problems of a countable family of nonexpansive mappings, Fixed Point Theory and Applications, 2008, Article ID 134148, 17 pages, doi:10.1155/2008/134148], Yao et al. [Y. Yao, Y.C. Liou, R. Chen, A general iterative method for an finite family of nonexpansive mappings, Nonlinear Analysis 69 (5–6) (2008) 1644–1654], Qin et al. [X. Qin, M. Shang, Y. Su, A general iterative method for equilibrium problems and fixed point problems in Hilbert spaces, Nonlinear Analysis (69) (2008) 3897–3909], and many others.     

Viscosity methods for common solutions for equilibrium and hierarchical fixed point problems

Implicit and explicit viscosity methods for finding common solutions of equilibrium and hierarchical fixed points are presented. These methods are used to solve systems of equilibrium problems and variational inequalities where the involving operators are complements of nonexpansive mappings. The results here are situated on the lines of the research of the corresponding results of Moudafi [Krasnoselski-Mann iteration for hierarchical fixed-point problems, Inverse Probl. 23 (2007), pp. 1635–1640; Weak convergence theorems for nonexpansive mappings and equilibrium problems, to appear in JNCA], Moudafi and Maingé [Towards viscosity approximations of hierarchical fixed-points problems, Fixed Point Theory Appl. Art ID 95453 (2006), 10 pp.; Strong convergence of an iterative method for hierarchical fixed point problems, Pac. J. Optim. 3 (2007), pp. 529–538; Coupling viscosity methods with the extragradient algorithm for solving equilibrium problems, to appear in JNCA], Yao and Liou [Weak and strong convergence of Krasnosel'ski?–Mann iteration for hierarchical fixed point problems, Inverse Probl. 24 (2008), 015015 8 pp.], S. Takahashi and W. Takahashi [Viscosity approximation methods for equilibrium problems and fixed point problems in Hilbert spaces, J. Math. Anal. Appl. 331 (2006), pp. 506–515], Xu [Viscosity method for hierarchical fixed point approach to variational inequalities, preprint.], Combettes and Hirstoaga [Equilibrium programming in Hilbert spaces, J. Nonlinear Convex Anal. 6 (2005), pp. 117–136] and Plubtieng and Pumbaeang [A general iterative method for equilibrium problems and fixed point problems in Hilbert spaces, J. Math. Anal. Appl. 336 (2007), pp. 455–469.].     

An iterative algorithm for solving split equality fixed point problems for a class of nonexpansive-type mappings in Banach spaces

In this paper, an iterative algorithm that approximates solutions of split equality fixed point problems (SEFPP) for quasi-?-nonexpansive mappings is constructed. Weak convergence of the sequence generated by this algorithm is established in certain real Banach spaces. The theorem proved is applied to solve split equality problem, split equality variational inclusion problem, and split equality equilibrium problem. Finally, some numerical examples are given to demonstrate the convergence of the algorithm. The theorems proved improve and complement a host of important recent results.

     

Implicit time discretization for the mean curvature flow equation

In this paper we apply the method of implicit time discretization to the mean curvature flow equation including outer forces. In the framework ofBV-functions we construct discrete solutions iteratively by minimizing a suitable energy-functional in each time step. Employing geometric and variational arguments we show an energy estimate which assures compactness of the discrete solutions. An additional convergence condition excludes a loss of area in the limit. Thus existence of solutions to the continuous problem can be derived. We append a brief discussion of the related Mullins-Sekerka equation.This work was supported by the Deutsche Forschungsgemeinschaft through Sonderforschungsbereich 256, Bonn     

Weak set convergence and its application to projection methods

There are many examples in Numerical Analysis where convergence of approximate solutions to a solution of the original problem can not be shown in the sense of a norm topology but in the sense of weak convergence ([6], [9], [10]).

Moreover, (global) solutions are often not unique such that a concept of set convergence instead of convergence in the usual sense is more convenient and reasonable ([1], [2]). This particularly holds if weakly formulated problems are under consideration.

When dealing with problems where both situations coincide, a concept of weak set convergence seems to be adequate. Such a concept is developed and will be applied to certain projections methods.     

Strong convergence of the iterative scheme based on the extragradient method for mixed equilibrium problems and fixed point problems of an infinite family of nonexpansive mappings

In this paper, we introduce an iterative scheme based on the extragradient approximation method for finding a common element of the set of common fixed points of a countable family of nonexpansive mappings, the set of solutions of a mixed equilibrium problem, and the set of solutions of the variational inequality problem for a monotone L-Lipschitz continuous mapping in a real Hilbert space. Then, the strong convergence theorem is proved under some parameters controlling conditions. Applications to optimization problems are given. The results obtained in this paper improve and extend the recent ones announced by Wangkeeree [R. Wangkeeree, An extragradient approximation method for equilibrium problems and fixed point problems of a countable family of nonexpansive mappings, Fixed Point Theory and Applications (2008) 17. doi:10.1155/2008/134148. Article ID 134148], Kumam and Katchang [P. Kumam, P. Katchang, A viscosity of extragradient approximation method for finding equilibrium problems, variational inequalities and fixed point problems for nonexpansive mappings, Nonlinear Anal. Hybrid Syst. (2009) doi:10.1016/j.nahs.2009.03.006] and many others.     

On nonconvex equilibrium problems

In this paper, we introduce a new class of equilibrium problems, known as mixed quasi nonconvex equilibrium problems. We suggest some iterative schemes for solving nonconvex equilibrium problems by using the auxiliary principle technique. The convergence of the proposed methods either requires partially relaxed strongly monotonicity or pseudomonotonicity. As special cases, we obtain a number of known and new results for solving various classes of equilibrium and variational inequality problems.