๐”– Bobbio Scriptorium
โœฆ   LIBER   โœฆ

On the synthesis of classifying algorithms in finite sets of classification algorithms (taxonomy)

โœ Scribed by V.V. Ryazanov


Publisher
Elsevier Science
Year
1982
Weight
727 KB
Volume
22
Category
Article
ISSN
0041-5553

No coin nor oath required. For personal study only.


๐Ÿ“œ SIMILAR VOLUMES


A note on finite termination of iterativ
โœ Jinchuan Zhou; Changyu Wang ๐Ÿ“‚ Article ๐Ÿ“… 2008 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 610 KB

Two well-known results on the unified treatment of finite termination of a class of algorithms for solving convex programming problems and for solving variational inequality problems are reconsidered. In particular, some of the underlying assumptions employed in the existing literature are shown to