Results 121 to 130 of about 6,104 (162)
Some of the next articles are maybe not open access.
An algorithm for solving the convex feasibility problem
International Journal of Operational Research, 2007This paper presents a volumetric cutting plane algorithm for finding a feasible point in a convex set. It is based on the volumetric barrier function where Newton steps are taken and a line search is performed in order to re-centre following the addition or deletion of a constraint.
Abdulwahab Al Othman, Mohammed Hajeeh
openaire +1 more source
On the regularity condition in a convex feasibility problem
Nonlinear Analysis: Theory, Methods & Applications, 2009zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Mărușter, Ștefan, Popîrlan, Cristina
openaire +2 more sources
Quasi-convex feasibility problems: Subgradient methods and convergence rates
European Journal of Operational Research, 2022zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Yaohua Hu +3 more
openaire +1 more source
Strong Convergence of the Projection Method in Convex Feasibility Problem
Ninth International Symposium on Symbolic and Numeric Algorithms for Scientific Computing (SYNASC 2007), 2007The strong convergence properties of the projection method for convex feasibility problem are investigated in the frame of a real Hilbert space. The significant role of the regularity properties for strong convergence of these methods is pointed out.
Stefan Maruster, Cristina Popirlan
openaire +1 more source
Generalized Bregman Projections in Convex Feasibility Problems
Journal of Optimization Theory and Applications, 1998zbMATH Open Web Interface contents unavailable due to conflicting licenses.
openaire +2 more sources
On the convexity and feasibility of the bounded distortion harmonic mapping problem
ACM Transactions on Graphics, 2016Computation of mappings is a central building block in many geometry processing and graphics applications. The pursuit to compute mappings that are injective and have a controllable amount of conformal and isometric distortion is a long endeavor which has received significant attention by the scientific community in recent years.
Zohar Levi, Ofir Weber
openaire +1 more source
On convex feasibility problems
Carpathian Journal of Mathematics, 2004The convex feasibility problem consists in finding a point in the intersection of convex sets. The authors consider a projection method for the solving of convex feasibility problem in a Hilbert space and at the usage of quasi-nonexpansive mappings technique they give some sufficient conditions for its strong convergence.
Mǎruşter, Laura, Mǎruşter, Ştefan
openaire +3 more sources
Iterative algorithm for solving a class of convex feasibility problem
Journal of Computational and Applied Mathematics, 2019zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Chunmei Li +4 more
openaire +2 more sources
2016
We use subgradient projection algorithms for solving convex feasibility problems. We show that almost all iterates, generated by a subgradient projection algorithm in a Hilbert space, are approximate solutions. Moreover, we obtain an estimate of the number of iterates which are not approximate solutions.
openaire +1 more source
We use subgradient projection algorithms for solving convex feasibility problems. We show that almost all iterates, generated by a subgradient projection algorithm in a Hilbert space, are approximate solutions. Moreover, we obtain an estimate of the number of iterates which are not approximate solutions.
openaire +1 more source
Iterative Methods for Convex Feasibility Problems
1998Abstract In this chapter we present several iterative methods for the convex feasibility problem, aiming at a description of both the methods and some of the apparent connections between them. We start with the method of successive orthogonal projections (SOP) of Gubin, Polyak, and Raik, also known in recent literature on image recovery ...
Yair Censor, Stavros A Zenios
openaire +1 more source