Papers
Topics
Authors
Recent
Gemini 2.5 Flash
Gemini 2.5 Flash
121 tokens/sec
GPT-4o
9 tokens/sec
Gemini 2.5 Pro Pro
47 tokens/sec
o3 Pro
4 tokens/sec
GPT-4.1 Pro
38 tokens/sec
DeepSeek R1 via Azure Pro
28 tokens/sec
2000 character limit reached

Modified Augmented Lagrangian Method for the minimization of functions with quadratic penalty terms (1804.08072v1)

Published 22 Apr 2018 in math.NA

Abstract: The Augmented Lagrangian Method (ALM) is an iterative method for the solution of equality-constrained non-linear programming problems. In contrast to the quadratic penalty method, the ALM can satisfy equality constraints in an exact way. Further, ALM is claimed to converge in less iterations, indicating that it is superior in approach to a quadratic penalty method. It is referred to as an advantage that the ALM solves equality constraints in an exact way, meaning that the penalty parameter does not need to go to infinity in order to yield accurate feasibility for the constraints. However, we sometimes actually want to minimize an unconstrained problem that has large quadratic penalty terms. In these situations it is unclear how the ALM could be utilized in the correct way. This paper presents the answer: We derive a modified version of the ALM that is also suitable for solving functions with large quadratic penalty terms.

Summary

We haven't generated a summary for this paper yet.