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

DOI10.1080/00207178908953440MaRDI QIDQ4207299zbMATH OpenOpenAlexWikidataFDO

Authors Jianxin Tang, Peter B. Luh, T. S. Chang

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 implementationmodified Newton methodlinear equality constraintsseparable structuresmixed coordination methodStatic optimizationhigh-level updating scheme

Mathematics Subject Classification ID

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

Recommendations

• Convexification and decomposition of separable nonconvex optimization problems
• scientific article; zbMATH DE number 3982421
• Multilevel methodology for a class of non-separable optimization problems
• Augmented Lagrangian coordination for distributed optimal design in MDO
• scientific article; zbMATH DE number 4009672

Cites work

• scientific article; zbMATH DE number 3928227 (Why is no real title available?)
• A new technique for nonconvex primal-dual decomposition of a large-scale separable optimization problem
• Computational experience in sensitivity analysis for nonlinear programming
• Extension of dual coordination to a class of non-linear systems
• Sensitivity analysis for nonlinear programming using penalty methods

Cited in

(2)

• scientific article; zbMATH DE number 4106599 (Why is no real title available?)
• Block-separable linking constraints in augmented Lagrangian coordination

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4207299)