Related papers: The ellipsoid method redux
This paper is devoted to logarithmic Hardy-Littlewood-Sobolev inequalities in the two-dimensional Euclidean space, in presence of an external potential with logarithmic growth. The coupling with the potential introduces a new parameter,…
Motivated by problems in contact mechanics, we propose a duality approach for computing approximations and associated a posteriori error bounds to solutions of variational inequalities of the first kind. The proposed approach improves upon…
We use "generalized" version of total variation, coarea formulas, isoperimetric inequalities to obtain sharp estimates for solutions (and for their gradients) to anisotropic elliptic equations with a lower order term, comparing them with…
We introduce a generalized finite difference method for solving a large range of fully nonlinear elliptic partial differential equations in three dimensions. Methods are based on Cartesian grids, augmented by additional points carefully…
We introduce in this document a direct method allowing to solve numerically inverse type problems for linear parabolic equations. We consider the reconstruction of the full solution of the parabolic equation posed in $\Omega\times (0,T)$ -…
In this paper, we present a unified analysis of methods for such a wide class of problems as variational inequalities, which includes minimization problems and saddle point problems. We develop our analysis on the modified Extra-Gradient…
Visual insights into a wide variety of statistical methods, for both didactic and data analytic purposes, can often be achieved through geometric diagrams and geometrically based statistical graphs. This paper extols and illustrates the…
This paper examines a variety of classical optimization problems, including well-known minimization tasks and more general variational inequalities. We consider a stochastic formulation of these problems, and unlike most previous work, we…
This paper addresses a multi-scale finite element method for second order linear elliptic equations with arbitrarily rough coefficient. We propose a local oversampling method to construct basis functions that have optimal local…
A common problem, arising in many different applied contexts, consists in estimating the number of exponentially damped sinusoids whose weighted sum best fits a finite set of noisy data and in estimating their parameters. Many different…
We present a weak finite element method for elliptic problems in one space dimension. Our analysis shows that this method has more advantages than the known weak Galerkin method proposed for multi-dimensional problems, for example, it has…
Binary optimization is a central problem in mathematical optimization and its applications are abundant. To solve this problem, we propose a new class of continuous optimization techniques which is based on Mathematical Programming with…
Multi-dimensional distributions of discrete data that resemble ellipsoids arise in numerous areas of science, statistics, and computational geometry. We describe a complete algebraic algorithm to determine the quadratic form specifying the…
The goal of this paper is to provide computational tools able to find a solution of a system of polynomial inequalities. The set of inequalities is reformulated as a system of polynomial equations. Three different methods, two of which…
A new algorithms for computing discrete logarithms on elliptic curves defined over finite fields is suggested. It is based on a new method to find zeroes of summation polynomials. In binary elliptic curves one is to solve a cubic system of…
We present a perturbed subspace iteration algorithm to approximate the lowermost eigenvalue cluster of an elliptic eigenvalue problem. As a prototype, we consider the Laplace eigenvalue problem posed in a polygonal domain. The algorithm is…
The object of the present paper is to extend the third-order iterative method for solving nonlinear equations into systems of nonlinear equations. Since our motive is to develop the method which improve the order of convergence of Newton's…
Three algorithm are proposed to evaluate volume potentials that arise in boundary element methods for elliptic PDEs. The approach is to apply a modified fast multipole method for a boundary concentrated volume mesh. If $h$ is the meshwidth…
The aim of this paper is to investigate the use of an entropic projection method for the iterative regularization of linear ill-posed problems. We derive a closed form solution for the iterates and analyze their convergence behaviour both…
In this paper, we study the mathematical structure and numerical approximation of elliptic problems posed in a (3D) domain $\Omega$ when the right-hand side is a (1D) line source $\Lambda$. The analysis and approximation of such problems is…