scientific article
From MaRDI portal
Publication:3332770
zbMath0543.90076MaRDI QIDQ3332770
Publication date: 1981
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
optimal controlperturbation theorydecompositiondecentralized planningaggregation algorithmslarge-scale programsblock programming
Large-scale problems in mathematical programming (90C06) Multisectoral models in economics (91B66) Research exposition (monographs, survey articles) pertaining to operations research and mathematical programming (90-02) Decomposition methods (49M27) Large-scale systems (93A15) Research exposition (monographs, survey articles) pertaining to calculus of variations and optimal control (49-02)
Related Items (25)
Exact penalties for decomposable convex optimization problems ⋮ Some principles of coordinated decision making in distributed systems ⋮ Constrained ?-subgradient method for simultaneous solution of the primal and dual problems of convex programming ⋮ Two-level decomposition in sequential quadratic programming with penalty functions ⋮ RPD-algorithm for optimization of developing systems in large-scale linear programming problems ⋮ Conditional ?-subgradient method for simultaneous solution of the primal and the dual convex programming problems ⋮ Method of sequential modification of the objective function in the assignment problem ⋮ Application of decomposition methods in optimization ⋮ Using the ?-subgradient method to solve the dual and the primal mathematical programming problems ⋮ Calculation of the state of a system of discrete linear processes connected by unseparated boundary conditions ⋮ Dynamic decomposition method for linear programming problems with ceneralized upper bounds ⋮ Minimax matrix correction of inconsistent systems of linear algebraic equations with block matrices of coefficients ⋮ Optimization of source locations and parameters for network structure objects ⋮ Correction of inconsistent systems of linear inequalities with block matrices by minimax criterion ⋮ Iterative functional modification method for solving a transportation problem ⋮ On the minimization of complexity and automation of efficient representation of Boolean functions in classes of formulas and circuits ⋮ Network optimization and problems with coupling variables ⋮ Decomposition-aggregation method for convex programming problems ⋮ Algorithm of the method of generalized potentials for problems of the optimum synthesis of communication networks with undefined factors ⋮ Optimization of the structure of production systems ⋮ Large-scale problems with quasi-block matrices ⋮ Problems of efficient application and development of a network under capital investments and credits ⋮ Decomposition of models of control processes ⋮ Solving systems of differential equations of block structure with nonseparated boundary conditions ⋮ Decomposition method of descent for minimizing the sum of convex nonsmooth functions
This page was built for publication:
