Abstract
We analyze the numerical behaviour of a separable Augmented Lagrangian algorithm. This algorithm which is equivalent to the Proximal Decomposition algorithm in the convex case, uses a dual sequence which convergence is associated with the inverse of the primal penalty parameter. As a consequence, an optimal value for that parameter, which is thus more like a scaling parameter than like a penalty one, is expected, confirming former theoretical results in the strongly convex case.
We propose an implementable algorithm where the scaling parameter is adjusted at each iteration in order to keep the same rate of convergence for both primal and dual sequences. The correcting effect of that parameter update is illustrated on small quadratic problems. The autoscaled decomposition algorithm is then tested on larger block-angular problems with convex or non convex separable cost functions.
This is a preview of subscription content, log in via an institution.
Buying options
Tax calculation will be finalised at checkout
Purchases are for personal use only
Learn about institutional subscriptionsPreview
Unable to display preview. Download preview PDF.
References
Dussault, J. P. (1997) Augmented penalty algorithms. IMA J. of Numer. Anal. 14, 1–24
Eckstein, J., Bertsekas, D. P. (1992) On the Douglas-Rachford splitting method and the proximal point algorithm for maximal monotone operators. Math. Programming 55, 293–318
Gabay, D., Mercier, B. (1976) A dual algorithm for the solution of nonlinear variational inequalities via finite element approximation. Comput. Math. Applic. 2, 17–40
Hamdi, A., Mahey P., Dussault, J. P. (1997) A new decomposition method in nonconvex programming via a separable augmented Lagrangian. In: Gritzmann P., Horst R., Sachs E., Tischatschke R. (Elds.) Recent Advances in Optimization, Lecture Notes in Economics and Mathematical Systems 452, 90–104
Mahey, P., Oualibouch, S., Pham, D. T. (1995) Proximal decomposition on the graph of a maximal monotone operator. SIAM J. Optimization 5, 454–466
Mahey, P., Ouorou, A., Leblanc, L. J., Chifflet, J. An efficient implementation of the proximal decomposition algorithm for routing in telecommunications networks. Networks 31, 227–238
Spingarn, J. E. (1985) Applications of the method of partial inverse to convex programming: decomposition. Math. Programming 32, 199–223
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2000 Springer-Verlag Berlin Heidelberg
About this chapter
Cite this chapter
Mahey, P., Dussault, JP., Benchakroun, A., Hamdi, A. (2000). Adaptive Scaling and Convergence Rates of a Separable Augmented Lagrangian Algorithm. In: Nguyen, V.H., Strodiot, JJ., Tossings, P. (eds) Optimization. Lecture Notes in Economics and Mathematical Systems, vol 481. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-57014-8_19
Download citation
DOI: https://doi.org/10.1007/978-3-642-57014-8_19
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-66905-0
Online ISBN: 978-3-642-57014-8
eBook Packages: Springer Book Archive