Analysis of the convergence rate for the cyclic projection algorithm applied to basic semi-algebraic convex sets
Functional Analysis
2013-11-20 v2 Optimization and Control
Abstract
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.
Cite
@article{arxiv.1304.7965,
title = {Analysis of the convergence rate for the cyclic projection algorithm applied to basic semi-algebraic convex sets},
author = {Jonathan M. Borwein and Guoyin Li and Liangjin Yao},
journal= {arXiv preprint arXiv:1304.7965},
year = {2013}
}
Comments
35 pages, revision incorporating referees' comments