Two-level primal-dual decomposition technique for large-scale nonconvex optimization problems with constraints
The authors are concerned with the separable minimization problem \[ (1)\quad \text{ minimize } f(x)=\sum^{N}_{i=1}f_ i(x_ i)\text{ subject to } h(x)=\sum^{N}_{i=1}h_ i(x_ i)=0, \] \(g_ i(x_ i)\leq 0\) \((i=1,...,N)\), where \(x\in R^ n\), \(x_ i\in R^{n_ i}\), \(n=\sum^{N}_{i=1}n_ i\), \(f_ i:\) \(R^{n_ i}\to R\), \(h_ i:\) \(R^{n_ i}\to R^ m\), \(g_ i:\) \(R^{n_ i}\to R^{\ell_ i}\). To solve (1) by the dual method of decomposition in case of nonconvexity, several techniques have been proposed. Some of them are three-level primal-dual optimization structures or apply to (1) without the inequality constraint \(g_ i(x_ i)\leq 0\). In this paper the authors consider for solving (1) a technique introduced in a previous paper of the first author [Automatica 25, No.2, 233-242 (1989; Zbl 0685.49023)], give a convergence analysis and provide numerical results.
- scientific article; zbMATH DE number 4091189
- scientific article; zbMATH DE number 4145673
- A new technique for nonconvex primal-dual decomposition of a large-scale separable optimization problem
- Two-level primal-dual proximal decomposition technique to solve large scale optimization problems
- Publication:3484637
- A new technique for nonconvex primal-dual decomposition of a large-scale separable optimization problem
- Convexification procedures and decomposition methods for nonconvex optimization problems
- Decomposition in large system optimization using the method of multipliers
- scientific article; zbMATH DE number 3849051 (Why is no real title available?)
- scientific article; zbMATH DE number 3914081 (Why is no real title available?)
- scientific article; zbMATH DE number 3982992 (Why is no real title available?)
- scientific article; zbMATH DE number 3520162 (Why is no real title available?)
- scientific article; zbMATH DE number 3571869 (Why is no real title available?)
- scientific article; zbMATH DE number 3356467 (Why is no real title available?)
- scientific article; zbMATH DE number 3381785 (Why is no real title available?)
- The use of Hestenes' method of multipliers to resolve dual gaps in engineering system optimization
- Two-level primal-dual proximal decomposition technique to solve large scale optimization problems
- An incremental primal-dual method for nonlinear programming with special structure
- Decomposition for structured convex programs with smooth multiplier methods
- An augmented Lagrangian based algorithm for distributed nonconvex optimization
- Decomposition methods based on augmented Lagrangians: a survey
- A new technique for nonconvex primal-dual decomposition of a large-scale separable optimization problem
- scientific article; zbMATH DE number 4156208 (Why is no real title available?)
- scientific article; zbMATH DE number 3916053 (Why is no real title available?)
- scientific article; zbMATH DE number 3959143 (Why is no real title available?)
- The method of double truncation in the decomposition of large-scale problems
- scientific article; zbMATH DE number 4074830 (Why is no real title available?)
- scientific article; zbMATH DE number 4091189 (Why is no real title available?)
- Convexification and decomposition of separable nonconvex optimization problems
- Convergence and application of a decomposition method using duality bounds for nonconvex global optimization
- New decomposition and convexification algorithm for nonconvex large-scale primal-dual optimization
This page was built for publication: Two-level primal-dual decomposition technique for large-scale nonconvex optimization problems with constraints
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q750303)
