Theoretical properties and numerical tests of an efficient nonlinear decomposition algorithm

DOI10.1007/BF00934496zbMath0417.90076MaRDI QIDQ755430

Carl-Louis Sandblom

Publication date: 1980

Published in: Journal of Optimization Theory and Applications (Search for Journal in Brave)

zbMATH Keywords

convergenceconvexitynumerical testsnonlinear programmingcomputational studycomparison of algorithmsdecomposition algorithmBenders' algorithmAlgol programoptimal degree of decompositionSumt algorithm

Mathematics Subject Classification ID

Numerical mathematical programming methods (65K05) Nonlinear programming (90C30) Specification and verification (program logics, model checking, etc.) (68Q60) Decomposition methods (49M27)

Uses Software

• ALGOL 60

Cites Work

• Partitioning procedures for solving mixed-variables programming problems
• A Rapidly Convergent Descent Method for Minimization
• The Slacked Unconstrained Minimization Technique for Convex Programming
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item