Publication

2001-06-01 - North Holland

Language

English

Word Count

129,000 words, Guess

Page Count

516 pages

Identifiers

and 3 more

Classifications

  • LCCQA402.5 .R47 2000

First Sentence

The convex feasibility (CF) problem consists of finding a point in the intersection of convex sets.

Subjects

Other Editions

  • Inherently Parallel Algorithms in Feasibility and Optimization and their Applications (Studies in Computational Mathematics)North Holland2001-06-01

Reader Reviews

No reviews yet for this book.

Be the first to share your thoughts!