Results 41 to 50 of about 6,104 (162)
Journal of Inequalities and ApplicationsIn this paper, we study the generalized multiple-set split feasibility problem including the common fixed-point problem for a finite family of generalized demimetric mappings and the monotone inclusion problem in 2-uniformly convex and uniformly smooth ...
Mohammad Eslamian
doaj +1 more source
Abstract and Applied Analysis, 2014 As is known, the regularization method plays an important role in solving constrained convex minimization problems. Based on the idea of regularization, implicit and explicit iterative algorithms are proposed in this paper and the sequences generated by ...
Ming Tian, Jun-Ying Gong
doaj +1 more source
RBCC Mid-section Combined Trajectory Optimization Method Based on Particle Swarm-Pseudospectral Convex Optimization [PDF]
Hangkong bingqiIn order to solve the problem of combined trajectory optimization of RBCC mid-section, a nested optimization method based on particle swarm-pseudospectral convex optimization is proposed.
Yang Yuxuan, Fei Wanghua, Liu Haili, Wang Peichen, Yan Xunliang
doaj +1 more source
A Green Downlink Power Allocation Scheme for Cell-Free Massive MIMO Systems
IEEE Access, 2021 In this article, we consider the problem of downlink power allocation in a cell-free massive multiple-input multiple-output (m-MIMO) communication system under spectral efficiency (SE) constraints for the users.
Seyyed Saleh Hosseini +2 more
doaj +1 more source
A successive centralized circumcentered-reflection method for the convex feasibility problem
Computational Optimization and Applications, 2023 In this paper we present the successive centralization of the circumcenter reflection scheme with several control sequences for solving the convex feasibility problem in Euclidean space. Assuming that a standard error bound holds, we prove the linear convergence of the method with the most violated constraint control sequence.
Roger Behling +4 more
openaire +3 more sources
Δ-Convergence of Products of Operators in p-Uniformly Convex Metric Spaces
Mathematics, 2020 In this paper, we first introduce the new notion of p-strongly quasi-nonexpansive maps on p-uniformly convex metric spaces, and then we study the Δ (weak)-convergence of products of p-strongly quasi-nonexpansive maps on p-uniformly convex metric ...
Byoung Jin Choi
doaj +1 more source
Fixed Point Theory and Applications, 2009 The convex feasibility problem (CFP) of finding a point in the nonempty intersection ⋂i=1NCi is considered, where N⩾1 is an integer and the Ci's are assumed to be convex closed subsets of a Banach space E.
doaj +1 more source
An algorithm for the split-feasibility problems with application to the split-equality problem
Journal of Inequalities and Applications, 2017 In this paper, we study the split-feasibility problem in Hilbert spaces by using the projected reflected gradient algorithm. As applications, we study the convex linear inverse problem and the split-equality problem in Hilbert spaces, and we give new ...
Chih-Sheng Chuang, Chi-Ming Chen
doaj +1 more source
Block Iterative Methods for a Finite Family of Relatively Nonexpansive Mappings in Banach Spaces
Fixed Point Theory and Applications, 2007 Using the convex combination based on Bregman distances due to Censor and Reich, we define an operator from a given family of relatively nonexpansive mappings in a Banach space. We first prove that the fixed-point set of this operator is identical to the
Fumiaki Kohsaka, Wataru Takahashi
doaj +2 more sources
Robust Linear Programming with Norm Uncertainty
Journal of Applied Mathematics, 2014 We consider the linear programming problem with uncertainty set described by p,w-norm. We suggest that the robust counterpart of this problem is equivalent to a computationally convex optimization problem.
Lei Wang, Hong Luo
doaj +1 more source