Tools
Tools
Nurminski, E.A. 
ORCID: https://orcid.org/0000-0002-7236-6955
(1982).
Decomposition Algorithm Based on the Primal-Dual Approximation.
IIASA Working Paper.
IIASA, Laxenburg, Austria: WP-82-046
Preview |
Text
WP-82-046.pdf Download (480kB) | Preview |
Abstract
A decomposition algorithm based on the simultaneous approximation of the primal and dual forms of an optimization problem is proposed. This approach makes maximum use of the primal-dual information available during solution of the decomposed problem, speeds up the convergence, and provides upper and lower bounds for the optimum.
| Item Type: | Monograph (IIASA Working Paper) |
|---|---|
| Research Programs: | System and Decision Sciences - Core (SDS) |
| Depositing User: | IIASA Import |
| Date Deposited: | 15 Jan 2016 01:51 |
| Last Modified: | 27 Aug 2021 17:10 |
| URI: | https://iiasa-9.eprints-hosting.org/1970 |
Actions (login required)
 |
View Item |