On Decomposition Methods for a Class of Partially Separable Nonlinear Programs
From MaRDI portal
Recommendations
- Decomposition in conic optimization with partially separable structure
- Separable diagonalized multiplier method for decomposition nonlinear programs
- Applications of the method of partial inverses to convex programming: Decomposition
- scientific article; zbMATH DE number 1086732
- New dual-type decomposition algorithm for non-convex separable optimization problems
Cited in
(10)- Decomposition methods for solving a class of nonconvex programming problems dealing with bilinear and quadratic functions
- A decomposition method for MINLPs with Lipschitz continuous nonlinearities
- Decomposition in conic optimization with partially separable structure
- scientific article; zbMATH DE number 4145673 (Why is no real title available?)
- Nested decomposition of multistage nonlinear programs with recourse
- A classification of methods for distributed system optimization based on formulation structure
- Generalized cross decomposition applied to nonlinear integer programming problems: duality gaps and convexification in parts
- Efficient parallel solution of large-scale nonlinear dynamic optimization problems
- Linear decomposition approach for a class of nonconvex programming problems
- Parallel interior-point solver for block-structured nonlinear programs on SIMD/GPU architectures
This page was built for publication: On Decomposition Methods for a Class of Partially Separable Nonlinear Programs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5388074)
