A parallelizable augmented Lagrangian method applied to large-scale non-convex-constrained optimization problems (Q2414914): Difference between revisions
From MaRDI portal
Changed an Item |
Changed an Item |
||
Property / describes a project that uses | |||
Property / describes a project that uses: CPLEX / rank | |||
Normal rank |
Revision as of 04:52, 29 February 2024
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | A parallelizable augmented Lagrangian method applied to large-scale non-convex-constrained optimization problems |
scientific article |
Statements
A parallelizable augmented Lagrangian method applied to large-scale non-convex-constrained optimization problems (English)
0 references
17 May 2019
0 references
This article presents an improved solution method for large-scale optimization problems with a convex objective but a non-convex constraint set, using a Lagrangian dual solution method. The authors begin with an introduction to the problem and the notation used in the paper, followed by an overview of the relevant literature on augmented Lagrangian methods, proximal bundle methods and their parallelization as well as their variants. The third and fourth sections present the main result of the article where the new algorithm is described in detail and several properties are proven. The article concludes with a section containing the results of a detailed computational experimentation and suggestions for future work.
0 references
augmented Lagrangian method
0 references
proximal bundle method
0 references
nonlinear block Gauss-Seidel method
0 references
simplicial decomposition method
0 references
parallel computing
0 references