相关论文: Split general quasi-variational inequality problem

We show that the asynchronous block-iterative primal-dual projective splitting framework introduced by P. L. Combettes and J. Eckstein in their 2018 Math. Program. paper can be viewed as an instantiation of the recently proposed warped…

In this paper, we design a new iterative algorithm for solving pseudomonotone equilibrium problems in real Hilbert spaces. The advantage of our algorithm is that it requires only one strongly convex programming problem at each iteration.…

This paper presents a general convergence theory of penalty based numerical methods for elliptic constrained inequality problems, including variational inequalities, hemivariational inequalities, and variational-hemivariational…

Complementarity problems and variational inequalities arise in a wide variety of areas, including machine learning, planning, game theory, and physical simulation. In all of these areas, to handle large-scale problem instances, we need fast…

In this paper, we study the splitting method based on alternating direction method of multipliers for support vector machine in reproducing kernel Hilbert space with lower semi-continuous loss function. If the loss function is lower…

We propose a hybrid inertial self-adaptive algorithm for solving the split feasibility problem and fixed point problem in the class of demicontractive mappings. Our results are very general and extend several related results existing in…

In this paper we study the bounded perturbation resilience of projection and contraction algorithms for solving variational inequality (VI) problems in real Hilbert spaces. Under typical and standard assumptions of monotonicity and…

Variable projection methods prove highly efficient in solving separable nonlinear least squares problems by transforming them into a reduced nonlinear least squares problem, typically solvable via the Gauss-Newton method. When solving…

We introduce an algorithm to solve linear inverse problems regularized with the total (gradient) variation in a gridless manner. Contrary to most existing methods, that produce an approximate solution which is piecewise constant on a fixed…

Variational-hemivariational inequalities are an important mathematical framework for nonsmooth problems. The framework can be used to study application problems from physical sciences and engineering that involve non-smooth and even…

The paper is devoted to well-posedness analysis and the numerical solution of a family of general elliptic mixed variational-hemivariational inequalities. Various mixed variational equations, mixed variational inequalities and mixed…

In this paper, we analyze the convergence %semi-convergence properties of projected non-stationary block iterative methods (P-BIM) aiming to find a constrained solution to large linear, usually both noisy and ill-conditioned, systems of…

We describe a new algorithm for computing Whitney stratifications of complex projective varieties. The main ingredients are (a) an algebraic criterion, due to L\^e and Teissier, which reformulates Whitney regularity in terms of conormal…

This paper is a continuation to the study of generalized quasi contractive operators, essentially due to Akhtar et al. [A multi-step implicit iterative process for common fixed points of generalized C^{q}-operators in convex metric spaces,…

Considering some parameters and by means of an inequality of Hadamard, we derive general half-discrete Hilbert-type inequalities. Then we highlight some special cases.

When solving ill-posed inverse problems, a good choice of the prior is critical for the computation of a reasonable solution. A common approach is to include a Gaussian prior, which is defined by a mean vector and a symmetric and positive…

We develop a general framework for numerically solving differential equations while preserving invariants. As in standard projection methods, we project an arbitrary base integrator onto an invariant-preserving manifold, however, our method…

Vector optimization problems are a generalization of multiobjective optimization in which the preference order is related to an arbitrary closed and convex cone, rather than the nonnegative octant. Due to its real life applications, it is…

Let \phi(G) be the minimum conductance of an undirected graph G, and let 0=\lambda_1 <= \lambda_2 <=... <= \lambda_n <= 2 be the eigenvalues of the normalized Laplacian matrix of G. We prove that for any graph G and any k >= 2, \phi(G) =…

The forward-backward operator splitting algorithm is one of the most important methods for solving the optimization problem of the sum of two convex functions, where one is differentiable with a Lipschitz continuous gradient and the other…