Theoretical properties and numerical tests of an efficient nonlinear decomposition algorithm

DOI10.1007/BF00934496MaRDI QIDQ755430zbMATH OpenFDO

Authors Carl-Louis Sandblom

Publication date 1980

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

Full work available at URL https://doi.org/10.1007/BF00934496

zbMATH Keywords

Algol programBenders' algorithmcomparison of algorithmscomputational studyconvergenceconvexitydecomposition algorithmnonlinear programmingnumerical testsoptimal degree of decompositionSumt algorithm

Mathematics Subject Classification ID

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

Cites work

• A Rapidly Convergent Descent Method for Minimization
• scientific article; zbMATH DE number 3609450 (Why is no real title available?)
• scientific article; zbMATH DE number 3307153 (Why is no real title available?)
• scientific article; zbMATH DE number 3309765 (Why is no real title available?)
• scientific article; zbMATH DE number 3350922 (Why is no real title available?)
• scientific article; zbMATH DE number 3356467 (Why is no real title available?)
• Partitioning procedures for solving mixed-variables programming problems
• The Slacked Unconstrained Minimization Technique for Convex Programming

Describes a project that uses

Uses Software

• ALGOL 60

This page was built for publication: Theoretical properties and numerical tests of an efficient nonlinear decomposition algorithm

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