Related papers: Splitting forward-backward penalty scheme for cons…
In this paper, we introduce some adaptive methods for solving variational inequalities with relatively strongly monotone operators. Firstly, we focus on the modification of the recently proposed, in smooth case [1], adaptive numerical…
We consider strongly-convex-strongly-concave saddle-point problems with general non-bilinear objective and different condition numbers with respect to the primal and the dual variables. First, we consider such problems with smooth composite…
The splitting method is a powerful method for solving partial differential equations. Various splitting methods have been designed to separate different physics, nonlinearities, and so on. Recently, a new splitting approach has been…
In this paper, we develop a parameterized proximal point algorithm (P-PPA) for solving a class of separable convex programming problems subject to linear and convex constraints. The proposed algorithm is provable to be globally convergent…
We propose a class of numerical schemes for nonlocal HJB variational inequalities (HJBVIs) with monotone drivers. The solution and free boundary of the HJBVI are constructed from a sequence of penalized equations, for which a continuous…
In this article we provide a splitting method for solving monotone inclusions in a real Hilbert space involving four operators: a maximally monotone, a monotone-Lipschitzian, a cocoercive, and a monotone-continuous operator. The proposed…
We develop numerical methods for elliptic systems governed by partial segregation constraints, in which three nonnegative components are required to have a vanishing pointwise product throughout the domain. This constraint enforces that at…
People tend to behave inconsistently over time due to an inherent present bias. As this may impair performance, social and economic settings need to be adapted accordingly. Common tools to reduce the impact of time-inconsistent behavior are…
We propose a variational splitting technique for the generalized-$\alpha$ method to solve hyperbolic partial differential equations. We use tensor-product meshes to develop the splitting method, which has a computational cost that grows…
Splitting algorithms for finding a zero of sum of operators often involve multiple steps which are referred to as forward or backward steps. Forward steps are the explicit use of the operators and backward steps involve the operators…
The deviation vectors provide additional degrees of freedom and effectively enhance the flexibility of algorithms. In the literature, the iterative schemes with deviations are constructed and their convergence analyses are performed on an…
In this paper, we consider the problem of minimizing a smooth function, given as finite sum of black-box functions, over a convex set. In order to advantageously exploit the structure of the problem, for instance when the terms of the…
In this paper, we study the strong convergence of an algorithm to solve the variational inequality problem which extends(Thong et al, Numerical Algorithms. 78, 1045-1060 (2018)). We have reduced and refined some of their algorithm's…
We develop and analyze an asynchronous algorithm for distributed convex optimization when the objective writes a sum of smooth functions, local to each worker, and a non-smooth function. Unlike many existing methods, our distributed…
Mathematical programs with complementarity constraints are notoriously difficult to solve due to their nonconvexity and lack of constraint qualifications in every feasible point. This work focuses on the subclass of quadratic programs with…
In this paper, we consider a class of structured nonconvex nonsmooth optimization problems whose objective function is the sum of three nonconvex functions, one of which is expressed in a difference-of-convex (DC) form. This problem class…
We introduce a new system of split variational inequality problems which is a natural extension of split variational inequality problem in semi-inner product spaces. We use the retraction technique to propose an iterative algorithm for…
This work addresses the issue of large covariance matrix estimation in high-dimensional statistical analysis. Recently, improved iterative algorithms with positive-definite guarantee have been developed. However, these algorithms cannot be…
In this article, we aim to approximate a solution to the bilevel equilibrium problem $\mathbf{(BEP})$ for short: find $\bar{x} \in \mathbf{S}_f$ such that $ g(\bar{x}, y) \geq 0, \,\, \forall y \in \mathbf{S}_f, $ where $ \mathbf{S}_f = \{…
In this paper, we analyse a Vector Penalty Projection Scheme (see [1]) to treat the displacement of a moving body in incompressible viscous flows in the case where the interaction of the fluid on the body can be neglected. The presence of…