Variable Inequality Constraints Research Articles

Modified inertial subgradient extragradient algorithms for generalized equilibria systems with constraints of variational inequalities and fixed points

<abstract><p>In this research, we studied modified inertial composite subgradient extragradient implicit rules for finding solutions of a system of generalized equilibrium problems with a common fixed-point problem and pseudomonotone variational inequality constraints. The suggested methods consisted of an inertial iterative algorithm, a hybrid deepest-descent technique, and a subgradient extragradient method. We proved that the constructed algorithms converge to a solution of the considered problem, which also solved some hierarchical variational inequality.</p></abstract>

An Incremental Gradient Method for Optimization Problems With Variational Inequality Constraints

We consider minimizing a sum of agent-specific nondifferentiable merely convex functions over the solution set of a variational inequality (VI) problem in that each agent is associated with a local monotone mapping. This problem finds an application in computation of the best equilibrium in nonlinear complementarity problems arising in transportation networks. We develop an iteratively regularized incremental gradient method where at each iteration, agents communicate over a directed cycle graph to update their solution iterates using their local information about the objective and the mapping. The proposed method is single-timescale in the sense that it does not involve any excessive hard-to-project computation per iteration. We derive non-asymptotic agent-wise convergence rates for the suboptimality of the global objective function and infeasibility of the VI constraints measured by a suitably defined dual gap function. The proposed method appears to be the first fully iterative scheme equipped with iteration complexity that can address distributed optimization problems with VI constraints over cycle graphs.

Stochastic Approximation for Estimating the Price of Stability in Stochastic Nash Games

The goal in this paper is to approximate the Price of Stability (PoS) in stochastic Nash games using stochastic approximation (SA) schemes. PoS is amongst the most popular metrics in game theory and provides an avenue for estimating the efficiency of Nash games. In particular, knowing the value of PoS can help with designing efficient networked systems, including transportation networks and power market mechanisms. Motivated by the absence of efficient methods for computing the PoS, first we consider stochastic optimization problems with a nonsmooth and merely convex objective function and a merely monotone stochastic variational inequality (SVI) constraint. This problem appears in the numerator of the PoS ratio. We develop a randomized block-coordinate stochastic extra-(sub)gradient method where we employ a novel iterative penalization scheme to account for the mapping of the SVI in each of the two gradient updates of the algorithm. We obtain an iteration complexity of the order ϵ − 4 that appears to be best known result for this class of constrained stochastic optimization problems, where ϵ denotes an arbitrary bound on suitably defined infeasibility and suboptimality metrics. Second, we develop an SA-based scheme for approximating the PoS and derive lower and upper bounds on the approximation error. To validate the theoretical findings, we provide preliminary simulation results on a networked stochastic Nash Cournot competition.

Hybrid Alternated Inertial Projection and Contraction Algorithm for Solving Bilevel Variational Inequality Problems

This paper considers an alternated inertial-type extrapolation algorithm for solving bilevel pseudomonotone variational inequality problem in the framework of real Hilbert spaces with split variational inequality and fixed-point constraints of demimetric mapping. The algorithm which involves alternated inertial uses self-adjustment stepsize condition that depends solely on the information from previous iterative step. The bilevel problem considered in the work consists of upper-level problem with an underlying operator which is pseudomonotone, while the lower problem is associated with strongly monotone mapping and the fixed-point constraint of demimetric mapping. Our algorithm is anchored on modified projection and contraction techniques, fused with alternated inertial and relaxation. Under some suitable conditions on the algorithm control parameters, we obtain a strong convergence result of the proposed method without the prior knowledge of the operator norm or the coefficients of the underlying operators within the scope of real Hilbert spaces. Finally, some numerical examples are presented to illustrate the gain of our method in comparison to some related algorithms in the literature.

On Mann implicit composite subgradient extragradient methods for general systems of variational inequalities with hierarchical variational inequality constraints

