Papers
Topics
Authors
Recent
Gemini 2.5 Flash
Gemini 2.5 Flash
131 tokens/sec
GPT-4o
10 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

Note on the Modifed Augmented Lagrangian Method for Minimization of Functions with Large Quadratic Penalties (1806.08021v1)

Published 21 Jun 2018 in math.NA

Abstract: In a recent work (arXiv-DOI: 1804.08072v1) we introduced the Modified Augmented Lagrangian Method (MALM) for the efficient minimization of objective functions with large quadratic penalty terms. From MALM there results an optimality equation system that is related to that of the original objective function. But, it is numerically better behaved, as the large penalty factor is replaced by a milder factor. In our original work, we formulated MALM with an inner iteration that applies a Quasi-Newton iteration to compute the root of a multi-variate function. In this note we show that this formulation of the scheme with a Newton iteration can be replaced conveniently by formulating a well-scaled unconstrained minimization problem. In this note, we briefly review the Augmented Lagrangian Method (ALM) for minimizing equality-constrained problems. Then we motivate and derive the new proposed formulation of MALM for minimizing unconstrained problems with large quadratic penalties. Eventually, we discuss relations between MALM and ALM.

Summary

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