Efficient Controls for Finitely Convergent Sequential Algorithms
Finding a feasible point that satisfies a set of constraints is a common task in scientific computing: examples are the linear feasibility problem and the convex feasibility problem. Finitely convergent sequential algorithms can be used for solving such problems; an example of such an algorithm is A...
| Veröffentlicht in: | ACM transactions on mathematical software. Association for Computing Machinery. - 1998. - 37(2010), 2 vom: 27. Apr., Seite 14 |
|---|---|
| 1. Verfasser: | |
| Weitere Verfasser: | |
| Format: | Aufsatz |
| Sprache: | English |
| Veröffentlicht: |
2010
|
| Zugriff auf das übergeordnete Werk: | ACM transactions on mathematical software. Association for Computing Machinery |
| Schlagworte: | Journal Article |