Adaptive augmented Lagrangian methods: algorithms and practical numerical experience. (2nd January 2016)

• Record Type: Journal Article
• Authors: Curtis, Frank E.; Gould, Nicholas I.M.; Jiang, Hao; Robinson, Daniel P.
• Is Part Of: Optimization methods and software. Volume 31:Number 1(2016)
• Page Start: 157
• Page End: 186
• Publication Date: 2016-01-02
• Subjects: nonlinear optimization -- non-convex optimization -- large-scale optimization -- augmented Lagrangians -- matrix-free methods -- steering methods; 49M05 -- 49M15 -- 49M29 -- 49M37 -- 65K05 -- 65K10 -- 90C06 -- 90C30 -- 93B40; Mathematical optimization -- Periodicals; Algorithms -- Periodicals; 519.7
• DOI: 10.1080/10556788.2015.1071813
• Languages: English
• ISSNs: 1055-6788

Abstract

Abstract : In this paper, we consider augmented Lagrangian (AL) algorithms for solving large-scale nonlinear optimization problems that execute adaptive strategies for updating the penalty parameter. Our work is motivated by the recently proposed adaptive AL trust region method by Curtis et al . [ An adaptive augmented Lagrangian method for large-scale constrained optimization, Math. Program. 152 (2015), pp. 201–245.]. The first focal point of this paper is a new variant of the approach that employs a line search rather than a trust region strategy, where a critical algorithmic feature for the line search strategy is the use of convexified piecewise quadratic models of the AL function for computing the search directions. We prove global convergence guarantees for our line search algorithm that are on par with those for the previously proposed trust region method. A second focal point of this paper is the practical performance of the line search and trust region algorithm variants in Matlab software, as well as that of an adaptive penalty parameter updating strategy incorporated into the Lancelot software. We test these methods on problems from the CUTEst and COPS collections, as well as on challenging test problems related to optimal power flow. Our numerical experience suggests that the adaptive algorithms outperform traditional AL methods in terms of efficiency and reliability. As with traditional AL algorithms, the adaptive methods are matrix-free and thus represent a viable option for solving large-scale problems.