期刊文献+

Unified convergence analysis of a second-order method of multipliers for nonlinear conic programming

原文传递
导出
摘要 In this paper,we accomplish the unified convergence analysis of a second-order method of multipliers(i.e.,a second-order augmented Lagrangian method)for solving the conventional nonlinear conic optimization problems.Specifically,the algorithm that we investigate incorporates a specially designed nonsmooth(generalized)Newton step to furnish a second-order update rule for the multipliers.We first show in a unified fashion that under a few abstract assumptions,the proposed method is locally convergent and possesses a(nonasymptotic)superlinear convergence rate,even though the penalty parameter is fixed and/or the strict complementarity fails.Subsequently,we demonstrate that for the three typical scenarios,i.e.,the classic nonlinear programming,the nonlinear second-order cone programming and the nonlinear semidefinite programming,these abstract assumptions are nothing but exactly the implications of the iconic sufficient conditions that are assumed for establishing the Q-linear convergence rates of the method of multipliers without assuming the strict complementarity.
出处 《Science China Mathematics》 SCIE CSCD 2022年第11期2397-2422,共26页 中国科学:数学(英文版)
基金 supported by National Natural Science Foundation of China (Grant No. 11801158) the Hunan Provincial Natural Science Foundation of China (Grant No. 2019JJ50040) the Fundamental Research Funds for the Central Universities in China supported by National Natural Science Foundation of China (Grant No. 11871002) the General Program of Science and Technology of Beijing Municipal Education Commission (Grant No. KM201810005004)
  • 相关文献

参考文献1

二级参考文献16

  • 1Buys, J. D.: Dual algorithms for constrained optimization problems, Ph. D. Thesis, University of Leiden, the Netherlands, 1972.
  • 2Cai, J. F., Osher, S., Shen, Z. W.: Convergence of the linearized Bregman iteration for h -norm minimization. Math. Comp., 78, 2127-2136 (2009).
  • 3Conn, A., Gould, N., Toint, Ph.: LANCELOT: a Fortran Package for Large-Scale Nonlinear Optimization, Springer Verlag, Berlin, 1992.
  • 4Fletcher, R.: An ideal penalty function for constrained optimization. J. Inst. Maths. Appl., 15, 319-342 (1975).
  • 5Fontecilla, R, Steihaug, T., Tapia, R: A convergence theory for a class of quasi-Newton method for constrained optimization. SIAM J. Numer. Anal., 24, 1133-1151 (1987).
  • 6Hestenes, M. R: Multiplier and gradient methods. J. Opt. Theory Appl., 4, 303-320 (1969).
  • 7Lin, Z. C., Chen, M. M., Ma, Y.: The augmented lagrange multiplier method for exact recovery of corrupted low-rank matrices. Arxiv preprint: arXiv:1009.5055, 2010.
  • 8Powell, M. J. D.: A method for nonlinear constraints in minimization problems. In: Optimization (Fletcher, R, ed.), Academic Press, London, 1969, 283-298.
  • 9Rockafellar, R T.: Augmented Lagrange multiplier functions and duality in non-convex programming. SIAM J. Control, 12, 268-285 (1974).
  • 10Sun, W. Y., Yuan, Y. X.: Optimization Theory and Methods: Nonlinear Programming, Springer, New York, 2006.

共引文献1

相关作者

内容加载中请稍等...

相关机构

内容加载中请稍等...

相关主题

内容加载中请稍等...

浏览历史

内容加载中请稍等...
;
使用帮助 返回顶部