Iterative aggregation and decomposition in block-separable extremum problems

MaRDI QIDQ1802611zbMATH OpenFDO

Authors I. Litvinchev

Publication date 6 September 1993

Published in Computational Mathematics and Mathematical Physics (Search for Journal in Brave)

zbMATH Keywords

aggregationblock-separable extremal problems

Mathematics Subject Classification ID

Nonlinear programming (90C30)

Review text

This is a continuation of earlier papers of the author [U.S.S.R. Comput. Math. Math. Phys. 27, No. 2, 6-11 (1987; Zbl 0664.90072); ibid. 30, No. 4, 32-38 (1990; Zbl 0738.90060)]. It is shown that for block-separable extremal problems the aggregation problem can be reduced to a series of independent block subproblems.

Recommendations

• Decomposition-aggregation method for convex programming problems
• scientific article; zbMATH DE number 3864992
• Publication:3496156
• Large-scale optimization - problems and methods
• Method of expansion for optimization problems which do not have a block-separable structure

Cited in

(3)

• scientific article; zbMATH DE number 3864992 (Why is no real title available?)
• Method of expansion for optimization problems which do not have a block-separable structure
• scientific article; zbMATH DE number 7289916 (Why is no real title available?)

This page was built for publication: Iterative aggregation and decomposition in block-separable extremum problems

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