In a real Hilbert space, let the VIP, GSVI, HVI, and CFPP denote a variational inequality problem, a general system of variational inequalities, a hierarchical variational inequality, and a common fixed-point problem of a countable family of uniformly Lipschitzian pseudocontractive mappings and an asymptotically nonexpansive mapping, respectively. We design two Mann implicit composite subgradient extragradient algorithms with line-search process for finding a common solution of the CFPP, GSVI, and VIP. The suggested algorithms are based on the Mann implicit iteration method, subgradient extragradient method with line-search process, and viscosity approximation method. Under mild assumptions, we prove the strong convergence of the suggested algorithms to a common solution of the CFPP, GSVI, and VIP, which solves a certain HVI defined on their common solutions set.

Well-posedness for multi-time variational inequality problems via generalized monotonicity and for variational problems with multi-time variational inequality constraints

The present paper investigates the well-posedness associated with multi-time variational inequality problems and the corresponding variational problems involving aforesaid inequality as a constraint. Firstly, we introduce the multi-time variational inequality problems determined by curvilinear integral functionals. Thereafter, we present the metric characterization of well-posedness in terms of approximate solution by defining the generalized monotonicity for the considered multi-time functional. Also, we establish that the well-posedness is equivalent to the existence and uniqueness of solution for the problems under consideration. Moreover, the mathematical development is accompanied by various illustrative examples.

On Well-Posedness of Some Constrained Variational Problems

By considering the new forms of the notions of lower semicontinuity, pseudomonotonicity, hemicontinuity and monotonicity of the considered scalar multiple integral functional, in this paper we study the well-posedness of a new class of variational problems with variational inequality constraints. More specifically, by defining the set of approximating solutions for the class of variational problems under study, we establish several results on well-posedness.

Well Posedness of New Optimization Problems with Variational Inequality Constraints

In this paper, we studied the well posedness for a new class of optimization problems with variational inequality constraints involving second-order partial derivatives. More precisely, by using the notions of lower semicontinuity, pseudomonotonicity, hemicontinuity and monotonicity for a multiple integral functional, and by introducing the set of approximating solutions for the considered class of constrained optimization problems, we established some characterization results on well posedness. Furthermore, to illustrate the theoretical developments included in this paper, we present some examples.

A Method with Convergence Rates for Optimization Problems with Variational Inequality Constraints

We consider a class of optimization problems with Cartesian variational inequality (CVI) constraints, where the objective function is convex and the CVI is associated with a monotone mapping and a ...

An Algorithm for a Class of Bilevel Variational Inequalities with Split Variational Inequality and Fixed Point Problem Constraints

In this paper, we investigate the problem of solving strongly monotone variational inequality problems over the solution set of a split variational inequality and fixed point problem. Strong convergence of the iterative process is proved. In particular, the problem of finding a common solution to a variational inequality with pseudomonotone mapping and a fixed point problem involving demicontractive mapping is also studied. Besides, we get a strongly convergent algorithm for finding the minimum-norm solution to the split feasibility problem, which requires only two projections at each step. A simple numerical example is given to illustrate the proposed algorithm.

On general implicit hybrid iteration method for triple hierarchical variational inequalities with hierarchical variational inequality constraints

In this paper, we study the triple hierarchical variational inequality problem (THVIP, for short) with the hierarchical variational inequality constraint for finitely many nonexpansive mappings and an asymptotically nonexpansive mapping in a real Hilbert space. Based on Korpelevich's extragradient method, hybrid steepest-descent method, Mann's implicit iteration method and Halpern's iteration method, a general implicit hybrid iterative algorithm for solving this THVIP is proposed. Under mild conditions, the strong convergence of the iterative sequences generated by the algorithm is established. Our results improve and extend the corresponding results in the earlier and recent literature.

Sufficiency for singular trajectories in the calculus of variations

For calculus of variations problems of Bolza with variable end-points, nonlinear inequality and equality isoperimetric constraints and nonlinear inequality and equality mixed pointwise constraints, sufficient conditions for strong minima are derived. The main novelty of the new sufficiency results presented in this article concerns their applicability to cases in which the derivatives of the extremals to be optimal solutions are not necessarily continuous nor piecewise continuous but only essentially bounded and they do not necessarily satisfy the standard strengthened Legendre condition but only the corresponding necessary condition.

A general viscosity implicit iterative algorithm for split variational inclusions with hierarchical variational inequality constraints

A general viscosity implicit iterative algorithm for split variational inclusions with hierarchical variational inequality constraints

Decentralized hierarchical constrained convex optimization

