Optimization Online


Global and adaptive scaling in a separable augmented lagrangian algorithm

Arnaud LENOIR(lenoir***at***isima.fr)
Philippe MAHEY(philippe.mahey***at***isima.fr)

Abstract: In this paper, we analyze the numerical behaviour of a separable Augmented Lagrangian algorithm with multiple scaling parameters, different parameters associated with each dualized coupling constraint as well as with each subproblem. We show that an optimal superlinear rate of convergence can be theoretically attained in the twice differentiable case and propose an adaptive scaling strategy with the same ideal convergence properties. Numerical tests performed on quadratic programs confirm that Adaptive Global Scaling subsumes former scaling strategies with one or many parameters.

Keywords: Augmented Lagrangian, Decomposition

Category 1: Convex and Nonsmooth Optimization (Convex Optimization )

Citation: Research Report LIMOS RR-07-14, Université Blaise Pascal, Clermont-Ferrand, 2007

Download: [PDF]

Entry Submitted: 11/02/2007
Entry Accepted: 11/02/2007
Entry Last Modified: 11/02/2007

Modify/Update this entry

  Visitors Authors More about us Links
  Subscribe, Unsubscribe
Digest Archive
Search, Browse the Repository


Coordinator's Board
Classification Scheme
Give us feedback
Optimization Journals, Sites, Societies
Mathematical Programming Society