A new technique for nonconvex primal-dual decomposition of a large-scale separable optimization problem
From MaRDI portal
Publication:3216448
DOI10.1109/TAC.1985.1103899zbMath0553.90087MaRDI QIDQ3216448
Publication date: 1985
Published in: IEEE Transactions on Automatic Control (Search for Journal in Brave)
convergenceprimal-dual approachoptimal solutionlarge-scale separable optimizationnonconvex primal-dual decompositionseparability preserving Lagrange function
Numerical mathematical programming methods (65K05) Nonlinear programming (90C30) Numerical methods based on nonlinear programming (49M37) Methods of reduced gradient type (90C52)
Related Items
A proximal-based deomposition method for compositions method for convex minimization problems, Zero duality gap for a class of nonconvex optimization problems, Decomposition Methods Based on Augmented Lagrangians: A Survey, Augmented model-based double iterative loop techniques for hierarchical control of complex industrial processes, Convexification and decomposition of separable nonconvex optimization problems, Modified Lagrangian methods for separable optimization problems, New decomposition and convexification algorithm for nonconvex large-scale primal-dual optimization, Analysis of the alternating direction method of multipliers for nonconvex problems, Optimality tests for partitioning and sectional search algorithms, A Hierarchical approach to optimized control of water distribution systems: Part II. Lower-level algorithm, Complete decomposition algorithm for nonconvex separable optimization problems and applications, Two-level primal-dual proximal decomposition technique to solve large scale optimization problems, Mixed coordination method for long-horizon optimal control problems, An Augmented Lagrangian Based Algorithm for Distributed NonConvex Optimization, Two-level primal-dual decomposition technique for large-scale nonconvex optimization problems with constraints, New dual-type decomposition algorithm for non-convex separable optimization problems, Mixed coordination method for non-linear programming problems with separable structures
