摘要

By virtue of the Nesterov's acceleration technique, we establish an accelerated augmented Lagrangian method for solving linearly constrained multi-criteria optimization problem. For this method, we establish its global convergence under suitable condition. Further, we show that its iteration-complexity is O(1/k(2)) which improves the original ALM whose iteration-complexity is O(1/k).