Closed convex set

In this paper, we propose a generalized Nesterov algorithm for the constrained optimization problems on a closed convex set. We prove the convergence as well as the convergence rate of the proposed algorithm. First, we present a new algorithm based on the generalization of Nesterov’s algorithm.

5p vigojek 02-02-2024 1 0   Download

In this paper, we establish some existence theorems by using Kakutani-FanGlicksberg fixed-point theorem for generalized quasiequilibrium problems in real locally convex Hausdorff topological vector spaces. Moreover, we also discuss closeness of the solution sets of generalized quasiequilibrium problems. The results presented in the paper improve and extend the main results of Long et al in [3], Plubtieng - Sitthithakerngkietet in [5] and Yang-Pu in [6].

7p nguaconbaynhay 20-10-2019 11 1   Download

In this paper, the author study linear inverse problems on a closed convex set and the constrained sparsity regularization for considering problems. Here, combining the sparsity regularization and constrained Tikhonov regularization, we propose the constrained sparsity regularization.

5p vidanh95 12-12-2018 18 0   Download

In this paper we give results about polynomial approximation on the closed polydisk in Cn . 1. Introduction Let X be a compact subset of Cn . By C(X) we denote the space of all continuous complex-valued functions on X, with norm f X = max{|f (z)| : z ∈ X}, and let P (X) denote the closure of set of polynomials in C(X). The polynomially convex hull of X will ˆ be denoted by X and difined by ˆ X = {z ∈ Cn : |p(z)| p X for every polynomial p}.

6p tuanlocmuido 19-12-2012 36 1   Download