Solving Problems With Inconsistent Constraints With a Modified Augmented Lagrangian Method

We present a numerical method for the minimization of constrained optimization problems where the objective is augmented with large quadratic penalties of inconsistent equality constraints. Such objectives arise from quadratic integral penalty methods for the direct transcription of optimal control...

Full description

Saved in:
Bibliographic Details
Published in:IEEE transactions on automatic control 2023-04, Vol.68 (4), p.2592-2598
Main Authors: Neuenhofen, Martin P., Kerrigan, Eric C.
Format: Article
Language:English
Subjects:
Aerodynamics
Constraints
Convergence
Lagrangian functions
Minimization
Numerical methods
Optimal control
Optimization
Problem solving
Reliability
Citations: Items that this one cites
Online Access:Get full text
Tags: Add Tag
No Tags, Be the first to tag this record!
Description
Summary:We present a numerical method for the minimization of constrained optimization problems where the objective is augmented with large quadratic penalties of inconsistent equality constraints. Such objectives arise from quadratic integral penalty methods for the direct transcription of optimal control problems. The augmented Lagrangian method (ALM) has a number of advantages over the quadratic penalty method (QPM). However, if the equality constraints are inconsistent, then ALM might not converge to a point that minimizes the bias of the objective and penalty term. Therefore, we present a modification of ALM that fits our purpose. We prove convergence of the modified method and bound its local convergence rate by that of the unmodified method. Numerical experiments demonstrate that the modified ALM can minimize certain quadratic penalty augmented functions faster than QPM, whereas the unmodified ALM converges to a minimizer of a significantly different problem.
ISSN:0018-9286
1558-2523
DOI:10.1109/TAC.2022.3190193