Related papers: Fast Bellman algorithm for real Monge-Ampere equat…
The elliptic Monge-Amp\`ere equation is a fully nonlinear partial differential equation which has been the focus of increasing attention from the scientific computing community. Fast three dimensional solvers are needed, for example in…
In this paper we propose a new fast splitting algorithm to solve the Weighted Split Bregman minimization problem in the backward step of an accelerated Forward-Backward algorithm. Beside proving the convergence of the method, numerical…
We propose a unifying algorithm for non-smooth non-convex optimization. The algorithm approximates the objective function by a convex model function and finds an approximate (Bregman) proximal point of the convex model. This approximate…
The effective and efficient numerical solution of Riemann-Hilbert problems has been demonstrated in recent work. With the aid of ideas from the method of nonlinear steepest descent for Riemann-Hilbert problems, the resulting numerical…
We address the problem of the best uniform approximation by linear combinations of a finite system of functions. If the system is Chebyshev and the problem is unconstrained, then the classical Remez algorithm provides a fast and precise…
We prove the convergence of a wide stencil finite difference scheme to the Aleksandrov solution of the elliptic Monge-Ampere equation when the right hand side is a sum of Dirac masses. The discrete scheme we analyze for the Dirichlet…
We study tight bounds and fast algorithms for LCLMs of several linear differential operators with polynomial coefficients. We analyze the arithmetic complexity of existing algorithms for LCLMs, as well as the size of their outputs. We…
We construct the upper and lower Bellman functions for the $L^p$ (quasi)-norms of BMO functions. These appear as solutions to a series of Monge--Amp\`ere boundary value problems on a non-convex plane domain. The knowledge of the Bellman…
This paper proposes a novel technique for the approximation of strong solutions $u \in C(\overline{\Omega}) \cap W^{2,n}_\mathrm{loc}(\Omega)$ to uniformly elliptic linear PDE of second order in nondivergence form with continuous leading…
In this paper, using the Bregman distance, we introduce a new projection-type algorithm for finding a common element of the set of solutions of an equilibrium problem and the set of fixed points. Then the strong convergence of the sequence…
Our work presents a new iterative scheme to approximate the fixed points of nonexpansive mapping. The proposed algorithm is constructed to enhance convergence efficiency while preserving theoretical robustness. Under appropriate assumptions…
The numerical analysis for the small amplitude motion of an elastic beam with internal damping is investigated in domain with moving ends. An efficient numerical method is constructed to solve this moving boundary problem. The stability and…
In this paper we present a simple and accurate second order finite element scheme to simulate the Burgers' equation on the whole real line and subjected to initial conditions with compact support. The numerical simulations are performed by…
We examine a wide class of stochastic approximation algorithms for solving (stochastic) nonlinear problems on Riemannian manifolds. Such algorithms arise naturally in the study of Riemannian optimization, game theory and optimal transport,…
In 2004, Muzereau et al. showed how to use a reduction algorithm of the discrete logarithm problem to Diffie-Hellman problem in order to estimate lower bound on Diffie-Hellman problem on elliptic curves. They presented their estimates for…
Monge-Amp\`ere equation $\det(D^2u)=f$ in two dimensional spaces is different in nature from their counterparts in higher dimensional spaces. In this article we employ new ideas to establish two main results for the Monge-Amp\`ere equation…
This work investigates the convergence behavior of augmented Lagrangian methods (ALMs) when applied to convex optimization problems that may be infeasible. ALMs are a popular class of algorithms for solving constrained optimization…
Repeatedly solving the parameterized optimal mass transport (pOMT) problem is a frequent task in applications such as image registration and adaptive grid generation. It is thus critical to develop a highly efficient reduced solver that is…
The classical Minkowski problem for convex bodies has deeply influenced the development of differential geometry. During the past several decades, abundant mathematical theories have been developed for studying the solutions of the…
We propose in this paper a unifying scheme for several algorithms from the literature dedicated to the solving of monotone inclusion problems involving compositions with linear continuous operators in infinite dimensional Hilbert spaces. We…