New decomposition and convexification algorithm for nonconvex large-scale primal-dual optimization (Q911470)
From MaRDI portal
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | New decomposition and convexification algorithm for nonconvex large-scale primal-dual optimization |
scientific article |
Statements
New decomposition and convexification algorithm for nonconvex large-scale primal-dual optimization (English)
0 references
1990
0 references
A new algorithm for solving nonconvex, equality-constrained optimization problems with separable structures is proposed in the present paper. A new augmented Lagrangian function is derived, and an iterative method is presented. The new proposed Lagrangian function preserves separability when the original problem is separable, and the property of linear convergence of the new algorithm is also presented. Unlike earlier algorithms for nonconvex decomposition, the convergence ratio for this method can be made arbitrarily small. Furthermore, it is feasible to extend this method to algorithms suited for inequality-constrained optimization problems. An example is included to illustrate the method.
0 references
primal-dual methods
0 references
decomposition
0 references
convergence analysis
0 references
nonconvex equality-constrained optimization
0 references
separable structures
0 references
augmented Lagrangian
0 references
0 references
0 references
0 references
0 references
0 references