中文

Operations Research Transactions >

2017 , Vol. 21 >Issue 1: 111 - 117

DOI: https://doi.org/10.15960/j.cnki.issn.1007-6093.2017.01.011

A look at the convergence of the augmented  Lagrange method for nondifferentiable convex programming from  the view of a gradient method with constant stepsize

Expand
  • 1. School of Mathematical Sciences, Huaqiao University, Quanzhou 362021, Fujian, China

Received date: 2016-05-11

  Online published: 2017-03-15

Fold

Abstract

The augmented Lagrange method is an effective method for solving nonlinear optimization problems. This paper, from a new pointview, studies the convergence of the augmented Lagrange method for the nonlinear nonsmooth convex programming problem with inequality constraints. The convergence of the gradient method with constant stepsize for the dual problem, based on the augmented Lagrange function, is demonstrated by using a convergence theorem of a gradient method with constant stepsize, from which the global convergence of the multiplier iteration of augmented Lagrange method is obtained.

Key words： gradient method; Moreau envelope; augmented Lagrangian dual; global convergence

Cite this article

TIAN Zhaowei, ZHANG Liwei . A look at the convergence of the augmented  Lagrange method for nondifferentiable convex programming from  the view of a gradient method with constant stepsize[J]. Operations Research Transactions, 2017 , 21(1) : 111 -117 . DOI: 10.15960/j.cnki.issn.1007-6093.2017.01.011

References

[1] Hestenes M R. Multiplier and gradient methods [J]. Journal of Optimization Theory and Applications, 1969, 4: 303-320.
[2] Powell M J D.  A method for nonlinear constraints in minimization problems [C]//Optimization. London: Academic Press, 1969, 283-298.
[3] Rockafellar R T. Lagrange multipliers and optimality [J]. SIAM Review, 1993, 35: 183-238.
[4] Rockafellar R T. Augmented Lagrange multiplier functions and duality in nonconvex programming [J]. SIAM Journal on Control, 1974, 12: 268-285..
[5] Conn A, Gould N, Toint P. A globally convergent augmented Lagrangian algorithm for optimization with general constraints and simple bounds [J]. SIAM Journal on Numerical Analysis, 1991, 28: 545-572.
[6] Wu H X, Luo H Z. Saddle points of general augmented Lagrangian for constrained nonconvex optimization [J]. Journal of Global Optimization, 2012, 53: 683-687.
[7] Liu Y J, Zhang L W. Convergence analysis of the augmented Lagrangian method for nonlinear second-order cone optimization problem [J]. Nonlinear Analysis: Theory, Methods and Applications, 2007, 67: 1359-1373.
[8] 张立卫, 吴佳, 张艺. 变分分析与优化 [M]. 北京: 科学出版社, 2013.
[9] Meng F W, Zhao G Y. On second-order properties of the Moreau-Yosida regularization for constrainted nonsmooth convex programs [J]. Numerical Functional Analysis and Optimization, 2004, 25: 515-529.
[10] Rockafellar R T. A dual approach to solving nonlinear programming problems by unconstrained optimization [J]. Mathematical Programming, 1973, 5: 354-373.
Options
Outlines

/

〈 〉