Related papers: A Sequential Constraint Method for Solving Variati…
We consider the method of alternating projections for finding a point in the intersection of two closed sets, possibly nonconvex. Assuming only the standard transversality condition (or a weaker version thereof), we prove local linear…
The subgradient projection iteration is a classical method for solving a convex inequality. Motivated by works of Polyak and of Crombez, we present and analyze a more general method for finding a fixed point of a cutter, provided that the…
This work is devoted to establish the strong convergence results of an iterative algorithm generated by the shrinking projection method in Hilbert spaces. The proposed approximation sequence is used to find a common element in the set of…
A yet unmet challenge in algorithmic fairness is the problem of intersectionality, that is, achieving fairness across the intersection of multiple groups -- and verifying that such fairness has been attained. Because intersectional groups…
The data-compatibility approach to constrained optimization, proposed here, strives to a point that is "close enough" to the solution set and whose target function value is "close enough" to the constrained minimum value. These notions can…
In this paper, an inexact proximal-point penalty method is studied for constrained optimization problems, where the objective function is non-convex, and the constraint functions can also be non-convex. The proposed method approximately…
Stochastic nonconvex optimization problems with nonlinear constraints have a broad range of applications in intelligent transportation, cyber-security, and smart grids. In this paper, first, we propose an inexact-proximal accelerated…
We develop the viscosity method for the homogenization of an obstacle problem with highly oscillating obstacles. The associated operator, in non-divergence form, is linear and elliptic with variable coefficients. We first construct a highly…
We analyze inexact fixed point iterations where the generating function contains an inexact solve of an equation system to answer the question of how tolerances for the inner solves influence the iteration error of the outer fixed point…
Variational inequality problems are recognized for their broad applications across various fields including machine learning and operations research. First-order methods have emerged as the standard approach for solving these problems due…
In this paper, we study a new iterative method for a common fixed point of a finite family of Bregman strongly nonexpansive mappings in the frame work of reflexive real Banach spaces. Moreover, we prove the strong convergence theorem for…
This paper presents an approach for obtaining approximate solutions to quasi-variational inequalities in a real Hilbert space by modifying Tseng's scheme, which was originally designed for variational inequalities. The study explores the…
We consider a class of nonsmooth fractional programming problems with fixed-point constraints, where the numerator is convex and the denominator is concave. To solve this problem, we propose splitting algorithms that compute subgradient…
Let $Q$ be a nonempty closed and convex subset of a real Hilbert space $% \mathcal{H}$. $T:Q\rightarrow Q$ is a nonexpansive mapping which has a least one fixed point. $f:Q\rightarrow \mathcal{H}$ is a Lipschitzian function, and $%…
We study a fixed point iterative method based on generalized relaxation of strictly quasi-nonexpansive operators. The iterative method is assembled by averaging of strings, and each string is composed of finitely many strictly…
A system of a first order history-dependent evolutionary variational-hemivariational inequality with unilateral constraints coupled with a nonlinear ordinary differential equation in a Banach space is studied. Based on a fixed point theorem…
This paper concerns models and convergence principles for dealing with stochasticity in a wide range of algorithms arising in nonlinear analysis and optimization in Hilbert spaces. It proposes a flexible geometric framework within which…
A multiscale numerical method is proposed for the solution of semi-linear elliptic stochastic partial differential equations with localized uncertainties and non-linearities, the uncertainties being modeled by a set of random parameters. It…
This paper discusses the approximate controllability of a fractional differential control problem driven by a nonlinear hemivariational inequality in a Hilbert space. First, we prove the existence of a mild solution for a fractional control…
This paper proposes novel algorithm for non-convex multimodal constrained optimisation problems. It is based on sequential solving restrictions of problem to sections of feasible set by random subspaces (in general, manifolds) of low…