Related papers: A Note on Weighted Fermat Problem in Lp Space
In numerical linear algebra, a well-established practice is to choose a norm that exploits the structure of the problem at hand in order to optimize accuracy or computational complexity. In numerical polynomial algebra, a single norm…
We obtain sharp weighted estimates for solutions of the equation $\partial$ u = f in a lineally convex domain of finite type. Precisely we obtain estimates in the spaces L p ($\Omega$,$\delta$ $\gamma$), $\delta$ being the distance to the…
In this paper, we introduce a novel two-point gradient method for solving the ill-posed problems in Banach spaces and study its convergence analysis. The method is based on the well known iteratively regularized Landweber iteration method…
The purpose of this paper is to propose and analyze a multi-step iterative algorithm to solve a convex optimization problem and a fixed point problem posed on a Hadamard space. The convergence properties of the proposed algorithm are…
This is the first part of a series of four articles. In this work, we are interested in weighted norm estimates. We put the emphasis on two results of different nature: one is based on a good-$\lambda$ inequality with two-parameters and the…
Quadratic optimization problems (QPs) are ubiquitous, and solution algorithms have matured to a reliable technology. However, the precision of solutions is usually limited due to the underlying floating-point operations. This may cause…
We propose a general framework of iteratively reweighted l1 methods for solving lp regularization problems. We prove that after some iteration k, the iterates generated by the proposed methods have the same support and sign as the limit…
We obtain an analytical solution for the weighted Fermat-Torricelli problem for an equilateral geodesic triangle A_1A_2A_3 which is composed by three equal geodesic arcs (sides) of length Pi/2 for given three positive unequal weights that…
In this paper, we propose and analyze a fast two-point gradient algorithm for solving nonlinear ill-posed problems, which is based on the sequential subspace optimization method. A complete convergence analysis is provided under the…
The images of many distant galaxies are displaced, distorted and often multiplied by the presence of foreground massive galaxies near the line of sight; the foreground galaxies act as gravitational lenses. Commonly, the lens equation, which…
Descent theory (a modern formulation of Fermat's classical method of infinite descent) is a powerful tool in arithmetic geometry. In this article, we reinterpret descent theory through the lens of quotient stacks and apply it in the setting…
We apply modern techniques of dyadic harmonic analysis to obtain sharp estimates for the Bergman projection in weighted Bergman spaces. Our main theorem focuses on the Bergman projection on the Hartogs triangle. The estimates of the…
We discuss two versions of the Fr\'echet distance problem in weighted planar subdivisions. In the first one, the distance between two points is the weighted length of the line segment joining the points. In the second one, the distance…
Two-points nonlocal problem for the first order differential evolution equation with an operator coefficient in a Banach space $X$ is considered. An exponentially convergent algorithm is proposed and justified in assumption that the…
In this paper, we present a polynomial-sized linear programming formulation of the Quadratic Assignment Problem (QAP). The proposed linear program is a network flow-based model. Hence, it provides for the solution of the QAP in polynomial…
We develop fixed-point algorithms for the approximation of structured matrices with rank penalties. In particular we use these fixed-point algorithms for making approximations by sums of exponentials, or frequency estimation. For the basic…
We introduce first weighted function spaces on Rd using the Dunkl convolution that we call Besov-Dunkl spaces. We provide characterizations of these spaces by decomposition of functions. Next we obtain in the real line and in radial case on…
We introduce a new extragradient iterative process, motivated and inspired by [S. H. Khan, A Picard-Mann Hybrid Iterative Process, Fixed Point Theory and Applications, doi:10.1186/1687-1812-2013-69], for finding a common element of the set…
Despite much research, hard weighted problems still resist super-polynomial improvements over their textbook solution. On the other hand, the unweighted versions of these problems have recently witnessed the sought-after speedups.…
In this paper, we study a new iterative method for finding the fixed point of a weak Bregman relatively nonexpansive mapping and the set of solutions of generalized mixed equilibrium problems in Banach spaces.