A Decomposition Method and Its Application to Block Angular Linear Programs.

reportActive / Technical Report | Accession Number: ADA099362 | Open PDF

Abstract:

In this paper we propose and develop techniques for solving structured, large-scale convex programming problems. The procedure is a combination of a decomposition technique of Dantzig-Wolfe type and the proximal point method. The proximal point method is used to overcome the drawbacks of the decomposition technique. The procedure is then used to solve block angular linear programming problems. By exploiting the linearity of the problem we have several variants of the procedure. Author

Author(s):
Ha, Cu Duong
Author Organization(s):
WISCONSIN UNIV-MADISON MATHEMATICS RESEARCH CENTER
Descriptive Note:
Technical summary rept.,
Pagination:
0055

Security Markings

DOCUMENT & CONTEXTUAL SUMMARY

Distribution:
Approved For Public Release

RECORD

Collection: TR
Identifying Numbers
Report Number(s):
MRC-TSR-2174
Contract/Grant Number(s):
DAAG29-80-C-0041
 Subject Terms
Joint Capability Areas:
JCA_1.2_Force Preparation; JCA_1_Force Support; JCA_1.2.3_Educating; JCA_6.3.1_Optimized Network Functions and Resources; JCA_6_Net Centric; JCA_5_Command and Control; JCA_6.3_Net Management; JCA_1.2.5_Lessons Learned; JCA_6.1.3_Switching and Routing; JCA_5.3_Planning; JCA_6.1_Information Transport
Modernization Areas:
Fully Networked C3; Autonomy
Communities of Interest:
Autonomy
Descriptor(s):
*LINEAR PROGRAMMING, *DECOMPOSITION, RANDOM VARIABLES, MATRICES(MATHEMATICS), COMPUTER PROGRAMMING, ITERATIONS, CONVEX SETS, SIMPLEX METHOD, THEOREMS
Field(s)/Group(s):
Theoretical Mathematics, Computer Programming and Software
Report Date:
1981 Jan 01