This paper proposes a decentralized optimization algorithm for the triple-hierarchical constrained convex optimization problem of minimizing a sum of strongly convex functions subject to a paramonotone variational inequality constraint over an intersection of fixed point sets of nonexpansive mappings. The existing algorithms for solving this problem are centralized optimization algorithms using all the information in the problem, and these algorithms are effective, but only under certain additional restrictions. The main contribution of this paper is to present a convergence analysis of the proposed algorithm in order to show that the proposed algorithm using incremental gradients with diminishing step-size sequences converges to the solution to the problem without any additional restrictions. Another contribution of this paper is the elucidation of the practical applications of hierarchical constrained optimization in the form of network resource allocation and optimal control problems. In particular, it is shown that the proposed algorithm can be applied to decentralized network resource allocation with a triple-hierarchical structure.

Some Mann-Type Implicit Iteration Methods for Triple Hierarchical Variational Inequalities, Systems Variational Inequalities and Fixed Point Problems

This paper discusses a monotone variational inequality problem with a variational inequality constraint over the common solution set of a general system of variational inequalities (GSVI) and a common fixed point (CFP) of a countable family of nonexpansive mappings and an asymptotically nonexpansive mapping in Hilbert spaces, which is called the triple hierarchical constrained variational inequality (THCVI), and introduces some Mann-type implicit iteration methods for solving it. Norm convergence of the proposed methods of the iteration methods is guaranteed under some suitable assumptions.

Triple Hierarchical Variational Inequalities, Systems of Variational Inequalities, and Fixed Point Problems

In this paper, we introduce a multiple hybrid implicit iteration method for finding a solution for a monotone variational inequality with a variational inequality constraint over the common solution set of a general system of variational inequalities, and a common fixed point problem of a countable family of uniformly Lipschitzian pseudocontractive mappings and an asymptotically nonexpansive mapping in Hilbert spaces. Strong convergence of the proposed method to the unique solution of the problem is established under some suitable assumptions.

Hybrid Mann Viscosity Implicit Iteration Methods for Triple Hierarchical Variational Inequalities, Systems of Variational Inequalities and Fixed Point Problems

In the present work, we introduce a hybrid Mann viscosity-like implicit iteration to find solutions of a monotone classical variational inequality with a variational inequality constraint over the common solution set of a general system of variational inequalities and a problem of common fixed points of an asymptotically nonexpansive mapping and a countable of uniformly Lipschitzian pseudocontractive mappings in Hilbert spaces, which is called the triple hierarchical constrained variational inequality. Strong convergence of the proposed method to the unique solution of the problem is guaranteed under some suitable assumptions. As a sub-result, we provide an algorithm to solve problem of common fixed points of pseudocontractive, nonexpansive mappings, variational inequality problems and generalized mixed bifunction equilibrium problems in Hilbert spaces.

Systems of variational inequalities with hierarchical variational inequality constraints for Lipschitzian pseudocontractions

Systems of variational inequalities with hierarchical variational inequality constraints for Lipschitzian pseudocontractions

Systems of variational inequalities with hierarchical variational inequality constraints for asymptotically nonexpansive and pseudocontractive mappings

The purpose of this paper is to introduce and analyze a hybrid extragradient-like implicit rule for finding a common solution of a general system of variational inequalities (GSVI) and a common fixed point problem (CFPP) of a countable family of uniformly Lipschitzian pseudocontractive mappings and an asymptotically nonexpansive mapping in Hilbert spaces. Here the hybrid extragradient-like implicit rule is based on Korpelevich’s extragradient method, the viscosity approximation method and the Mann iteration method. We prove the strong convergence of this method to a common solution of the GSVI and the CFPP, which solves a certain variational inequality on their common solution set. As an application, we give an algorithm to solve common fixed point problems of nonexpansive and pseudocontractive mappings, variational inequality problems and generalized mixed equilibrium problems in Hilbert spaces.

Convergence theorems for composite viscosity approaches to systems variational inequalities in Banach spaces

In this paper, we study a general system of variational inequalities with a hierarchical variational inequality constraint for an infinite family of nonexpansive mappings. We introduce general implicit and explicit iterative algorithms. We prove the strong convergence of the sequences generated by the proposed iterative algorithms to a solution of the studied problems.