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

DOI10.1007/BF01072103MaRDI QIDQ3731380zbMATH OpenOpenAlexFDO

Authors 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

double truncationnondifferentiable optimizationdecomposition of large-scale problemsextremum problems of a block structure

Mathematics Subject Classification ID

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

Recommendations

• scientific article; zbMATH DE number 432997
• scientific article; zbMATH DE number 4027166
• scientific article; zbMATH DE number 1225243
• Two-level primal-dual decomposition technique for large-scale nonconvex optimization problems with constraints
• Large-scale optimization - problems and methods

Cites work

• scientific article; zbMATH DE number 3821441 (Why is no real title available?)
• scientific article; zbMATH DE number 3791939 (Why is no real title available?)
• scientific article; zbMATH DE number 3402327 (Why is no real title available?)
• A set of staircase linear programming test problems
• Elements of Large-Scale Mathematical Programming Part I: Concepts
• Partitioning procedures for solving mixed-variables programming problems
• The Decomposition Algorithm for Linear Programs

Cited in

(2)

• scientific article; zbMATH DE number 432997 (Why is no real title available?)
• scientific article; zbMATH DE number 652009 (Why is no real title available?)

This page was built for publication: The method of double truncation in the decomposition of large-scale problems

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