Mixed coordination method for non-linear programming problems with separable structures

DOI10.1080/00207178908953440zbMath0688.49037OpenAlexW2060122638WikidataQ126244502 ScholiaQ126244502MaRDI QIDQ4207299

Peter B. Luh, Tsu-Shuan Chang, Jianxin Tang

Publication date: 1989

Published in: International Journal of Control (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1080/00207178908953440

zbMATH Keywords

parallel implementationlinear equality constraintsmodified Newton methodseparable structuresmixed coordination methodStatic optimizationhigh-level updating scheme

Mathematics Subject Classification ID

Numerical mathematical programming methods (65K05) Nonlinear programming (90C30) Numerical methods based on nonlinear programming (49M37) Methods of successive quadratic programming type (90C55)

Cites Work

• Unnamed Item
• A new technique for nonconvex primal-dual decomposition of a large-scale separable optimization problem
• Extension of dual coordination to a class of non-linear systems
• Sensitivity analysis for nonlinear programming using penalty methods
• Computational experience in sensitivity analysis for nonlinear programming

This page was built for publication: Mixed coordination method for non-linear programming problems with separable structures