𝔖 Bobbio Scriptorium
✦   LIBER   ✦

On Parallel Complexity of Nonsmooth Convex Optimization

✍ Scribed by A. Nemirovski


Publisher
Elsevier Science
Year
1994
Tongue
English
Weight
449 KB
Volume
10
Category
Article
ISSN
0885-064X

No coin nor oath required. For personal study only.


πŸ“œ SIMILAR VOLUMES


On the Complexity of Exclusion Algorithm
✍ Eugene Allgower; Melissa Erdmann; Kurt Georg πŸ“‚ Article πŸ“… 2002 πŸ› Elsevier Science 🌐 English βš– 133 KB

Exclusion algorithms are a well-known tool in the area of interval analysis for finding all solutions of a system of nonlinear equations or for finding the global minimum of a function over a compact domain. The present paper discusses a new class of tests for such algorithms in the context of globa