Generalized quadratic augmented Lagrangian methods with nonmonotone penalty parameters (Q442809): Difference between revisions
From MaRDI portal
Created a new Item |
Changed an Item |
||
Property / review text | |||
Summary: For the nonconvex optimization problem with both equality and inequality constraints, we introduce a new augmented Lagrangian function and propose the corresponding multiplier algorithm. A new iterative strategy on the penalty parameter is presented. Different global convergence properties are established depending on whether the penalty parameter is bounded. Even if the iterative sequence \(\{x^k\}\) is divergent, we present a necessary and sufficient condition for the convergence of \(\{f(x^k)\}\) to the optimal value. Finally, preliminary numerical experience is reported. | |||
Property / review text: Summary: For the nonconvex optimization problem with both equality and inequality constraints, we introduce a new augmented Lagrangian function and propose the corresponding multiplier algorithm. A new iterative strategy on the penalty parameter is presented. Different global convergence properties are established depending on whether the penalty parameter is bounded. Even if the iterative sequence \(\{x^k\}\) is divergent, we present a necessary and sufficient condition for the convergence of \(\{f(x^k)\}\) to the optimal value. Finally, preliminary numerical experience is reported. / rank | |||
Normal rank | |||
Property / Mathematics Subject Classification ID | |||
Property / Mathematics Subject Classification ID: 65K05 / rank | |||
Normal rank | |||
Property / Mathematics Subject Classification ID | |||
Property / Mathematics Subject Classification ID: 90C26 / rank | |||
Normal rank | |||
Property / zbMATH DE Number | |||
Property / zbMATH DE Number: 6063321 / rank | |||
Normal rank | |||
Property / zbMATH Keywords | |||
quadratic augmented Lagrangian methods | |||
Property / zbMATH Keywords: quadratic augmented Lagrangian methods / rank | |||
Normal rank | |||
Property / zbMATH Keywords | |||
nonmonotone penalty parameters | |||
Property / zbMATH Keywords: nonmonotone penalty parameters / rank | |||
Normal rank | |||
Property / zbMATH Keywords | |||
nonconvex optimization | |||
Property / zbMATH Keywords: nonconvex optimization / rank | |||
Normal rank | |||
Property / zbMATH Keywords | |||
multiplier algorithm | |||
Property / zbMATH Keywords: multiplier algorithm / rank | |||
Normal rank | |||
Property / zbMATH Keywords | |||
convergence | |||
Property / zbMATH Keywords: convergence / rank | |||
Normal rank | |||
Property / zbMATH Keywords | |||
numerical experience | |||
Property / zbMATH Keywords: numerical experience / rank | |||
Normal rank |
Revision as of 02:28, 30 June 2023
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | Generalized quadratic augmented Lagrangian methods with nonmonotone penalty parameters |
scientific article |
Statements
Generalized quadratic augmented Lagrangian methods with nonmonotone penalty parameters (English)
0 references
6 August 2012
0 references
Summary: For the nonconvex optimization problem with both equality and inequality constraints, we introduce a new augmented Lagrangian function and propose the corresponding multiplier algorithm. A new iterative strategy on the penalty parameter is presented. Different global convergence properties are established depending on whether the penalty parameter is bounded. Even if the iterative sequence \(\{x^k\}\) is divergent, we present a necessary and sufficient condition for the convergence of \(\{f(x^k)\}\) to the optimal value. Finally, preliminary numerical experience is reported.
0 references
quadratic augmented Lagrangian methods
0 references
nonmonotone penalty parameters
0 references
nonconvex optimization
0 references
multiplier algorithm
0 references
convergence
0 references
numerical experience
0 references