Feasible direction method for large-scale nonconvex programs: Decomposition approach

DOI10.1007/BF00934578zbMath0441.49043MaRDI QIDQ1142995

L. F. B. Baptistella, José C. Geromel

Publication date: 1981

Published in: Journal of Optimization Theory and Applications (Search for Journal in Brave)

zbMATH Keywords

optimal controlconstrained optimizationnonconvex programmingdual decompositionfeasible direction methodslarge scale nonconvex programming

Mathematics Subject Classification ID

Numerical methods based on nonlinear programming (49M37) Existence of optimal solutions belonging to restricted classes (Lipschitz controls, bang-bang controls, etc.) (49J30) Decomposition methods (49M27) Large-scale systems (93A15) Optimality conditions for solutions belonging to restricted classes (Lipschitz controls, bang-bang controls, etc.) (49K30)

Related Items

A computer model for power system control

Cites Work

• Decentralized optimization for distributed-lag models of discrete systems
• Multistage linear programming for discrete optimal control with distributed-lags
• Two coordination principles and their application in large scale systems control
• A generalized gradient method for optimal control problems with inequality constraints and singular arcs
• The Gradient Projection Method for Nonlinear Programming. Part I. Linear Constraints
• Function minimization by conjugate gradients
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item