Results 11 to 20 of about 6,104 (162)
Alternating conditional gradient method for convex feasibility problems [PDF]
Computational Optimization and Applications, 2021 The classical convex feasibility problem in a finite dimensional Euclidean space is studied in the present paper. We are interested in two cases. First, we assume to know how to compute an exact project onto one of the sets involved and the other set is compact such that the conditional gradient (CondG) method can be used for computing efficiently an ...
R. Díaz Millán +2 more
openaire +2 more sources
Strong Convergence on the Split Feasibility Problem by Mixing W-Mapping
Journal of Mathematics, 2021 In this paper, we concern with the split feasibility problem (SFP) in real Hilbert space whenever the sets involved are nonempty, closed, and convex. By mixing W-mapping with the viscosity, we introduce a new iterative algorithm for solving the split ...
Fugen Gao, Xiaoxiao Liu, Xiaochun Li
doaj +1 more source
European Journal of Mathematical Analysis, 2021 The purpose of this paper is to introduce a new iterative algorithm to approximate the fixed points of almost contraction mappings and generalized α-nonexpansive mappings.
Austine Efut Ofem +2 more
doaj +1 more source
A New Iterative Method for Solving Constrained Minimization, Variational Inequality and Split Feasibility Problems in the Framework of Banach Spaces [PDF]
Sahand Communications in Mathematical Analysis, 2023 In this paper, we introduce a new type of modified generalized $\alpha$-nonexpansive mapping and establish some fixed point properties and demiclosedness principle for this class of mappings in the framework of uniformly convex Banach spaces. We further
Francis Akutsah +4 more
doaj +1 more source
Extrapolation algorithm for affine-convex feasibility problems [PDF]
Numerical Algorithms, 2005 The problem is to find a common point of a countable family of closed affine subspaces and convex sets in a Hilbert space. A general algorithmic framework is proposed, which unifies the existing convergence results for a wide range of projection, subgradient projection, proximal, and fixed-point methods.
Heinz H. Bauschke +2 more
openaire +2 more sources
Convex Approximation Algorithm for AC/DC Distribution Network With Energy Router
Frontiers in Energy Research, 2021 The optimal operation model of AC/DC distribution network with energy router (ER) is essentially a nonconvex nonlinear programming (NLP) problem. In order to improve the feasibility of solving the model, a convex approximation algorithm is proposed in ...
Tao Zhang +6 more
doaj +1 more source
Wireless network positioning as a convex feasibility problem [PDF]
EURASIP Journal on Wireless Communications and Networking, 2011 In this semi-tutorial paper, the positioning problem is formulated as a convex feasibility problem (CFP). To solve the CFP for non-cooperative networks, we consider the well-known projection onto convex sets (POCS) technique and study its properties for positioning. We also study outer-approximation (OA) methods to solve CFP problems.
Mohammad Reza Gholami +3 more
openaire +1 more source
The Douglas–Rachford algorithm for convex and nonconvex feasibility problems [PDF]
Mathematical Methods of Operations Research, 2019 The Douglas-Rachford method, a projection algorithm designed to solve continuous optimization problems, forms the basis of a useful heuristic for solving combinatorial optimization problems. In order to successfully use the method, it is necessary to formulate the problem at hand as a feasibility problem with constraint sets having efficiently ...
Francisco J. Aragón Artacho +2 more
openaire +5 more sources
An overview of iterative methods based on orthogonal projections [PDF]
Mathematics and Computational SciencesThis paper investigates the linear feasibility problem (LFP), which plays a fundamental role in image reconstruction, especially in applications such as computed tomography and signal processing.
Touraj Nikazad, Mona Khakzad
doaj +1 more source
Infinite Product and Its Convergence in CAT(1) Spaces
Mathematics, 2023 In this paper, we study the convergence of infinite product of strongly quasi-nonexpansive mappings on geodesic spaces with curvature bounded above by one. Our main applications behind this study are to solve convex feasibility by alternating projections,
Sakan Termkaew +2 more
doaj +1 more source