Related papers: A time-variant norm constrained interpolation prob…
A new time relaxation model with iterative modified Lavrentiev regularization method is studied. The aim of the relaxation term is to drive the unresolved fluctuations in a computational simulation to zero exponentially faster by an…
In this article, we study the convergence of algorithms for solving monotone inclusions in the presence of adjoint mismatch. The adjoint mismatch arises when the adjoint of a linear operator is replaced by an approximation, due to…
Electrostatic correlations and fluctuations in ionic systems can be described within an extended Poisson-Boltzmann theory using a Gaussian variational form. The resulting equations are challenging to solve because they require the solution…
The purpose of the paper is to give a pedagogical introduction to the multiple time-scale technique, on the example of the high friction limit of the Kramers equation. We begin with a discussion of the standard perturbation technique as…
We present a finite-order system of recurrence relations for a permanent of circulant matrices containing a band of k any-value diagonals on top of a uniform matrix (for k = 1, 2, and 3) as well as the method for deriving such recurrence…
In this work, we focus on separable convex optimization problems with linear and box constraints and compute the solution in closed-form as a function of some Lagrange multipliers that can be easily computed in a finite number of…
In this paper, we propose a new framework for solving a general dynamic optimal stopping problem without time consistency. A sophisticated solution is proposed and is well-defined for any time setting with general flows of objectives. A…
We study an abstract family of asymptotically degenerating variational problems. Those are natural generalisations of families of problems emerging upon application of a rescaled Floquet-Bloch-Gelfand transform to resolvent problems for…
This paper develops a robust fixed time optimization framework for constrained problems that guarantees exact constraint satisfaction and convergence to KKT points within fixed time , independent of initial conditions. The approach treats…
We consider a general second order matrix operator in a multi-dimensional domain subject to a classical boundary condition. This operator is perturbed by a first order differential operator, the coefficients of which depend arbitrarily on a…
In order to solve an initial value problem by the variational iteration method, a sequence of functions is produced which converges to the solution under some suitable conditions. In the nonlinear case, after a few iterations the terms of…
We establish in this paper, an existence and uniqueness result of right continuous with bounded variation solution for a perturbed differential inclusion governed by time-dependent maximal monotone operators.
In this article we present a modified S-iteration process that we combine with inertial extrapolation to find a common solution to the split monotone inclusion problem and the fixed point problem in real Hilbert space.Our goal is to…
We study several variants of decomposing a symmetric matrix into a sum of a low-rank positive semidefinite matrix and a diagonal matrix. Such decompositions have applications in factor analysis and they have been studied for many decades.…
An exact invariant is derived for $n$-degree-of-freedom Hamiltonian systems with general time-dependent potentials. The invariant is worked out in two equivalent ways. In the first approach, we define a special {\it Ansatz\/} for the…
We present original time-parallel algorithms for the solution of the implicit Euler discretization of general linear parabolic evolution equations with time-dependent self-adjoint spatial operators. Motivated by the inf-sup theory of…
We describe and solve three puzzles arising in covariant and supertranslation-invariant formulas for the flux of angular momentum and other Lorentz charges in asymptotically flat spacetimes: 1) Supertranslation-invariance and covariance…
We provide improved space-time tradeoffs for permutation problems over additively idempotent semi-rings. In particular, there is an algorithm for the Traveling Salesperson Problem that solves $N$-vertex instances using space $S$ and time…
We present lifted linear relaxations of the OPF problem.
We study multiple orthogonal polynomials exploiting their explicit determinantal representation in terms of moments. Our reasoning follows that applied to solve the Hermite-Pad\'{e} approximation and interpolation problems. We study also…