In this paper, we study the rate of convergence of the cyclic projection algorithm applied to finitely many basic semi-algebraic convex sets. We establish an explicit convergence rate estimate which relies on the maximum degree of the polynomials that generate the basic semi-algebraic convex sets and the dimension of the underlying space. We achieve our results by exploiting the algebraic structure of the basic semi-algebraic convex sets
Due to their extraordinary utility and broad applicability in many areas of classical mathematics an...
We analyze Dykstra's algorithm for two arbitrary closed convex sets in a Hilbert space. Our techniqu...
Abstract—Solving a convex set theoretic image recovery problem amounts to finding a point in the int...
In this paper, we study the rate of convergence of the cyclic projection algorithm applied to finite...
AbstractThe cyclic projections algorithm is an important method for determining a point in the inter...
AbstractThe rate of convergence for the cyclic projections algorithm onto an intersection of finitel...
Analysis of the convergence rate for the cyclic projection algorithm applied to semi-algebrai
Dykstra's cyclic projections algorithm allows one to compute best approximations to any pointx in a ...
We study finite convergence of the modified cyclic subgradient pro-jections (MCSP) algorithm for the...
The Lasserre hierarchy of semidefinite programming approximations to convex polynomial optimization ...
summary:The method of projections onto convex sets to find a point in the intersection of a finite n...
We study the method of cyclic projections when applied to closed and linear subspaces $M_i$, $i=1,\l...
The convex feasibility problem (CFP) is a classical problem in nonlinear analysis. In this paper, we...
In this paper, we establish sublinear and linear convergence of fixed point iterations generated by ...
In this paper, we analyze the convergence properties of projected non-stationary block iterative met...
Due to their extraordinary utility and broad applicability in many areas of classical mathematics an...
We analyze Dykstra's algorithm for two arbitrary closed convex sets in a Hilbert space. Our techniqu...
Abstract—Solving a convex set theoretic image recovery problem amounts to finding a point in the int...
In this paper, we study the rate of convergence of the cyclic projection algorithm applied to finite...
AbstractThe cyclic projections algorithm is an important method for determining a point in the inter...
AbstractThe rate of convergence for the cyclic projections algorithm onto an intersection of finitel...
Analysis of the convergence rate for the cyclic projection algorithm applied to semi-algebrai
Dykstra's cyclic projections algorithm allows one to compute best approximations to any pointx in a ...
We study finite convergence of the modified cyclic subgradient pro-jections (MCSP) algorithm for the...
The Lasserre hierarchy of semidefinite programming approximations to convex polynomial optimization ...
summary:The method of projections onto convex sets to find a point in the intersection of a finite n...
We study the method of cyclic projections when applied to closed and linear subspaces $M_i$, $i=1,\l...
The convex feasibility problem (CFP) is a classical problem in nonlinear analysis. In this paper, we...
In this paper, we establish sublinear and linear convergence of fixed point iterations generated by ...
In this paper, we analyze the convergence properties of projected non-stationary block iterative met...
Due to their extraordinary utility and broad applicability in many areas of classical mathematics an...
We analyze Dykstra's algorithm for two arbitrary closed convex sets in a Hilbert space. Our techniqu...
Abstract—Solving a convex set theoretic image recovery problem amounts to finding a point in the int...