Related papers: Multiplicative perturbation bounds for the General…
This paper deals with a general form of variational problems in Banach spaces which encompasses variational inequalities as well as minimization problems. We prove a characterization of local error bounds for the distance to the…
We introduce a large class of mappings, called enriched contractions, which includes, amongst many other contractive type mappings, the Picard-Banach contractions and some nonexpansive mappings. We show that any enriched contraction has a…
We establish estimates for the Lebesgue parameters of the Chebyshev Weak Thresholding Greedy Algorithm in the case of general bases in Banach spaces. These generalize and slightly improve earlier results in [9], and are complemented with…
Randomized block Krylov subspace methods form a powerful class of algorithms for computing the extreme eigenvalues of a symmetric matrix or the extreme singular values of a general matrix. The purpose of this paper is to develop new…
We apply duality theory to discretized convex minimization problems to obtain computable guaranteed upper bounds for the distance of given discrete functions and the exact discrete minimizer. Furthermore, we show that the discrete duality…
The manuscript is devoted to the boundary behavior of mappings with bounded and finite distortion. We consider mappings of domains of the Euclidean space that satisfy weighted Poletsky inequality. Assume that, the definition domain is…
Chernoff bounds are a powerful application of the Markov inequality to produce strong bounds on the tails of probability distributions. They are often used to bound the tail probabilities of sums of Poisson trials, or in regression to…
Cholesky factorization is a widely used method for solving linear systems involving symmetric, positive-definite matrices, and can be an attractive choice in applications where a high degree of numerical stability is needed. One such…
We consider a variational problem with boundary singularity and Dirichlet condition. We give a blow-up analysis for sequences of solutions of an equation with exponential nonlinearity. Also, we derive a compactness criterion under some…
In this paper we study greedy approximation in Banach spaces. We discuss a modification of the Weak Chebyshev Greedy Algorithm, in which steps of the algorithm can be executed imprecisely. Such inaccuracies are represented by both absolute…
In this paper we study the behavior of finite dimensional fixed point iterations, induced by discretization of a continuous fixed point iteration defined within a Banach space setting. We show that the difference between the discrete…
Let $E$ be a uniformly smooth and uniformly convex real Banach space and $E^*$ be its dual space. Suppose $A : E\rightarrow E^*$ is bounded, strongly monotone and satisfies the range condition such that $A^{-1}(0)\neq \emptyset$. Inspired…
In this paper we study logarithmic double phase problems with variable exponents involving nonlinearities that have generalized critical growth. We first prove new continuous and compact embedding results in order to guarantee the…
Distributional regression is extended to Gaussian response vectors of dimension greater than two by parameterizing the covariance matrix $\Sigma$ of the response distribution using the entries of its Cholesky decomposition. The more common…
In this paper, two generalized algorithms for solving the variational inequality problem in Banach spaces are proposed. Then the strong convergence of the sequences generated by these algorithms will be proved under the suitable conditions.…
Algorithms involving Gaussian processes or determinantal point processes typically require computing the determinant of a kernel matrix. Frequently, the latter is computed from the Cholesky decomposition, an algorithm of cubic complexity in…
We consider a boundary value problem involving conformable derivative of order $\alpha ,$ $1<\alpha <2$ and Dirichlet conditions. To prove the existence of solutions, we apply the method of upper and lower solutions together with Schauder's…
In this paper we develop an optimisation based approach to multivariate Chebyshev approximation on a finite grid. We consider two models: multivariate polynomial approximation and multivariate generalised rational approximation. In the…
For solving constrained (pseudo)-monotone variational inequality, we prove that the upper bound of stepsize $\frac{1}{2L}$ established for the Popov's algorithm and the forward-reflected-backward algorithm is tight. For unconstrained case,…
In this article we study a coupled system of differential equations with Allen-Cahn type non-linearity. Motivated by physical phenomena one of the unknowns in the system is accompanied by a singular perturbation parameter ${\epsilon}^2$ .…