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

DOI10.1007/BF01072103zbMATH Open0597.90078OpenAlexW2055791200MaRDI QIDQ3731380FDOQ3731380

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

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

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)

Cites Work

• Partitioning procedures for solving mixed-variables programming problems
• The Decomposition Algorithm for Linear Programs
• Elements of Large-Scale Mathematical Programming Part I: Concepts
• Title not available (Why is that?)
• Title not available (Why is that?)
• A set of staircase linear programming test problems
• Title not available (Why is that?)

Cited In (2)

• Title not available (Why is that?)
• Title not available (Why is that?)

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)