Content deleted Content added
minor: typo |
m Add comment about sublinear convergence rate and practical observations. |
||
Line 24:
''Comments''
The algorithm generally makes good progress towards the optimum during the first few iterations, but convergence often slows down substantially when close to the minimum point. For this reason the algorithm is perhaps best used to find an approximate solution. It can be shown that the worst case convergence rate is sublinear; however, in practice the convergence rate has been observed to improve in case of many constraints.
==References==
| |||