Results 21 to 30 of about 6,104 (162)
On the Convex Feasibility Problem
CoRR, 2009 The convergence of the projection algorithm for solving the convex feasibility problem for a family of closed convex sets, is in connection with the regularity properties of the family. In the paper [18] are pointed out four cases of such a family depending of the two characteristics: the emptiness and boudedness of the intersection of the family.
Laura Maruster, Stefan Maruster
openaire +3 more sources
Journal of Inequalities and Applications, 2019 In this paper, we first introduce a new algorithm which involves projecting each iteration to solve a split feasibility problem with paramonotone equilibria and using unconstrained convex optimization.
Q. L. Dong +4 more
doaj +1 more source
Half-Space Relaxation Projection Method for Solving Multiple-Set Split Feasibility Problem
Mathematical and Computational Applications, 2020 In this paper, we study an iterative method for solving the multiple-set split feasibility problem: find a point in the intersection of a finite family of closed convex sets in one space such that its image under a linear transformation belongs to the ...
Guash Haile Taddele +3 more
doaj +1 more source
Applications of Fixed-Point and Optimization Methods to the Multiple-Set Split Feasibility Problem
Journal of Applied Mathematics, 2012 The multiple-set split feasibility problem requires finding a point closest to a family of closed convex sets in one space such that its image under a linear transformation will be closest to another family of closed convex sets in the image space.
Yonghong Yao +3 more
doaj +1 more source
Joint Blocklength and Power Optimization in High-Speed Railway Relay Communication Systems
IEEE Access, 2023 For a high-speed railway relay downlink communication system based on short-packet transmission, the problem of maximizing the minimum user throughput by jointly optimizing the transmission packet length and the transmission power control of the relay ...
Hao Xu +4 more
doaj +1 more source
An intermixed iteration for constrained convex minimization problem and split feasibility problem
Journal of Inequalities and Applications, 2019 In this paper, we first introduce the two-step intermixed iteration for finding the common solution of a constrained convex minimization problem, and also we prove a strong convergence theorem for the intermixed algorithm.
Kanyanee Saechou, Atid Kangtunyakarn
doaj +1 more source
Abstract and Applied Analysis, 2013 We at first raise the so called split feasibility fixed point problem which covers the problems of split feasibility, convex feasibility, and equilibrium as special cases and then give two types of algorithms for finding solutions of this problem and ...
Young-Ye Huang, Chung-Chien Hong
doaj +1 more source
Journal of Function Spaces, 2020 In this article, we study the extended split equality problem and extended split equality fixed point problem, which are extensions of the convex feasibility problem.
Meixia Li, Xueling Zhou, Wenchao Wang
doaj +1 more source
Global Optimization for the Sum of Concave-Convex Ratios Problem
Journal of Applied Mathematics, 2014 This paper presents a branch and bound algorithm for globally solving the sum of concave-convex ratios problem (P) over a compact convex set. Firstly, the problem (P) is converted to an equivalent problem (P1).
XueGang Zhou, JiHui Yang
doaj +1 more source
A new fixed-time stability of neural network to solve split convex feasibility problems
Journal of Inequalities and Applications, 2023 In this paper, we propose a novel neural network that achieves stability within the fixed time (NFxNN) based on projection to solve the split convex feasibility problems.
Jinlan Zheng +3 more
doaj +1 more source