Feasible direction method for large-scale nonconvex programs: Decomposition approach
From MaRDI portal
constrained optimizationdual decompositionfeasible direction methodslarge scale nonconvex programmingnonconvex programmingoptimal control
Existence of optimal solutions belonging to restricted classes (Lipschitz controls, bang-bang controls, etc.) (49J30) Optimality conditions for solutions belonging to restricted classes (Lipschitz controls, bang-bang controls, etc.) (49K30) Decomposition methods (49M27) Numerical methods based on nonlinear programming (49M37) Large-scale systems (93A15)
Cites work
- A generalized gradient method for optimal control problems with inequality constraints and singular arcs
- Decentralized optimization for distributed-lag models of discrete systems
- Function minimization by conjugate gradients
- scientific article; zbMATH DE number 3159112 (Why is no real title available?)
- scientific article; zbMATH DE number 3466802 (Why is no real title available?)
- scientific article; zbMATH DE number 3520163 (Why is no real title available?)
- scientific article; zbMATH DE number 3562783 (Why is no real title available?)
- scientific article; zbMATH DE number 3356467 (Why is no real title available?)
- scientific article; zbMATH DE number 3405644 (Why is no real title available?)
- Multistage linear programming for discrete optimal control with distributed-lags
- The Gradient Projection Method for Nonlinear Programming. Part I. Linear Constraints
- Two coordination principles and their application in large scale systems control
This page was built for publication: Feasible direction method for large-scale nonconvex programs: Decomposition approach
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1142995)