Related papers: Extragradient and linesearch algorithms for solvin…
The aim of this paper is to establish strong convergence theorems for a strongly relatively nonexpansive sequence in a smooth and uniformly convex Banach space. Then we employ our results to approximate solutions of the zero point problem…
We address the Nash equilibrium problem in a partial-decision information scenario, where each agent can only observe the actions of some neighbors, while its cost possibly depends on the strategies of other agents. Our main contribution is…
In this paper, we introduce a new method for solving variational inequality problems with monotone and Lipschitz-continuous mapping in Hilbert space. The iterative process is based on two well-known projection method and the hybrid (or…
In this paper, we propose a method that has foundations in the line search sequential quadratic programming paradigm for solving general nonlinear equality constrained optimization problems. The method employs a carefully designed modified…
We prove a new linearization principle for the nonlinear stability of solutions to semilinear evolution equations of parabolic type. We assume that the set of equilibria forms a finite dimensional manifold of normally stable and normally…
Unconstrained optimization problems are typically solved using iterative methods, which often depend on line search techniques to determine optimal step lengths in each iteration. This paper introduces a novel line search approach.…
We develop a novel method for finding bifurcations for nonlinear systems of equations based on directly finding bifurcations through saddle points of extended quotients. The method is applied to find the saddle-node bifurcation point for…
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…
Recently, minimax optimization received renewed focus due to modern applications in machine learning, robust optimization, and reinforcement learning. The scale of these applications naturally leads to the use of first-order methods.…
A general lattice Boltzmann (LB) model is proposed for solving nonlinear partial differential equations with the form $\partial_t \phi+\sum_{k=1}^{m} \alpha_k \partial_x^k \Pi_k (\phi)=0$, where $\alpha_k$ are constant coefficients, and…
The objective of this manuscript is to enquire for the solvability of a specific type of non-linear quadratic integral equations via the interesting notion of measure of non-compactness. Firstly, we inquire into couple of exciting fixed…
We present a novel deep learning approach to approximate the solution of large, sparse, symmetric, positive-definite linear systems of equations. These systems arise from many problems in applied science, e.g., in numerical methods for…
In this work, we address unconstrained finite-sum optimization problems, with particular focus on instances originating in large scale deep learning scenarios. Our main interest lies in the exploration of the relationship between recent…
We propose a first-order method for solving inequality constrained optimization problems. The method is derived from our previous work [12], a modified search direction method (MSDM) that applies the singular-value decomposition of…
The aim of this paper is to establish a strong convergence theorem for a strongly nonexpansive sequence in a Banach space. We also deal with some applications of the convergence theorem.
This paper studies large-scale optimization problems on Riemannian manifolds whose objective function is a finite sum of negative log-probability losses. Such problems arise in various machine learning and signal processing applications. By…
We study the convergence of semilinear parabolic stochastic evolution equations, posed on a sequence of Banach spaces approximating a limiting space and driven by additive white noise projected onto the former spaces. Under appropriate…
The objective of this research is to explore a convex feasibility problem, which consists of a monotone variational inequality problem and a fixed point problem. We introduce four inertial extragradient algorithms that are motivated by the…
Deep equilibrium models (DEQs) achieve infinitely deep network representations without stacking layers by exploring fixed points of layer transformations in neural networks. Such models constitute an innovative approach that achieves…
In this study, we introduce a new iterative processes to approximate common fixed points of an infinite family of quasi-nonexpansive mappings and obtain a strongly convergent iterative sequence to the common fixed points of these mappings…