Smoothing augmented Lagrangian method for nonsmooth constrained optimization problems (Q496609): Difference between revisions
From MaRDI portal
Set profile property. |
Set OpenAlex properties. |
||
Property / full work available at URL | |||
Property / full work available at URL: https://doi.org/10.1007/s10898-014-0242-7 / rank | |||
Normal rank | |||
Property / OpenAlex ID | |||
Property / OpenAlex ID: W2168062993 / rank | |||
Normal rank |
Latest revision as of 21:16, 19 March 2024
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | Smoothing augmented Lagrangian method for nonsmooth constrained optimization problems |
scientific article |
Statements
Smoothing augmented Lagrangian method for nonsmooth constrained optimization problems (English)
0 references
22 September 2015
0 references
A smoothing augmented Lagrangian algorithm is proposed to locate a stationary point of a general nonsmooth and nonconvex optimization problem. The convergence of the algorithm is established. The smoothing augmented Lagrangian method is applied to the bilevel program. The authors verify that either the exact penalty sequence is bounded or the weak generalized Mangasarian Fromovitz constraint qualification holds for all bilevel programs. Some numerical experiments for some general nonsmooth and nonconvex constrained optimization problems and some bilevel programs are reported.
0 references
nonsmooth optimization
0 references
constrained optimization
0 references
smoothing function
0 references
augmented Lagrangian method
0 references
constraint qualification
0 references
bilevel program
0 references
nonconvex optimization
0 references
convergence
0 references
Mangasarian Fromovitz constraint qualification
0 references
numerical experiment
0 references