arXiv Analytics

Sign in

arXiv:1907.02401 [math.OC]AbstractReferencesReviewsResources

Complexity and performance of an Augmented Lagrangian algorithm

E. G. Birgin, J. M. Martínez

Published 2019-07-04Version 1

Algencan is a well established safeguarded Augmented Lagrangian algorithm introduced in [R. Andreani, E. G. Birgin, J. M. Mart\'{\i}nez and M. L. Schuverdt, On Augmented Lagrangian methods with general lower-level constraints, SIAM Journal on Optimization 18, pp. 1286-1309, 2008]. Complexity results that report its worst-case behavior in terms of iterations and evaluations of functions and derivatives that are necessary to obtain suitable stopping criteria are presented in this work. In addition, the computational performance of a new version of the method is presented, which shows that the updated software is a useful tool for solving large-scale constrained optimization problems.

Related articles: Most relevant | Search more
arXiv:1204.3034 [math.OC] (Published 2012-04-13, updated 2012-06-18)
Lower Bounds on the Performance of Analog to Digital Converters
arXiv:1901.00695 [math.OC] (Published 2019-01-03)
The Product Knapsack Problem: Approximation and Complexity
arXiv:1006.4661 [math.OC] (Published 2010-06-23, updated 2012-01-19)
A new Lenstra-type Algorithm for Quasiconvex Polynomial Integer Minimization with Complexity 2^O(n log n)