The method of double truncation in the decomposition of large-scale problems

DOI10.1007/BF01072103zbMath0597.90078OpenAlexW2055791200MaRDI QIDQ3731380

E. A. Nurminskii

Publication date: 1985

Published in: Cybernetics (Search for Journal in Brave)

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

zbMATH Keywords

nondifferentiable optimizationdouble truncationdecomposition of large-scale problemsextremum problems of a block structure

Mathematics Subject Classification ID

Numerical mathematical programming methods (65K05) Nonlinear programming (90C30) Decomposition methods (49M27)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Partitioning procedures for solving mixed-variables programming problems
• The Decomposition Algorithm for Linear Programs
• A set of staircase linear programming test problems
• Elements of Large-Scale Mathematical Programming Part I: Concepts