An adaptive incremental approach for the solution of convex programming models
โ Scribed by F.F. Mahmoud; A.K. Al-Saffar; K.A. Hassan
- Publisher
- Elsevier Science
- Year
- 1993
- Tongue
- English
- Weight
- 440 KB
- Volume
- 35
- Category
- Article
- ISSN
- 0378-4754
No coin nor oath required. For personal study only.
โฆ Synopsis
Mahmoud, F.F., A.K. Al-Saffar and K.A. Hassan, An adaptive incremental approach for the solution of convex programming models, Mathematics and Computers in Simulation 35 (19931 501-508.
A proposed approach for the solution of convex programming problems is introduced.
It is based on an incremental procedure and the maximum number of increments does not exceed the total number of constraints.
The details of the algorithm are given and an illustrative example is presented.
๐ SIMILAR VOLUMES
Adaptive applications have computational workloads and communication patterns which change unpredictably at runtime, requiring dynamic load balancing to achieve scalable performance on parallel machines. Efficient parallel implementations of such adaptive applications is therefore a challenging task
Gas-solid reactions are very important in chemical and metallurgical process industries. The grain model is one of the most important models describing some of these reactions. This model gives two coupled partial differential equations. The governing equations of this model must be solved numerical