Related papers: Improved Convergence and Approximation properties …
This paper is devoted to the design of efficient primal-dual algorithm (PDA) for solving convex optimization problems with known saddle-point structure. We present a new PDA with larger acceptable range of parameters and correction, which…
In the present paper, we consider Stancu type generalization of Baskakov-Kantorovich operators based on the q-integers and obtain statistical and weighted statistical approximation properties of these operators. Rates of statistical…
We create a new, functional calculus, approach to approximation of C_0-semigroups on Banach spaces. As an application of this approach, we obtain optimal convergence rates in classical approximation formulas for C_0-semigroups. In fact, our…
In this paper we propose a randomized primal-dual proximal block coordinate updating framework for a general multi-block convex optimization model with coupled objective function and linear constraints. Assuming mere convexity, we establish…
In the present paper, we consider $(p,q)$-analogue of the Baskakov-Beta operators and using it, we estimate some direct results on approximation. Also, we represent the convergence of these operators graphically using MATLAB.
In this paper we combine two existing approaches for approximating attractors. One of them approximates the attractors arbitrarily well by sublevel sets related to solutions of infinite dimensional linear programming problems. A downside…
We present two approximate versions of the proximal subgradient method for minimizing the sum of two convex functions (not necessarily differentiable). The algorithms involve, at each iteration, inexact evaluations of the proximal operator…
When developing robust preconditioners for multiphysics problems, fractional functions of the Laplace operator often arise and need to be inverted. Rational approximation in the uniform norm can be used to convert inverting those fractional…
This paper is in continuation of our work in \cite{PNM}, wherein we introduced generalized Baskakov Kantorovich operators $K_n^a(f;x)$ and established some approximation properties e.g. local approximation, weighted approximation,…
Proximal splitting algorithms are well suited to solving large-scale nonsmooth optimization problems, in particular those arising in machine learning. We propose a new primal-dual algorithm, in which the dual update is randomized;…
This paper proposes a novel first-order algorithm that solves composite nonsmooth and stochastic convex optimization problem with function constraints. Most of the works in the literature provide convergence rate guarantees on the…
In this paper, we introduce a new family of Szasz-Mirakyan-Durrmeyer operators defined on the half-line [0,\infty), constructed using Laguerre-type kernels. We discuss in detail the algebraic structure and analytical properties of these…
In this paper, we introduce a Kantorovich type generalization of q-Bernstein-Stancu operators. We study the convergence of the introduced operators and also obtain the rate of convergence by these operators in terms of the modulus of…
Tikhonov regularization with square-norm penalty for linear forward operators has been studied extensively in the literature. However, the results on convergence theory are based on technical proofs and difficult to interpret. It is also…
We introduce new global and local inexact oracle concepts for a wide class of convex functions in composite convex minimization. Such inexact oracles naturally come from primal-dual framework, barrier smoothing, inexact computations of…
In this paper, we formulate a new \emph{multiple-correction method}. The goal is to accelerate the rate of convergence. In particular, we construct some sequences to approximate the Euler-Mascheroni and Landau constants, which are faster…
Motivated by an inertial primal-dual dynamical system with vanishing damping, we propose a class of accelerated augmented Lagrangian methods with Nesterov extrapolation parameters for a linearly constrained convex optimization problem with…
The Blahut-Arimoto algorithm is a well-known method to compute classical channel capacities and rate-distortion functions. Recent works have extended this algorithm to compute various quantum analogs of these quantities. In this paper, we…
Several construction methods for rational approximations to functions of one real variable are described in the present paper; the computational results that characterize the comparative accuracy of these methods are presented; an effect of…
This paper focuses on a class of inclusion problems of maximal monotone operators in a multi-agent network, where each agent is characterized by an operator that is not available to any other agents, but the agents can cooperate by…