Complete decomposition algorithm for nonconvex separable optimization problems and applications
type: Item
instance of: scholarly article
title: Complete decomposition algorithm for nonconvex separable optimization problems and applications
zbMATH Open document ID: 0770.90066
DOI: 10.1016/0005-1098(92)90069-R
author: Shin-Yeu Lin
published in: Automatica
publication date: 1993-01-04T00:00:00Z
Mathematics Subject Classification ID: 90C30
Mathematics Subject Classification ID: 49M27
zbMATH DE Number: 86054
zbMATH Keywords: complete decomposition algorithm
zbMATH Keywords: nonconvex separable optimization
zbMATH Keywords: recursive quadratic programming
zbMATH Keywords: parallel computation
MaRDI profile type: Publication
cites work: Q3932576
cites work: Convexification procedures and decomposition methods for nonconvex optimization problems
cites work: Q3690580
cites work: Superlinearly convergent variable metric algorithms for general nonlinear programming problems
cites work: A globally convergent method for nonlinear programming
cites work: A hardware implementable two-level parallel computing algorithm for general minimum-time control
cites work: Q3688092
cites work: On the Use of Approximations in Algorithms for Optimization Problems with Equality and Inequality Constraints
cites work: New algorithms for unconstrained nonlinear optimal control problems
cites work: A new technique for nonconvex primal-dual decomposition of a large-scale separable optimization problem
cites work: New dual-type decomposition algorithm for non-convex separable optimization problems
cites work: Decomposition in large system optimization using the method of multipliers
full work available at URL: 0005-1098(92)90069-r
OpenAlex ID: W2008128853
description: scientific article; zbMATH DE number 86054