New dual-type decomposition algorithm for non-convex separable optimization problems
type: Item
instance of: scholarly article
title: New dual-type decomposition algorithm for non-convex separable optimization problems
zbMATH Open document ID: 0685.49023
DOI: 10.1016/0005-1098(89)90076-9
published in: Automatica
publication date: 1989-01-01T00:00:00Z
Mathematics Subject Classification ID: 49M27
Mathematics Subject Classification ID: 65K05
Mathematics Subject Classification ID: 90C30
zbMATH DE Number: 4122716
zbMATH Keywords: dual-type decomposition algorithm
zbMATH Keywords: large-scale nonconvex optimization problems
zbMATH Keywords: augmented Lagrange function
zbMATH Keywords: separable local optimization problems
author: Piotr Tatjewski
MaRDI profile type: Publication
full work available at URL: 0005-1098(89)90076-9
OpenAlex ID: W2026342258
cites work: A general saddle point result for constrained optimization
cites work: Convexification procedures and decomposition methods for nonconvex optimization problems
cites work: Q3690580
cites work: Q3748119
cites work: Q3318601
cites work: Q5630824
cites work: Q5652137
cites work: A globally convergent, implementable multiplier method with automatic penalty limitation
cites work: Q4187244
cites work: The use of Hestenes' method of multipliers to resolve dual gaps in engineering system optimization
cites work: Q4143035
cites work: A new technique for nonconvex primal-dual decomposition of a large-scale separable optimization problem
cites work: Q3343785
cites work: Q3705268
cites work: Decomposition in large system optimization using the method of multipliers
Recommended article: Q3483926
Recommended article: A new technique for nonconvex primal-dual decomposition of a large-scale separable optimization problem
Recommended article: New decomposition and convexification algorithm for nonconvex large-scale primal-dual optimization
Recommended article: Complete decomposition algorithm for nonconvex separable optimization problems and applications
Recommended article: Q4362982
Recommended article: Dual algorithms for solving convex partially separable optimization problems
Recommended article: Q3484637
Recommended article: Convexification and decomposition of separable nonconvex optimization problems
Recommended article: An Algorithm for Separable Nonconvex Programming Problems
Recommended article: Convergence and application of a decomposition method using duality bounds for nonconvex global optimization
description: scientific article; zbMATH DE number 4122716