On Lagrange multipliers and constraints II. Augmented Lagrangian approach
Hayatoshi Sayama, Liang Fan, L. S. FAN
Abstract
Hayatoshi Sayama, Liang Fan, L. S. FAN
Abstract
This paper establishes the relations between the changes in the values of the augmented multipliers and the changes in the values of the constraint and objective functions for a non-linear, non-convex programme based on the augmented Lagrangian which was introduced by one of the present authors. If the penalty parameters are sufficiently large, the monotonic relations hold between the augmented multipliers and the constraint functions near the optimal solution. Illustrative examples show that the classical Lagrangian fails to give rise to the relations for a. non-convex programme.
OpenAlex reports 3 citations for this work. Citation counts describe recorded attention and do not establish research quality.
A contribution statement is not available in the OpenAlex record.
Method details are not available in the OpenAlex metadata.
Findings are not separately available in the OpenAlex metadata.
Limitations are not available in the OpenAlex metadata.
Application details are not available in the OpenAlex metadata.
This paper establishes the relations between the changes in the values of the augmented multipliers and the changes in the values of the constraint and objective functions for a non-linear, non-convex programme based on the augmented Lagrangian which was introduced by one of the present authors. If the penalty parameters are sufficiently large, the monotonic relations hold between the augmented multipliers and the constraint functions near the optimal solution. Illustrative examples show that the classical Lagrangian fails to give rise to the relations for a. non-convex programme.
Key concepts: Augmented Lagrangian method, Lagrange multiplier, Constraint (computer-aided design), Mathematics, Lagrangian, Constraint algorithm, Monotonic function, Regular polygon