A Decomposition Method Based On The Augmented Lagrangian

DOI10.1080/03155986.1988.11732057MaRDI QIDQ3813598zbMATH OpenOpenAlexFDO

Authors Mark Thorburn, Ajith K. Rai, Eldon A. Gunn

Publication date 1988

Published in INFOR: Information Systems and Operational Research (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1080/03155986.1988.11732057

zbMATH Keywords

augmented Lagrangiandecomposition

Mathematics Subject Classification ID

Decomposition methods (49M27) Numerical mathematical programming methods (65K05) Linear programming (90C05) Large-scale problems in mathematical programming (90C06) Nonlinear programming (90C30)

Recommendations

• Decomposition methods based on augmented Lagrangians: a survey
• scientific article; zbMATH DE number 1488005
• An augmented Lagrangian decomposition method for block diagonal linear programming problems
• scientific article; zbMATH DE number 62349
• Application of the alternating direction method of multipliers to separable convex programming problems

Cited in

(8)

• Optimality tests for partitioning and sectional search algorithms
• Coal bank scheduling using a mathematical programming model
• An augmented Lagrangian decomposition method for block diagonal linear programming problems
• Decomposition methods based on augmented Lagrangians: a survey
• Separable approximations and decomposition methods for the augmented Lagrangian
• An augmented Riesz decomposition method for sharp estimates of certain boundary value problem
• A Domain Decomposition Method Based on Augmented Lagrangian with a Penalty Term
• scientific article; zbMATH DE number 1488005 (Why is no real title available?)

This page was built for publication: A Decomposition Method Based On The Augmented Lagrangian

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3813598)