An adaptive superfast inexact proximal augmented Lagrangian method for smooth nonconvex composite optimization problems

TL;DR

This paper introduces an adaptive superfast proximal augmented Lagrangian method for efficiently solving smooth nonconvex constrained optimization problems, achieving significantly faster results without needing prior parameter knowledge.

Contribution

The paper proposes a novel adaptive inexact proximal augmented Lagrangian method that automatically adjusts parameters, improving computational speed and accuracy in nonconvex optimization.

Findings

Can solve problems over ten times faster than existing methods

Does not require prior knowledge of problem parameters

Effective in high-accuracy solutions

Abstract

This work presents an adaptive superfast proximal augmented Lagrangian (AS-PAL) method for solving linearly-constrained smooth nonconvex composite optimization problems. Each iteration of AS-PAL inexactly solves a possibly nonconvex proximal augmented Lagrangian (AL) subproblem obtained by an aggressive/adaptive choice of prox stepsize with the aim of substantially improving its computational performance followed by a full Lagrangian multiplier update. A major advantage of AS-PAL compared to other AL methods is that it requires no knowledge of parameters (e.g., size of constraint matrix, objective function curvatures, etc) associated with the optimization problem, due to its adaptive nature not only in choosing the prox stepsize but also in using a crucial adaptive accelerated composite gradient variant to solve the proximal AL subproblems. The speed and efficiency of AS-PAL is demonstrated through extensive computational experiments showing that it can solve many instances more than ten times faster than other state-of-the-art penalty and AL methods, particularly when high accuracy is required.