Related papers: The Implicit Midpoint Procedures for Asymptoticall…
This is a continuation of our previous work entitled \enquote{Alternating Proximity Mapping Method for Convex-Concave Saddle-Point Problems}, in which we proposed the alternating proximal mapping method and showed convergence results on the…
We consider a framework for the construction of iterative schemes for operator equations that combine low-rank approximation in tensor formats and adaptive approximation in a basis. Under fairly general assumptions, we obtain a rigorous…
A three-point iterative method for solving scalar non-linear equations was selected and then adapted to solve systems of non-linear equations. Subsequently, by applying Taylor's theorem to functions of $\R^{n}$ in $\R^{n}$, it is shown that…
We give an overview of basic methods that can be used for obtaining asymptotic expansions of integrals: Watson's lemma, Laplace's method, the saddle point method, and the method of stationary phase. Certain developments in the field of…
The stability of classical semi-implicit scheme, and some more advanced iterative schemes recently proposed for Numerical Weather Prediction (NWP) purpose is examined. In all these schemes, the solution of the centred-implicit non-linear…
We propose a new asymptotic expansion method for nonlinear filtering, based on a small parameter in the system noise. The conditional expectation is expanded as a power series in the noise level, with each coefficient computed by solving a…
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…
A generalization of a viscosity generalized Halpern iteration scheme is analyzed. It is proven that the solution converges asymptotically strongly to a unique fixed point of an asymptotically nonexpansive mapping which drives the iteration…
We consider the problem of finding a fixed point of a nonexpansive mapping, which is also a solution of a pseudo-monotone equilibrium problem, where the bifunction in the equilibrium problem is the sum of two ones. We propose a splitting…
The common fixed points problem requires finding a point in the intersection of fixed points sets of a finite collection of operators. Quickly solving problems of this sort is of great practical importance for engineering and scientific…
Many online, i.e., time-adaptive, inverse problems in signal processing and machine learning fall under the wide umbrella of the asymptotic minimization of a sequence of non-negative, convex, and continuous functions. To incorporate…
We analyze a modified version of Nesterov accelerated gradient algorithm, which applies to affine fixed point problems with non self-adjoint matrices, such as the ones appearing in the theory of Markov decision processes with discounted or…
In this paper, we present a high-order expansion for elliptic equations in high-contrast media. The background conductivity is taken to be one and we assume the medium contains high (or low) conductivity inclusions. We derive an asymptotic…
We describe some "unrestricted" algorithms which are useful for the computation of elementary and special functions when the precision required is not known in advance. Several general classes of algorithms are identified and illustrated by…
This review paper discusses the identification of regions, a crucial first step in applying the "method-of-regions" technique. A systematic approach based on Newton polytope geometry has proven successful and efficient for many cases.…
This paper is devoted to the problem of finding a common fixed point of quasinonexpansive mappings defined on a Hilbert space. To approximate the solution to this problem, we present several iterative processes using the parallel method…
In this paper we apply methods of proof mining to obtain a highly uniform effective rate of asymptotic regularity for the Ishikawa iteration associated to nonexpansive self-mappings of convex subsets of a class of uniformly convex geodesic…
We study the precise asymptotic behavior of a non-trivial solution that converges to zero, as time tends to infinity, of dissipative systems of nonlinear ordinary differential equations. The nonlinear term of the equations may not possess a…
An interior-point algorithm framework is proposed, analyzed, and tested for solving nonlinearly constrained continuous optimization problems. The main setting of interest is when the objective and constraint functions may be nonlinear…
In this work, we develop an adaptive, multivariate partitioning algorithm for solving mixed-integer nonlinear programs (MINLP) with multi-linear terms to global optimality. This iterative algorithm primarily exploits the advantages of…