Feasible direction method for large-scale nonconvex programs: Decomposition approach
type: Item
instance of: scholarly article
title: Feasible direction method for large-scale nonconvex programs: Decomposition approach
zbMATH Open document ID: 0441.49043
DOI: 10.1007/BF00934578
author: L. F. B. Baptistella
author: José C. Geromel
published in: Journal of Optimization Theory and Applications
publication date: 1981-01-01T00:00:00Z
Mathematics Subject Classification ID: 49M27
Mathematics Subject Classification ID: 49M37
Mathematics Subject Classification ID: 49J30
Mathematics Subject Classification ID: 49K30
Mathematics Subject Classification ID: 93A15
zbMATH DE Number: 3688181
zbMATH Keywords: optimal control
zbMATH Keywords: nonconvex programming
zbMATH Keywords: constrained optimization
zbMATH Keywords: feasible direction methods
zbMATH Keywords: dual decomposition
zbMATH Keywords: large scale nonconvex programming
MaRDI profile type: Publication
cites work: Q5630824
cites work: Two coordination principles and their application in large scale systems control
cites work: Q5671747
cites work: Decentralized optimization for distributed-lag models of discrete systems
cites work: Q4135211
cites work: The Gradient Projection Method for Nonlinear Programming. Part I. Linear Constraints
cites work: Q3277015
cites work: Q4051876
cites work: Function minimization by conjugate gradients
cites work: Multistage linear programming for discrete optimal control with distributed-lags
cites work: Q4099847
cites work: A generalized gradient method for optimal control problems with inequality constraints and singular arcs
description: scientific article; zbMATH DE number 3688181